The 2025 ICPC Asia Shenyang Regional Contest (The 4th Universal Cup. Stage 6: Grand Prix of Shenyang)
13 problems from The 2025 ICPC Asia Shenyang Regional Contest (The 4th Universal Cup. Stage 6: Grand Prix of Shenyang) (contest 106252), difficulty -. 13/13 solutions verified against sample I/O.
The 2025 ICPC Asia Shenyang Regional Contest (The 4th Universal Cup. Stage 6: Grand Prix of Shenyang)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 15m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Square Kingdom | 48s | ✓ | |||
| B | Buggy Painting Software I | 1m 8s | ✓ | |||
| C | Buggy Painting Software II | 1m 23s | ✓ | |||
| D | LED Display Renovation | 1m 2s | ✓ | |||
| E | Play It by Ear | 1m 9s | ✓ | |||
| F | The Bond Beyond Time | 1m 11s | ✓ | |||
| G | Collision Damage | 1m 19s | ✓ | |||
| H | Cute Young Diagram Counting | 1m 13s | ✓ | |||
| I | Volunteer Simulator | 52s | ✓ | |||
| J | The Echoes of Chronos | 1m 33s | ✓ | |||
| K | Relay Jump | 1m 15s | ✓ | |||
| L | Leo | 1m 18s | ✓ | |||
| M | The End? | 49s | ✓ |
CF 106252B - Buggy Painting Software I
We are given a target image on an $n times m$ grid. Each cell contains either a color label or zero, where zero means transparent.
CF 106252M - The End?
We are given 8 teams, and we must arrange them into a fixed single-elimination bracket with 8 seed positions. The bracket structure is completely predetermined: seeds 1 vs 2, 3 vs 4, 5 vs 6, 7 vs 8 in the first round, then winners of (1-2) play winners of (3-4), and winners of…
CF 106252L - Leo
We are asked to build a fixed logic circuit over $n$ input nodes. Each input node carries one of four symbols: three colored signals $R, G, B$, and a special transparent signal $$ that behaves like an “empty” value.
CF 106252G - Collision Damage
We are given two convex polygons in the plane. Think of them as two rigid “collision shapes”. One polygon, call it P, stays fixed. The other polygon, Q, is translated by a vector t in the plane, without rotation or reflection.
CF 106252J - The Echoes of Chronos
We are given an array of length $n$, where each position stores a value on a circular scale from $0$ to $m-1$. Think of each value as a position on a ring, so moving forward or backward wraps around modulo $m$. A single operation does not affect a single index.
CF 106252H - Cute Young Diagram Counting
We are given a non-increasing sequence that defines a Young diagram by row lengths. After each prefix of this sequence, we consider the corresponding diagram and are asked how many distinct Young diagrams can be obtained by repeatedly applying a local transformation.
CF 106252E - Play It by Ear
We are given a deck containing a permutation of $2n$ distinct cards. Initially, the top $n$ cards form your hand and the remaining $n$ cards stay in a hidden stack.
CF 106252D - LED Display Renovation
We are given an LED display that can show an integer using up to $n$ digit positions, where each digit is drawn using a fixed 7-segment layout.
CF 106252I - Volunteer Simulator
We process a chronological stream of accepted submissions in a programming contest. Each submission belongs to a team and a problem, and all submissions are already successful ones, so every line represents a correct solution attempt.
CF 106252C - Buggy Painting Software II
We are given a two-phase system where we first construct a set of “color images”, and later must decode them after a lossy transformation. Each image consists of a sequence of length $3m$.
CF 106252K - Relay Jump
We are given a system of frogs placed on integer points in the plane. One frog is activated first, and then activation propagates along a sequence.
CF 106252F - The Bond Beyond Time
We are given an undirected connected graph where two tokens start at distinct vertices. Before the process begins, we must assign a direction to every edge, turning the graph into a directed one. After orientation, both players move simultaneously in rounds.
CF 106252A - Square Kingdom
We are given a kingdom where each resident sits at a unique height. The height of resident $i$ is defined by a simple arithmetic expression that depends on $i$, $a$, and $b$.