Codeforces Round 482 (Div. 2)

5 problems from Codeforces Round 482 (Div. 2) (contest 979), difficulty 1000-2400. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 482 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1000-2400 | 8m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Pizza, Pizza, Pizza!!!	1000	math	14,574	1m 6s	✓
B	Treasure Hunt	1800	greedy	4,779	1m 14s	✓
C	Kuro and Walking Route	1600	dfs-and-similar, trees	7,333	2m 52s
D	Kuro and GCD and XOR and SUM	2200	binary-search, bitmasks, brute-force	2,176	1m 51s
E	Kuro and Topological Parity	2400	dp	908	1m 54s

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

CF 979E - Kuro and Topological Parity

We are given a line of numbered positions from 1 to n. Some positions already have a fixed color, either 0 or 1, while others are uncolored and must be assigned one of these two values.

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

CF 979D - Kuro and GCD and XOR and SUM

We are maintaining a dynamic multiset of positive integers. The structure supports insertions, and after each insertion phase we may receive queries asking us to pick one previously inserted value that satisfies three simultaneous constraints with respect to a fixed query triple.

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

CF 979C - Kuro and Walking Route

We are given a tree, meaning a connected graph with exactly one simple path between any two towns. Every ordered pair of distinct towns defines a walking route that follows that unique path. Among all possible ordered pairs of towns, some are considered invalid.

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

CF 979B - Treasure Hunt

We are given three strings of equal length, each representing a ribbon owned by one of three players. In one move, a player can change exactly one character in their string to any other letter.

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

CF 979A - Pizza, Pizza, Pizza!!!

We are given a number of friends attending a pizza party, and the host must divide a circular pizza into exactly equal slices so that there are one slice per person, including the host. If there are $n$ friends, the pizza must be split into $n + 1$ equal parts.