2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)
13 problems from 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) (contest 1250), difficulty 800-3100. 5/13 solutions verified against sample I/O.
2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)
ICPC/IOI | 13 problems | 5/13 verified | Difficulty 800-3100 | 58m 4s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Berstagram | 1400 | implementation | 4,416 | 7m 25s | ✓ |
| C | Trip to Saint Petersburg | 2100 | data-structures | 1,447 | 2m 58s | |
| D | Conference Problem | 3000 | dp | 216 | 8m 11s | |
| E | The Coronation | 2300 | graphs, implementation | 909 | 5m 28s | |
| F | Data Center | 800 | brute-force, implementation | 8,383 | 2m 26s | ✓ |
| G | Discarding Game | 2300 | dp, greedy, two-pointers | 775 | 4m 41s | |
| H | Happy Birthday | 1500 | math | 4,290 | 4m 10s | ✓ |
| I | Show Must Go On | 3100 | binary-search, brute-force, greedy | 171 | 2m 47s | |
| J | The Parade | 1800 | binary-search, greedy | 3,244 | 1m 59s | ✓ |
| K | Projectors | 3100 | flows, graphs | 319 | 2m 33s | |
| L | Divide The Students | 1500 | binary-search, greedy, math | 4,689 | 7m 8s | ✓ |
| M | SmartGarden | 2500 | constructive-algorithms, divide-and-conquer | 391 | 4m 17s | |
| N | Wires | 2000 | dfs-and-similar, graphs, greedy | 1,765 | 4m 1s |
CF 1250L - Divide The Students
We are given three groups of students determined by their preferred programming language. The task is to split all students into exactly three practice groups. The only restriction is that a single group is not allowed to contain both Assembler fans and C++ fans at the same time.
CF 1250M - SmartGarden
The garden is an $n times n$ grid. Some cells contain slabs and all other cells contain plants. The slab structure is very rigid: every cell on the main diagonal is a slab, and any cell strictly below the diagonal that is directly adjacent (up, down, left, right) to a diagonal…
CF 1250N - Wires
Each wire connects two contact points, and wires become connected to each other if they share at least one endpoint, either directly or through a chain of shared endpoints.
CF 1250K - Projectors
We are given two families of time intervals: lectures and seminars. Each lecture must be assigned a dedicated HD projector, while each seminar can use any projector, HD or ordinary.
CF 1250G - Discarding Game
We are given two sequences of gains over time, one for a human player and one for a computer. They accumulate points step by step. The game normally would end when either side reaches at least $k$ points, and that player immediately loses. The twist is a “reset” operation.
CF 1250I - Show Must Go On
We are given a set of dancers, each with a positive weight called awkwardness. A concert is defined by choosing any subset of dancers, and the “cost” of a concert is the sum of awkwardness values of its chosen dancers.
CF 1250D - Conference Problem
We are given several scientists, each of whom stays at the conference for a continuous interval of days. Some scientists also declare their country, while others leave it unspecified.
CF 1250E - The Coronation
We are given several binary strings of equal length. Each string represents a necklace, and each position is either type 0 or type 1. We may optionally reverse some of these strings.
CF 1250C - Trip to Saint Petersburg
We are choosing a continuous stay interval on a number line of days, and optionally selecting some projects whose full time ranges must lie inside that stay. Each project gives a fixed profit if taken, but staying itself costs a fixed amount per day.
CF 1250H - Happy Birthday
We are given a collection of digit candles, where each digit from 0 to 9 appears a certain number of times. Each candle can be reused infinitely, so the counts do not deplete when we form numbers.
CF 1250F - Data Center
We are given a target area $n$, and we want to build a rectangle whose sides are integers and whose area is exactly $n$. Every valid rectangle corresponds to choosing two integers $a$ and $b$ such that $a cdot b = n$.
CF 1250A - Berstagram
We are simulating a social media feed where posts continuously swap positions based on incoming likes. Initially, posts are arranged in a fixed vertical order from top to bottom, with post 1 at the top and post n at the bottom.
CF 1250J - The Parade
We are asked to arrange soldiers of various heights into a parade formation with exactly $k$ rows. Each row must have the same number of soldiers, and within a row, no two soldiers can differ in height by more than one.