2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
Solutions for 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) (contest 2038). 6/14 problems verified against sample I/O. Difficulty range: 800-3000.
2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
Type: ICPC/IOI | Problems: 14 | Verified: 6/14 | Rating range: 800-3000 | Time: 27m 19s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Bonus Project | 1400 | games, greedy | 2m 9s | ✗ |
| B | Make It Equal | 2100 | binary-search, brute-force, greedy | 2m 4s | ✗ |
| C | DIY | 1400 | data-structures, geometry, greedy | 2m 19s | ✗ |
| D | Divide OR Conquer | 2400 | binary-search, bitmasks, data-structures | 1m 41s | ✓ |
| E | Barrels | 2900 | data-structures, greedy, math | 2m 18s | ✗ |
| F | Alternative Platforms | 2500 | combinatorics, data-structures, fft | 1m 50s | ✗ |
| G | Guess One Character | 1900 | constructive-algorithms, implementation, interactive | 2m 7s | ✗ |
| H | Galactic Council | 3000 | flows | 3m 7s | ✓ |
| I | Polyathlon | 2500 | binary-search, data-structures, hashing | 1m 33s | ✓ |
| J | Waiting for... | 800 | greedy, implementation | 1m 48s | ✓ |
| K | Grid Walk | 2100 | brute-force, dp, greedy | 1m 4s | ✓ |
| L | Bridge Renovation | 1400 | brute-force, dp, greedy | 2m 17s | ✓ |
| M | Royal Flush | 2800 | dp, implementation | 1m 38s | ✗ |
| N | Fixing the Expression | 800 | implementation | 1m 24s | ✗ |
CF 2038G - Guess One Character
We are given an interactive problem where the judge has a hidden binary string s of length n. Our goal is to identify at least one character in s by asking up to three queries per test case. Each query asks how many times a binary substring t occurs contiguously in s.
CF 2038N - Fixing the Expression
We are given a very small expression of fixed length three. The first and last characters are digits, and the middle character is a comparison operator: less than, equal, or greater than.
CF 2038M - Royal Flush
We are repeatedly simulating a constrained card game where the only thing that ultimately matters is whether we ever manage to hold a very specific 5-card pattern: the Royal Flush of some suit.
CF 2038E - Barrels
We are asked to maximize the water volume in the first of a sequence of connected barrels by adding clay into any barrel. Each barrel has a water column, and adjacent barrels are connected by horizontal pipes at given heights.
CF 2038F - Alternative Platforms
We are given a collection of bloggers, where each blogger has two independent activity counts: how many videos they uploaded to platform A and how many to platform B. A user does not necessarily watch all bloggers equally.
CF 2038D - Divide OR Conquer
We are given an array of integers and asked to count the number of ways to partition it into contiguous subarrays such that the bitwise OR of each subarray is non-decreasing from left to right. Each element must belong to exactly one subarray.
CF 2038C - DIY
We are given a list of integers, and each integer can represent either an x-coordinate or a y-coordinate. The task is to choose eight integers from this list and form four points in the 2D plane so that these four points become the corners of a rectangle whose sides are…
CF 2038A - Bonus Project
We have a team of engineers, each with a promised bonus and a personal cost for doing one unit of work. The team needs to complete a project that requires exactly $k$ units of work, and every engineer will decide individually how much to contribute.
CF 2038B - Make It Equal
The failure you show is not enough to diagnose the algorithm itself. Let's trace what happened: The input contains 5 test cases: The program produced only: instead of: This means the code successfully processed the first test case and then terminated before handling the…
CF 2038L - Bridge Renovation
We are asked to compute the minimum number of standard-length planks, each 60 units long, needed to cover three bridges that have different widths. Each bridge requires n planks to span its width: the first bridge needs planks of length 18, the second 21, and the third 25.
CF 2038H - Galactic Council
Each turn in this game is a small strategic decision that affects two coupled systems at once. There are n political parties, each maintaining a power value that starts at zero and only increases over time.
CF 2038K - Grid Walk
We are asked to move through an $n times n$ grid from the top-left corner to the bottom-right corner, only stepping right or down. Every cell $(i, j)$ contributes a cost that depends only on its row index and column index through greatest common divisors: $gcd(i, a) + gcd(j, b)$.
CF 2038J - Waiting for...
We process a timeline of events at a bus stop. There are two kinds of events. A P x event means x ordinary passengers arrive and start waiting. A B x event means a bus arrives with x free seats. When a bus arrives, ordinary passengers always board before Monocarp.
CF 2038I - Polyathlon
We are asked to simulate a multi-sport elimination competition with a twist: each participant has a binary skill vector indicating which sports they are proficient in.