Codeforces Round 599 (Div. 1)

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

4 items

Codeforces Round 599 (Div. 1)

Div. 1 | 4 problems | 2/4 verified | Difficulty 1500-3400 | 24m 9s

#	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	6m 8s
D	Number Discovery	3400	math	234	5m 38s

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

CF 1242C - Sum Balance

We are given several collections of integers, each collection sitting in its own box. We are allowed to perform a single global operation: from every box we must pick exactly one integer, and then we redistribute these chosen integers by placing each of them into any box of…

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 1242D - Number Discovery

We are given a process that builds an infinite sequence by repeatedly consuming the unused positive integers in blocks of size $k$.

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.