Codeforces Round 1033 (Div. 2) and CodeNite 2025

7 problems from Codeforces Round 1033 (Div. 2) and CodeNite 2025 (contest 2120), difficulty 800-3000. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 1033 (Div. 2) and CodeNite 2025

Div. 2 | 7 problems | 3/7 verified | Difficulty 800-3000 | 13m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Square of Rectangles	800	geometry, math	20,320	1m 56s	✓
B	Square Pool	1000	geometry	17,732	1m 17s	✓
C	Divine Tree	1400	constructive-algorithms, greedy, math	12,590	2m 35s
D	Matrix game	1800	combinatorics, math	5,776	1m 28s
E	Lanes of Cars	2300	binary-search, dp, ternary-search	1,868	2m 32s	✓
F	Superb Graphs	2600	2-sat, graphs	476	1m 34s
G	Eulerian Line Graph	3000	graphs, greedy, math	108	1m 49s

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120G - Eulerian Line Graph

We are given a simple, connected graph $G$ with $n$ vertices and $m$ edges, and we are asked to examine the properties of its iterated line graph $L^k(G)$.

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120E - Lanes of Cars

Each lane initially contains ai cars. If nobody moves, the cars in a lane leave one per second, so a lane of size x contributes $$1+2+dots+x=frac{x(x+1)}2$$ to the total angriness. Cars may switch lanes.

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120F - Superb Graphs

We are given several graphs on the same vertex set. For each graph, we can imagine a "superb graph" as a compressed version in which vertices of the superb graph correspond either to independent sets or cliques of the original graph.

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120D - Matrix game

We are asked to determine the smallest size of a matrix Aryan should request from Harshith to guarantee that Aryan can always find a submatrix of size $a times b$ filled with identical numbers.

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120C - Divine Tree

We are asked to construct a rooted tree of n nodes with a special property: each node has a divineness, which is the smallest node label on the path from the root to that node.

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120A - Square of Rectangles

We are given three axis-aligned rectangles. Their dimensions are already ordered so that $$l3 le l2 le l1$$ and $$b3 le b2 le b1.$$ The rectangles cannot be rotated.

Practice › Codeforces Solutions › Codeforces Round 1033 (Div. 2) and CodeNite 2025 ›

CF 2120B - Square Pool

We are given a square pool table of side length $s$ with pockets at the four corners. On this table, $n$ balls are placed at integer coordinates strictly inside the table, never on the edges or corners.