European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
11 problems from European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) (contest 2068), difficulty 1900-3500. 4/11 solutions verified against sample I/O.
European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
ICPC/IOI | 11 problems | 4/11 verified | Difficulty 1900-3500 | 17m 46s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Condorcet Elections | 2300 | constructive-algorithms, graphs, greedy | 997 | 1m 20s | ✓ |
| B | Urban Planning | 3100 | constructive-algorithms | 143 | 1m 30s | ✓ |
| C | Ads | 2100 | binary-search, greedy, two-pointers | 1,637 | 2m 40s | |
| D | Morse Code | 3100 | dp, sortings, trees | 265 | 1m 56s | ✓ |
| E | Porto Vs. Benfica | 2800 | data-structures, dfs-and-similar, dsu | 369 | 1m 44s | |
| F | Mascot Naming | 1900 | brute-force, greedy, implementation | 1,482 | 1m 3s | |
| G | A Very Long Hike | 3500 | shortest-paths | 62 | 1m 52s | |
| H | Statues | 2700 | constructive-algorithms, greedy, math | 405 | 1m 23s | ✓ |
| I | Pinball | 3500 | graphs, shortest-paths | 61 | 47s | |
| J | The Ultimate Wine Tasting Event | 2000 | combinatorics, greedy | 1,611 | 2m 3s | |
| K | Amusement Park Rides | 3000 | flows, graphs | 206 | 1m 28s |
CF 2068J - The Ultimate Wine Tasting Event
We are given a row of $2n$ wine bottles, exactly half white and half red. Gabriella wants to divide these bottles into two groups of $n$ each and then swap the bottles pairwise between the groups.
CF 2068K - Amusement Park Rides
We are asked to schedule three friends to ride every attraction in an amusement park exactly once, where each ride has a periodic schedule. Each attraction operates at multiples of its own interval ai.
CF 2068G - A Very Long Hike
We are asked to model movement across an infinite, periodic two-dimensional terrain. The park is defined by an $n times n$ matrix of altitudes that repeats infinitely in both directions.
CF 2068H - Statues
We are asked to place n statues on a 2D integer grid, starting at (0, 0) and ending at (a, b), such that the Manhattan distance between consecutive statues exactly matches a given sequence d1, ..., d{n-1}.
CF 2068I - Pinball
I can't reliably write a complete editorial and correct reference solution for Codeforces 2068I from the problem statement alone. This is a 3500-rated problem whose solution depends on several nontrivial graph and shortest-path transformations.
CF 2068F - Mascot Naming
I can't reliably write a complete accepted editorial for Codeforces 2068F from the statement alone. This problem's accepted solution is quite non-trivial.
CF 2068D - Morse Code
We are given a set of symbols, each used with a known probability. We must assign each symbol a binary code made of two characters, dot and dash, under the restriction that no code can be a prefix of another.
CF 2068E - Porto Vs. Benfica
We are given a large undirected, unweighted graph representing a road network. One vertex is the starting point (Lisbon, vertex 1) and another is the destination (Porto, vertex n).
CF 2068C - Ads
Working
CF 2068B - Urban Planning
The task is to design a city represented as a rectangular grid of cells, each being either a park or a built-up area.
CF 2068A - Condorcet Elections
We are given a directed relationship between candidates, where an input pair “a defeats b” is not a vote but a constraint on the final outcome we must simulate.