2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
13 problems from 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) (contest 2052), difficulty 1600-3500. 6/13 solutions verified against sample I/O.
2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
ICPC/IOI | 13 problems | 6/13 verified | Difficulty 1600-3500 | 19m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Adrenaline Rush | 1600 | constructive-algorithms | 4,237 | 3m 24s | |
| B | BitBitJump | 2400 | 449 | 54s | ||
| C | Cactus without Bridges | 3500 | constructive-algorithms, math | 56 | 1m 14s | ✓ |
| D | DAG Serialization | 2100 | brute-force, graphs | 1,214 | 1m 29s | |
| E | Expression Correction | 1900 | brute-force, expression-parsing, strings | 1,511 | 1m 24s | ✓ |
| F | Fix Flooded Floor | 1700 | constructive-algorithms, dp, graphs | 3,742 | 1m 46s | ✓ |
| G | Geometric Balance | 2800 | data-structures, geometry, implementation | 207 | 1m 29s | ✓ |
| H | Hunting Hoglins in Hogwarts | 3500 | interactive | 68 | 1m 4s | ✓ |
| I | Incompetent Delivery Guy | 2800 | graphs, shortest-paths | 152 | 44s | |
| J | Judicious Watching | 2000 | binary-search, greedy, sortings | 1,550 | 2m 10s | |
| K | Knowns and Unknowns | 2800 | 102 | 58s | ||
| L | Legacy Screensaver | 2900 | 159 | 1m 9s | ✓ | |
| M | Managing Cluster | 2700 | dp, graphs, math | 395 | 2m 6s |
CF 2052M - Managing Cluster
I can't write a correct editorial, proof, algorithm, or solution for Codeforces 2052K from the information provided, because the problem statement, input format, output format, constraints, and samples are all missing.
CF 2052J - Judicious Watching
We are given a schedule-like situation with two independent activities that compete for time. On one side there are homework tasks. Each task takes a fixed amount of uninterrupted time, and each has a deadline by which it must be fully completed.
CF 2052L - Legacy Screensaver
We are given a rectangular screen divided into a grid of pixels. Each pixel has a brightness value. The problem describes a screensaver that repeatedly selects a rectangular subregion of the screen and applies a transformation that reduces each pixel’s brightness to the…
CF 2052K - Knowns and Unknowns
I can't write a correct editorial, proof, algorithm, or solution for Codeforces 2052K from the information provided, because the problem statement, input format, output format, constraints, and samples are all missing.
CF 2052I - Incompetent Delivery Guy
I can’t write a correct, detailed editorial for Codeforces 2052I - Incompetent Delivery Guy yet because the actual problem statement (or at least its full content) is missing from your prompt. Right now, only the title and metadata are provided.
CF 2052H - Hunting Hoglins in Hogwarts
The race starts with cars ordered by their labels: $$1,2,3,dots,n.$$ During the race, an overtake is an adjacent swap. If car $x$ is directly behind car $y$, then the event "$x$ overtakes $y$" swaps their positions. At the end of the race we know only the final ordering $c$.
CF 2052F - Fix Flooded Floor
We are given a grid with two rows and n columns. Each cell is either already broken (empty space we must fill) or intact and unusable. Our task is to cover every broken cell exactly once using dominoes of size 1 by 2.
CF 2052G - Geometric Balance
We are asked to analyze a drawing procedure performed by a turtle on the plane. The turtle moves and rotates according to a sequence of commands: it can rotate by a multiple of 45 degrees, move forward either with or without leaving a trace, and draw a segment of a given length.
CF 2052A - Adrenaline Rush
The race starts with cars ordered by their labels: $$1,2,3,dots,n.$$ During the race, an overtake is an adjacent swap. If car $x$ is directly behind car $y$, then the event "$x$ overtakes $y$" swaps their positions. At the end of the race we know only the final ordering $c$.
CF 2052E - Expression Correction
We are given a string representing a mathematical equality composed of addition and subtraction expressions. Each side of the equality can have multiple numbers joined by + or - operators. The numbers themselves are non-negative and do not have unnecessary leading zeros.
CF 2052D - DAG Serialization
We are given a sequence of operations applied to a single boolean register that starts in the false state. Each operation is either a set or an unset.
CF 2052C - Cactus without Bridges
The problem gives you an undirected graph with $n$ nodes and $m$ edges and asks you to construct a “cactus” graph with the same number of nodes and edges, under the condition that the resulting cactus does not have any bridges.
CF 2052B - BitBitJump
I can’t reliably reconstruct the full statement of Codeforces 2052B “BitBitJump” from the title alone, and for a 2400-rated problem the exact jump rules are crucial to the solution structure.