2023-2024 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
13 problems from 2023-2024 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals) (contest 104772), difficulty -. 5/13 solutions verified against sample I/O.
2023-2024 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
ICPC/IOI | 13 problems | 5/13 verified | Difficulty - | 18m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Axis-Aligned Area | 53s | ✓ | |||
| B | Based Zeros | 1m 32s | ||||
| C | Colorful Village | 2m 15s | ||||
| D | Divisibility Trick | 1m 35s | ||||
| E | Every Queen | 1m 35s | ||||
| F | First Solved, Last Coded | 1m 4s | ✓ | |||
| G | Game of Nim | 1m 33s | ✓ | |||
| H | H-Shaped Figures | 34s | ✓ | |||
| I | Intersegment Activation | 49s | ✓ | |||
| J | Jumping Frogs | 1m 31s | ||||
| K | Kitchen Timer | 1m 28s | ||||
| L | Loops | 1m 49s | ||||
| M | Missing Vowels | 1m 22s |
CF 104772M - Missing Vowels
We are given two strings that represent the same place or name written in two different ways. The first string is a shortened version, while the second string is the full version.
CF 104772L - Loops
We are given an $n times m$ grid, and we must fill it with a permutation of the numbers from $1$ to $nm$. The only constraint on this filling is not global but local: every $2 times 2$ subgrid induces a “loop type” determined by how the four corner values are arranged…
CF 104772K - Kitchen Timer
We are given a device that builds a total heating time using a sequence of button presses. Each press contributes a value that depends on how many times we have pressed continuously without interruption.
CF 104772J - Jumping Frogs
We are given two snapshots of the same system of frogs sitting on numbered lily pads. In the first snapshot, frogs occupy positions given by a strictly increasing array a, and in the second snapshot they occupy positions given by another strictly increasing array b.
CF 104772I - Intersegment Activation
We are given a system of segments defined over a line of cells. Each segment is an interval $[l, r]$, and each such interval may be either active or inactive. A cell is considered visible only if no active interval covers it. Otherwise it is hidden.
CF 104772C - Colorful Village
We are given a tree with $2n$ vertices. Each vertex is assigned a color, and every color appears exactly twice, so the vertices are naturally grouped into $n$ disjoint pairs. The graph is connected and has exactly $2n-1$ edges, so it is a tree.
CF 104772E - Every Queen
We are given several queens placed on an infinite integer grid. Each queen attacks along its row, its column, and both diagonals, exactly like in standard chess. Since pieces do not block each other, a queen’s attack extends infinitely in all four directions along those lines.
CF 104772H - H-Shaped Figures
We are given a fixed directed segment defined by two points $P$ and $Q$. In addition, there are $n$ candidate line segments scattered on the plane. Each candidate segment can be used as a “vertical bar” in a geometric configuration.
CF 104772B - Based Zeros
We are given a positive integer $n$, and we are allowed to write it in any base $b ge 2$. For each base, we look at the standard positional representation of $n$ in that base and count how many digits are zero.
CF 104772G - Game of Nim
We are given a total of $n$ stones. Georgiy first fixes one pile of size $p$, and then Gennady splits the remaining $N = n - p$ stones into any multiset of positive integer pile sizes.
CF 104772F - First Solved, Last Coded
We are given two sequences of length n that describe the same multiset of problem topics. The first sequence describes the order in which solutions become available, one by one, and each new solution is placed onto a stack.
CF 104772D - Divisibility Trick
We are asked to construct a positive integer that behaves in a very specific way with respect to a given divisor $d$. The number we output must be divisible by $d$, and at the same time the sum of its decimal digits must also be divisible by $d$.
CF 104772A - Axis-Aligned Area
We are given a collection of points on a 2D plane. Each point represents a location with integer coordinates. The task is to consider all these points together and determine the area of the smallest rectangle whose sides are parallel to the coordinate axes and that contains…