Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2)

7 problems from Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) (contest 2122), difficulty 800-3400. 2/7 solutions verified against sample I/O.

7 items

Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2)

Div. 1+2 | 7 problems | 2/7 verified | Difficulty 800-3400 | 12m 47s

# Problem Rating Tags Accepted Time ✓
A Greedy Grid 800 constructive-algorithms, greedy 19,198 1m 9s ✓
B Pile Shuffling 1100 greedy, math 15,212 2m 32s
C Manhattan Pairs 1700 constructive-algorithms, geometry, greedy 8,389 1m 45s
D Traffic Lights 2400 brute-force, data-structures, divide-and-conquer 2,470 51s ✓
E Greedy Grid Counting 2600 combinatorics, dp, greedy 1,075 1m 34s
F Colorful Polygon 3400 constructive-algorithms, divide-and-conquer, geometry 129 3m 33s
G Tree Parking 3300 combinatorics, fft, math 304 1m 23s
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122F - Colorful Polygon

We are given a small array of integers $a = [a1, a2, dots, an]$, with $n le 8$ and a total sum $S = a1 + dots + an le 100$.
codeforces competitive-programming constructive-algorithms divide-and-conquer geometry Jun 8, 2026
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122G - Tree Parking

We are asked to count valid parking schedules for cars on a tree. Each vertex of the tree will eventually host one car.
codeforces competitive-programming combinatorics fft math trees Jun 8, 2026
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122E - Greedy Grid Counting

We are given a $2 times n$ grid with some cells already filled with integers between $1$ and $k$, while other cells are empty.
codeforces competitive-programming combinatorics dp greedy math Jun 8, 2026
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122B - Pile Shuffling

We are given several piles of tiles, each containing some zeros stacked on top of ones. For each pile, we know both the initial configuration and the target configuration, where the target also consists of some zeros on top of some ones.
codeforces competitive-programming greedy math Jun 8, 2026
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122D - Traffic Lights

The problem describes a connected, simple undirected graph with n vertices and m edges. A token starts at vertex 1 at time 0. At each integer second t, if the token is at vertex u, you have two choices: either wait one second at u, or move along a specific edge of u.
codeforces competitive-programming brute-force data-structures divide-and-conquer dp graphs greedy shortest-paths Jun 8, 2026
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122C - Manhattan Pairs

We are given a set of points on a 2D plane, and the number of points is always even. Our task is to pair all points into disjoint pairs such that the sum of Manhattan distances between the points in each pair is maximized.
codeforces competitive-programming constructive-algorithms geometry greedy math sortings Jun 8, 2026
Practice › Codeforces Solutions › Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) ›

CF 2122A - Greedy Grid

We are working on a grid where each cell contains a nonnegative number, and we are only allowed to move either right or down starting from the top-left corner. Any such path from the top-left to the bottom-right has a total score equal to the sum of all visited cells.
codeforces competitive-programming constructive-algorithms greedy Jun 8, 2026