Пермская региональная олимпиада школьников по программированию 2025
11 problems from Пермская региональная олимпиада школьников по программированию 2025 (contest 106192), difficulty -. 11/11 solutions verified against sample I/O.
Пермская региональная олимпиада школьников по программированию 2025
Special | 11 problems | 11/11 verified | Difficulty - | 9m 30s
CF 106192K - Заливка
We are given a complete graph with $n$ vertices. Each vertex initially has a color, and colors are given as integers. The graph structure itself is not really something we need to manipulate explicitly because every pair of vertices is connected.
CF 106192I - Нашествие жуков
The city is modeled as an $n times n$ grid of intersections. Each intersection $(x, y)$ lies on a vertical street $x$ and a horizontal street $y$.
CF 106192A - Проверка комнат в ГЗ
The building can be thought of as a fixed catalog of rooms distributed across floors, where each floor has a known set of possible room slots and each slot corresponds to one or two actual living places.
CF 106192D - Подарок из Японии
The task is not a typical interactive or input-driven problem. Instead, the statement describes a solved Japanese crossword puzzle (a nonogram) that encodes a single hidden picture.
CF 106192G - Подарок на юбилей
We are given an array of integers. We are allowed to repeatedly apply a specific local operation on any adjacent pair. The operation takes two neighboring values, computes the bitwise AND of the pair, and then XORs that value into both elements.
CF 106192J - Треугольный луч
We are working in a 3D coordinate system that is not the standard Cartesian one but a triangular lattice embedding, where points are represented by integer triples.
CF 106192H - Из пушки по комарам
We are simulating a laser beam fired from the origin that travels through a vertically stratified atmosphere. The space is divided into horizontal layers stacked by height, and each layer has its own propagation speed for the beam.
CF 106192F - Алхимическое чудо
We are given a target value $n$, and we want to represent it as a sum of chosen building blocks. Each building block has a “power”, and we have an unlimited supply of blocks whose powers are exactly the prime numbers, with the special rule that 1 is also considered prime.
CF 106192E - Путешествие по бамбуку
We are given a path graph on $n$ vertices, where every vertex $i$ is connected to $i+1$. On top of this structure, an extra hidden edge $(a, b)$ has been added, with the promise that there is at least one vertex strictly between them, meaning $a + 2 le b$.
CF 106192C - Верстовые столбы
Each city in the kingdom chooses exactly one destination city and a road is built between them. The result is a directed choice per city, but the road itself is undirected and has an integer length.
CF 106192B - Крысы Банаха - Тарского
We are given a structure that is best understood as a tree of rooms connected by corridors. Every pair of rooms is connected by exactly one simple path, so there are no cycles and between any two rooms there is a unique route.