Codeforces Round 1024 (Div. 2)

Solutions for Codeforces Round 1024 (Div. 2) (contest 2102). 2/6 problems verified against sample I/O. Difficulty range: 900-2500.

6 items

Codeforces Round 1024 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 900-2500 | Time: 9m 46s

Problem Name Rating Tags Solve Time Verified
A Dinner Time 900 constructive-algorithms, math 1m 17s ✓
B The Picky Cat 900 implementation, sortings 1m 28s ✓
C Mex in the Grid 1300 constructive-algorithms 1m 29s ✗
D Quartet Swapping 1800 data-structures, greedy, sortings 2m 16s ✗
E 23 Kingdom 2200 data-structures, greedy, ternary-search 1m 35s ✗
F Mani and Segments 2500 data-structures, greedy 1m 41s ✗
Practice › Codeforces Solutions › Codeforces Round 1024 (Div. 2) ›

CF 2102F - Mani and Segments

We are given a permutation and asked to count how many of its contiguous segments have a very specific structural property involving order.
codeforces competitive-programming data-structures greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1024 (Div. 2) ›

CF 2102D - Quartet Swapping

We have a permutation and a single allowed operation on four consecutive positions: $$[ai,a{i+1},a{i+2},a{i+3}] rightarrow [a{i+2},a{i+3},ai,a{i+1}]$$ Viewed differently, the element at position $i$ swaps with $i+2$, and the element at position $i+1$ swaps with $i+3$.
codeforces competitive-programming data-structures greedy sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1024 (Div. 2) ›

CF 2102E - 23 Kingdom

We are asked to maximize the "beauty" of a derived array based on an input array. The input array a gives an upper bound on each element of a new array b, which must have the same length. Each element of b satisfies 1 ≤ bi ≤ ai.
codeforces competitive-programming data-structures greedy ternary-search two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1024 (Div. 2) ›

CF 2102C - Mex in the Grid

We are asked to place all integers from $0$ to $n^2 - 1$ into an $n times n$ grid, each number used exactly once.
codeforces competitive-programming constructive-algorithms Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1024 (Div. 2) ›

CF 2102B - The Picky Cat

We are given an array where each element has a fixed absolute value that is unique across the array. We are allowed to flip the sign of any elements independently any number of times.
codeforces competitive-programming implementation sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1024 (Div. 2) ›

CF 2102A - Dinner Time

We are trying to construct an integer sequence of length $n$, where we are allowed to use negative values, such that two different constraints hold at the same time. First, the total sum of the entire sequence must equal a given value $m$.
codeforces competitive-programming constructive-algorithms math Jun 8, 2026