2025-2026 ICPC, NERC, Southern and Volga Russian Regional Contest
13 problems from 2025-2026 ICPC, NERC, Southern and Volga Russian Regional Contest (contest 106144), difficulty -. 13/13 solutions verified against sample I/O.
2025-2026 ICPC, NERC, Southern and Volga Russian Regional Contest
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 31s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Delete the Array | 57s | ✓ | |||
| B | Convex Interval | 54s | ✓ | |||
| C | Monocarp, Polycarp and Brackets | 46s | ✓ | |||
| D | Gooseberry | 1m 18s | ✓ | |||
| E | Limousine Rally | 1m | ✓ | |||
| F | Jenga | 52s | ✓ | |||
| G | String Transformation | 57s | ✓ | |||
| H | Rigged Matchmaking | 1m 4s | ✓ | |||
| I | Remove Colors | 1m 3s | ✓ | |||
| J | Shift the Number | 59s | ✓ | |||
| K | Strange Array | 54s | ✓ | |||
| L | Red and Blue Edges | 54s | ✓ | |||
| M | Tactical Game | 53s | ✓ |
CF 106144G - String Transformation
We are given a string and a single allowed operation that modifies it by deleting characters. One operation works by selecting a contiguous segment of the string and also selecting a character, then removing every occurrence of that character inside that segment only.
CF 106144K - Strange Array
We are asked to construct an array of length n, where each element is a 30-bit integer. The quality of the array comes from two competing effects. On one hand, we take the bitwise OR over all elements, and multiply it by a fixed coefficient k.
CF 106144C - Monocarp, Polycarp and Brackets
We are given a string of brackets. Two players alternately remove characters from the ends of this string. On each move, a player picks either the leftmost or rightmost character of the current string and deletes it.
CF 106144H - Rigged Matchmaking
We are given two teams, each consisting of all athletes whose skill values form a contiguous integer segment. Monland has skills from $lM$ to $rM$, and Berland has skills from $lB$ to $rB$. One special athlete from Monland, the one with skill $lM$, is fixed as Monocarp.
CF 106144D - Gooseberry
We are simulating Monocarp’s eating schedule across a season of $n$ days. On some days he visits the market and buys a “batch” of gooseberries.
CF 106144L - Red and Blue Edges
We are maintaining a graph that starts empty and evolves through a sequence of edge insertions. Each inserted edge has one of two colors, red or blue, but the underlying connectivity of the graph ignores colors.
CF 106144M - Tactical Game
We are given a binary string representing a line of battlefield cells. Each cell is either empty or contains an enemy. The goal is to eliminate every enemy using two kinds of actions. A lightning strike removes exactly one chosen enemy.
CF 106144I - Remove Colors
We are given a tree where every vertex carries a color label. The task is to repeatedly delete parts of the tree until nothing remains, but deletions are constrained in a specific way. In one move, we may choose any set of colors and remove all vertices of those colors at once.
CF 106144J - Shift the Number
We are given a positive integer n whose decimal representation contains no zeros. From this number, we define a family of transformations: a “cyclic shift” where each operation moves the last digit of the number to the front.
CF 106144E - Limousine Rally
We are given a grid representing a road with obstacles, where each cell is either empty or blocked. A vertical car of fixed height k initially sits in the first column, occupying rows from 1 to k.
CF 106144F - Jenga
We are given a tower composed of horizontal layers. Each layer contains three positions, and each position may either still have a block or already be removed. The input represents these layers in a staggered textual form, but conceptually each row is just a triple of cells.
CF 106144A - Delete the Array
We are given an array that can shrink under two very specific deletion rules. The first rule allows us to remove a single occurrence of the smallest value currently present in the array, and when several positions contain that minimum value, we are free to choose which one…
CF 106144B - Convex Interval
We are given a sequence of points in the plane, and the order of these points is fixed. From this sequence we want to pick a contiguous segment, say from index l to r, and check whether the polygon formed by visiting these points in order is a strictly convex polygon when…