2025-2026 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
12 problems from 2025-2026 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals) (contest 106193), difficulty -. 12/12 solutions verified against sample I/O.
2025-2026 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 11m 26s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Asynchronous Processor | 54s | ✓ | |||
| B | Bounding Boxes | 48s | ✓ | |||
| C | Compact Encoding | 47s | ✓ | |||
| D | Defense Distance | 53s | ✓ | |||
| E | Eight-Connected Figures | 1m 2s | ✓ | |||
| F | Faulty Fraction | 50s | ✓ | |||
| G | Games of Chess | 1m 4s | ✓ | |||
| H | High Score | 1m 19s | ✓ | |||
| I | Infection Investigation | 57s | ✓ | |||
| J | Judging Problem | 53s | ✓ | |||
| K | Keys and Grates | 48s | ✓ | |||
| L | Lucky Number Theory | 1m 11s | ✓ |
CF 106193G - Games of Chess
We are given a connected undirected graph with n nodes, where node i represents both a friend and their home. Each node has exactly one decision to make: it selects a “club” label from 1 to n, and multiple nodes are allowed to pick the same label.
CF 106193K - Keys and Grates
We are given a one-dimensional infinite tunnel. Every important object lies on an integer coordinate: the starting position, a set of keys, a set of grates, and a final hatch. Each key opens exactly one designated grate, and once a grate is opened it becomes passable forever.
CF 106193A - Asynchronous Processor
We are simulating a very small programming language that modifies a single integer register $A$, starting from zero. Each instruction either adds a value to $A$ or overwrites $A$ completely with a value.
CF 106193I - Infection Investigation
We are given a permutation of numbers from 1 to n, which we can think of as a sequence placed along a line. For any query segment [l, r], we look only at the values inside that segment and ask for the length of the longest subsequence whose values strictly increase.
CF 106193D - Defense Distance
We are asked to construct three non-empty strings over lowercase English letters such that the pairwise distances between them match three given integers.
CF 106193L - Lucky Number Theory
We are given a process that behaves like a random accumulation counter. Each time Lucy presses the roll button, the counter increases by an independent random value uniformly drawn from the interval $(0, d)$.
CF 106193H - High Score
We are given a small-capacity multiset game where the state is just a collection of integers, each always either a power-of-two-like value starting from 2 or 4, and the only way to change values is by pairing equal numbers and merging them into a larger one.
CF 106193J - Judging Problem
We are given a chronological list of problem names, where each name consists of two words. We need to verify whether this sequence could have been produced by a specific selection rule. The rule describes how the sequence is constructed. The first problem can be any problem.
CF 106193E - Eight-Connected Figures
We are working with an infinite grid where every integer coordinate cell is independently colored either black or white with equal probability. The only operation allowed is to query a cell and receive its color.
CF 106193F - Faulty Fraction
We are given a digit string that originally came from writing two positive integers next to each other. Somewhere in between those two numbers, there was a division sign.
CF 106193B - Bounding Boxes
We are given several candidate shipping containers, each a rectangular box described by three side lengths. A souvenir box must also be a rectangular box, and it needs to be placed inside every one of the given containers.
CF 106193C - Compact Encoding
We are given a non-negative integer that fits into 32 bits, and we need to convert it into a variable-length byte encoding. Instead of always using four bytes, we represent the number using chunks of 7 bits packed into bytes.