Codeforces Round 597 (Div. 2)

6 problems from Codeforces Round 597 (Div. 2) (contest 1245), difficulty 1000-2300. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 597 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 1000-2300 | 21m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Good ol' Numbers Coloring	1000	math, number-theory	14,891	3m 15s	✓
B	Restricted RPS	1200	constructive-algorithms, dp, greedy	14,528	2m 59s	✓
C	Constanze's Machine	1400	dp	19,872	2m 6s	✓
D	Shichikuji and Power Grid	1900	dsu, graphs, greedy	9,599	3m 18s
E	Hyakugoku and Ladders	2300	dp, probabilities, shortest-paths	1,364	3m 29s
F	Daniel and Spring Cleaning	2300	bitmasks, brute-force, combinatorics	2,263	6m 2s	✓

Practice › Codeforces Solutions › Codeforces Round 597 (Div. 2) ›

CF 1245E - Hyakugoku and Ladders

The game can be viewed as a directed line of states arranged along a fixed serpentine path on a 10 by 10 grid. Each cell corresponds to a position on this path, starting from the bottom-left cell and ending at the top-left cell.

Practice › Codeforces Solutions › Codeforces Round 597 (Div. 2) ›

CF 1245D - Shichikuji and Power Grid

We are given a set of cities placed on a plane. Each city can be “powered” in one of two ways: either we directly build a power station in it, or we connect it (directly or indirectly through other cities) to a city that already has a power station.

Practice › Codeforces Solutions › Codeforces Round 597 (Div. 2) ›

CF 1245C - Constanze's Machine

We receive a string that is claimed to be produced by a slightly broken writing machine. The machine normally prints each spoken letter as itself, but two special letters behave differently: if the user says w, the machine writes uu, and if the user says m, it writes nn.

Practice › Codeforces Solutions › Codeforces Round 597 (Div. 2) ›

CF 1245F - Daniel and Spring Cleaning

We are given a range of integers from l to r, and we need to count ordered pairs (a, b) inside this range such that adding them behaves exactly like XOR. In other words, the usual addition of a and b produces the same result as their bitwise XOR.

Practice › Codeforces Solutions › Codeforces Round 597 (Div. 2) ›

CF 1245A - Good ol' Numbers Coloring

We are given two step sizes, a and b. Starting from zero, we paint every nonnegative integer in increasing order, but whether a number becomes white depends on whether it can be reached from already white numbers by repeatedly adding either a or b. Formally, zero starts as white.

Practice › Codeforces Solutions › Codeforces Round 597 (Div. 2) ›

CF 1245B - Restricted RPS

We are given a sequence of rock-paper-scissors moves played by Bob. Alongside this, Alice has a fixed inventory of moves: she must play exactly a specified number of Rocks, Papers, and Scissors across all rounds.