Codeforces Round 1082 (Div. 2)

Solutions for Codeforces Round 1082 (Div. 2) (contest 2202). 1/9 problems verified against sample I/O. Difficulty range: 800-2800.

9 items

Codeforces Round 1082 (Div. 2)

Type: Div. 2 | Problems: 9 | Verified: 1/9 | Rating range: 800-2800 | Time: 14m 8s

Problem Name Rating Tags Solve Time Verified
A Parkour Design 800 math 1m 48s ✓
B ABAB Construction 1200 dp, greedy, implementation 2m 8s ✗
C1 Lost Civilization (Easy Version) 1300 data-structures, dsu, greedy 1m 44s ✗
C2 Lost Civilization (Hard Version) 1700 data-structures, dp, dsu 1m 25s ✗
D Recollect Numbers 1700 constructive-algorithms, implementation 29s ✗
E Rigged Bracket Sequence 2000 dp 1m 24s ✗
F Binary Not Search and Queries 2500 data-structures, greedy 1m 37s ✗
G1 Monotone Monochrome Matrices (Easy Version) 2500 data-structures 2m 3s ✗
G2 Monotone Monochrome Matrices (Hard Version) 2800 data-structures 1m 30s ✗
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202G2 - Monotone Monochrome Matrices (Hard Version)

We are maintaining a very large square grid that starts completely empty, meaning every cell is white. Over time, we flip some cells to black, one by one, and after each flip we must decide whether the resulting black-white pattern is still “valid” under a global…
codeforces competitive-programming data-structures Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202G1 - Monotone Monochrome Matrices (Easy Version)

The value $V = 7frac{1}{16}$ corresponds to the chi-square statistic computed from $k = 11$ categories, as in Eq. (5). The number of degrees of freedom is therefore $nu = k - 1 = 10$.
codeforces competitive-programming data-structures Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202F - Binary Not Search and Queries

We are asked to maintain a sequence of integers and repeatedly compute two properties after point updates. Specifically, for a given array a of length n, we want to find, after each update, the largest length k such that there exist two subarrays of length k with identical…
codeforces competitive-programming data-structures greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202E - Rigged Bracket Sequence

We are given a balanced bracket sequence, meaning every prefix has at least as many opening brackets as closing brackets, and the total numbers match at the end. From this sequence, we choose a non-empty subset of positions.
codeforces competitive-programming dp Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202B - ABAB Construction

The value $V = 7frac{1}{16}$ corresponds to the chi-square statistic computed from $k = 11$ categories, as in Eq. (5). The number of degrees of freedom is therefore $nu = k - 1 = 10$.
codeforces competitive-programming dp greedy implementation Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202D - Recollect Numbers

Working
codeforces competitive-programming constructive-algorithms implementation Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202C1 - Lost Civilization (Easy Version)

We are asked to reverse-engineer a process that generates a sequence by repeatedly inserting an incremented copy of an existing element immediately after that element.
codeforces competitive-programming data-structures dsu greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202C2 - Lost Civilization (Hard Version)

We are given a sequence of integers, and the task revolves around understanding a generative procedure used by an ancient civilization.
codeforces competitive-programming data-structures dp dsu greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1082 (Div. 2) ›

CF 2202A - Parkour Design

The problem is about building a sequence of moves on a 2D integer grid starting at the origin (0,0) and ending at a target point (x,y).
codeforces competitive-programming math Jun 7, 2026