The 2024 ICPC Asia Shenyang Regional Contest (The 3rd Universal Cup. Stage 19: Shenyang)
13 problems from The 2024 ICPC Asia Shenyang Regional Contest (The 3rd Universal Cup. Stage 19: Shenyang) (contest 105578), difficulty -. 13/13 solutions verified against sample I/O.
The 2024 ICPC Asia Shenyang Regional Contest (The 3rd Universal Cup. Stage 19: Shenyang)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 15m 13s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Safety First | 1m | ✓ | |||
| B | Magical Palette | 1m 21s | ✓ | |||
| C | Crisis Event: Meteorite | 1m 10s | ✓ | |||
| D | Dot Product Game | 1m 2s | ✓ | |||
| E | Light Up the Grid | 1m 25s | ✓ | |||
| F | Light Up the Hypercube | 57s | ✓ | |||
| G | Guess the Polygon | 1m 1s | ✓ | |||
| H | Guide Map | 1m 14s | ✓ | |||
| I | Growing Tree | 1m 34s | ✓ | |||
| J | Make Them Believe | 56s | ✓ | |||
| K | Fragile Pinball | 54s | ✓ | |||
| L | The Grand Contest | 1m 19s | ✓ | |||
| M | Obliviate, Then Reincarnate | 1m 20s | ✓ |
CF 105578J - Make Them Believe
We are given a fixed eight-team single-elimination bracket, already arranged in quarterfinal order from top to bottom. Each team has a unique name and a unique integer strength.
CF 105578I - Growing Tree
A perfect binary tree is being built level by level. After $n$ days, the tree has height $n$, root is node $1$, and every internal node $u$ has two children $2u$ and $2u+1$.
CF 105578M - Obliviate, Then Reincarnate
We are given an infinite line of rooms indexed by all integers. These rooms are partitioned into $n$ groups according to their value modulo $n$.
CF 105578E - Light Up the Grid
We are working with a fixed 2 by 2 binary grid, so every configuration is a 4-bit state. Each operation flips bits in a specific pattern: either one cell, an entire row, an entire column, or all four cells at once.
CF 105578B - Magical Palette
We are given a grid with $n$ rows and $m$ columns. Before filling the grid, we assign one number to each row and one number to each column. Call the row values $a1 dots an$ and the column values $b1 dots bm$.
CF 105578L - The Grand Contest
We are given a chronological log of submissions made by two teams during a programming contest. Each submission belongs to one of the two teams, targets a problem, arrives at a specific time, and is either correct or incorrect.
CF 105578H - Guide Map
We are given a complete graph on $n$ cities, but only $n-2$ of its edges are marked as scenic. Those scenic edges form a structure that is almost connected, in the sense that if we were allowed to add exactly one more edge, the scenic graph would become fully connected.
CF 105578F - Light Up the Hypercube
We are working with an n-dimensional hypercube whose 2^n vertices each hold a binary light state. A move consists of choosing one of 2^n operation types.
CF 105578D - Dot Product Game
We are given two permutations of size $n$, call them $A$ and $B$. Think of them as two aligned sequences of weights. Their interaction is measured by the dot product, where position $i$ contributes $ai cdot bi$.
CF 105578A - Safety First
We are asked to count how many different “stable ladders” can be formed using exactly n segments, where each segment has a positive integer length and the sequence of lengths is non-increasing from left to right.
CF 105578K - Fragile Pinball
We are given a small convex polygon, with at most six vertices, and a point-like ball moving in a straight line inside it. The ball travels continuously at constant speed, and its motion is only affected when we actively trigger reflections on polygon edges.
CF 105578G - Guess the Polygon
We are given a simple polygon whose vertices are all integer points inside a 1000 by 1000 grid, but the vertices are presented in a completely shuffled order, so we cannot directly recover edges or adjacency.
CF 105578C - Crisis Event: Meteorite
We are given a one-dimensional battlefield, a line of $n$ cells. Some cells initially contain characters. Over $m$ rounds, each cell receives meteorites, and these meteorites accumulate over time instead of disappearing.