Codeforces Round 599 (Div. 1)

5 problems from Codeforces Round 599 (Div. 1) (contest 1242), difficulty 1500-3400. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 599 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1500-3400 | 17m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Tile Painting	1500	constructive-algorithms, math, number-theory	13,265	6m 35s	✓
B	0-1 MST	1900	dfs-and-similar, dsu, graphs	9,241	5m 48s	✓
C	Sum Balance	2400	bitmasks, dfs-and-similar, dp	1,947	1m 43s
D	Number Discovery	3400	math	234	1m 42s
E	Planar Perimeter	3200	constructive-algorithms, graphs	155	1m 38s

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

CF 1242C - Sum Balance

We are given several containers, each holding a multiset of distinct integers. A single operation is performed exactly once: from every container, we must pick exactly one value, and then redistribute those chosen values back into the containers so that each container still…

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

CF 1242D - Number Discovery

We are asked to reconstruct a very unusual infinite sequence that is generated in rounds. Each round repeatedly looks at the smallest positive integers that have not yet appeared in the sequence.

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

CF 1242E - Planar Perimeter

We are asked to construct a planar structure made of polygonal faces, where each face is a simple cycle in a shared graph. Each face i must have exactly ai vertices on its boundary. Whenever two faces touch, they must share an entire edge, not just a vertex.

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

CF 1242B - 0-1 MST

We are given a complete undirected graph on $n$ vertices. Every pair of vertices is connected, but edges come in only two possible weights: either 0 or 1. Among all $binom{n}{2}$ edges, exactly $m$ of them have weight 1, and every other edge implicitly has weight 0.

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

CF 1242A - Tile Painting

We are given a path of length n, where each position is a tile arranged in a straight line. We assign a color to every tile. The constraint is not local adjacency, but global structure tied to divisors of n.