Codeforces Round 180 (Div. 1)

5 problems from Codeforces Round 180 (Div. 1) (contest 297), difficulty 1600-3000. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 180 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1600-3000 | 9m 1s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Parity Game	1700	constructive-algorithms	3,860	1m 24s	✓
B	Fish Weight	1600	constructive-algorithms, greedy	3,766	1m 20s	✓
C	Splitting the Uniqueness	2400	constructive-algorithms	1,020	1m 50s
D	Color the Carpet	2500	constructive-algorithms	628	2m 21s
E	Mystic Carvings	3000	data-structures	433	2m 6s

Practice › Codeforces Solutions › Codeforces Round 180 (Div. 1) ›

CF 297C - Splitting the Uniqueness

We are given an array of distinct non-negative integers s of length n. The goal is to split each element s[i] into a pair of non-negative integers a[i] and b[i] such that a[i] + b[i] = s[i]. We want both a and b to be almost unique.

Practice › Codeforces Solutions › Codeforces Round 180 (Div. 1) ›

CF 297B - Fish Weight

The task is to determine whether it is possible for Alice's total fish weight to strictly exceed Bob's, given only the types of fish each caught. Fish types are numbered from 1 to k in non-decreasing weight order, but the exact weights are unknown.

Practice › Codeforces Solutions › Codeforces Round 180 (Div. 1) ›

CF 297E - Mystic Carvings

We are given a circle with $2n$ labeled points arranged in order around the boundary. Each point is used exactly once as an endpoint of a chord, so the chords form a perfect matching on these $2n$ positions. Each chord connects two boundary points.

Practice › Codeforces Solutions › Codeforces Round 180 (Div. 1) ›

CF 297D - Color the Carpet

We are asked to color an h × w grid using at most k colors, while satisfying as many adjacency constraints as possible. Each square in the grid must be assigned an integer color between 1 and k.

Practice › Codeforces Solutions › Codeforces Round 180 (Div. 1) ›

CF 297A - Parity Game

We are given two binary strings, and we can transform the first string using two operations that behave like a sliding window with a dynamically growing tail. The first operation appends a single bit determined by the parity of the current number of ones in the string.