2022-2023 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
14 problems from 2022-2023 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals) (contest 104012), difficulty -. 13/14 solutions verified against sample I/O.
2022-2023 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
ICPC/IOI | 14 problems | 13/14 verified | Difficulty - | 13m 50s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Absolutely Flat | 39s | ✓ | |||
| B | Bricks in the Wall | 53s | ✓ | |||
| C | Computer Network | 50s | ✓ | |||
| D | Dice Grid | 47s | ✓ | |||
| E | Easily Distinguishable Triangles | 55s | ✓ | |||
| F | Focusing on Costs | 1m 17s | ✓ | |||
| G | Greatest Common Divisor | 53s | ✓ | |||
| H | Hidden Digits | 46s | ✓ | |||
| I | IQ Game | 54s | ✓ | |||
| J | Joking? | 1m 12s | ✓ | |||
| K | K-Shaped Figures | 2m 6s | ||||
| L | Limited Swaps | 48s | ✓ | |||
| M | Mex and Cards | 1m 8s | ✓ | |||
| N | New Time | 42s | ✓ |
CF 104012K - K-Shaped Figures
Exercise 225 constructs a ZDD whose paths encode all simple paths between two fixed vertices $s$ and $t$. The construction proceeds by a controlled search over partial edge sets: each ZDD node represents a state of the partial path, and each decision corresponds to including…
CF 104012N - New Time
We are given two moments in a day written on a 24-hour digital clock. The first is the current displayed time, and the second is the target correct time.
CF 104012M - Mex and Cards
We are given a multiset of cards where each card has a value between 0 and n − 1. At any moment, we know how many copies exist of each value. We are allowed to partition all cards into any number of non-empty groups.
CF 104012L - Limited Swaps
We are given a permutation of numbers from 1 to n, initially arranged on a line of cubes. We are also given a target permutation of the same numbers.
CF 104012J - Joking?
We are asked to construct a set of dice for up to five players. Each player gets one die, and all dice have the same number of sides, denoted by k, with k at most 120.
CF 104012I - IQ Game
We have a circular arrangement of $n$ sectors, each sector initially holding at most one envelope. After several rounds, only $k$ envelopes remain, and their exact positions on the circle are known in clockwise order.
CF 104012G - Greatest Common Divisor
We are given an upper bound $n$, and we consider all ordered pairs $(x, y)$ where both values lie between 1 and $n$. For each such pair, we run a modified version of the Euclidean algorithm.
CF 104012H - Hidden Digits
We are given a sequence of digits of length $n$. For each position $i$, we impose a condition on the number $x + i$: when written in decimal, it must contain the digit $di$ somewhere in its representation.
CF 104012F - Focusing on Costs
We start with a calculator that only stores a single real number and repeatedly applies one of six unary functions to it: sine, cosine, tangent and their inverses. The initial value is fixed at zero.
CF 104012E - Easily Distinguishable Triangles
We are given an $n times n$ grid where each cell is either already painted black, already white, or empty. Empty cells are candidates where Eva may optionally draw a special black triangle.
CF 104012D - Dice Grid
We are given an $n times n$ grid where each cell has a fixed color value. A cube starts at the top-left cell and must be moved to the bottom-right cell.
CF 104012B - Bricks in the Wall
We are given a rectangular grid representing a wall, where each cell is either blocked or free. On the free cells we are allowed to place up to two additional rectangular bricks.
CF 104012C - Computer Network
We are given a set of computers, each equipped with a single outgoing wire. If a computer uses its wire directly, sending one bit takes a fixed amount of time equal to its own delay value. In addition to these wires, there is a hub with a limited number of ports.
CF 104012A - Absolutely Flat
We are given four numbers representing the current lengths of the legs of a table. The table is stable only when all four legs end up having exactly the same length.