The 2023 ICPC Asia Shenyang Regional Contest (The 2nd Universal Cup. Stage 13: Shenyang)
13 problems from The 2023 ICPC Asia Shenyang Regional Contest (The 2nd Universal Cup. Stage 13: Shenyang) (contest 104869), difficulty -. 13/13 solutions verified against sample I/O.
The 2023 ICPC Asia Shenyang Regional Contest (The 2nd Universal Cup. Stage 13: Shenyang)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Intro: Dawn of a New Era | 1m 8s | ✓ | |||
| B | Turning Permutation | 47s | ✓ | |||
| C | Swiss Stage | 50s | ✓ | |||
| D | Dark LaTeX vs. Light LaTeX | 49s | ✓ | |||
| E | Sheep Eat Wolves | 1m 4s | ✓ | |||
| F | Ursa Minor | 51s | ✓ | |||
| G | Military Maneuver | 1m 2s | ✓ | |||
| H | Line Graph Sequence | 56s | ✓ | |||
| I | Three Rectangles | 50s | ✓ | |||
| J | Graft and Transplant | 1m 2s | ✓ | |||
| K | Maximum Rating | 58s | ✓ | |||
| L | Rook Detection | 1m 13s | ✓ | |||
| M | Outro: True Love Waits | 1m 18s | ✓ |
CF 104869M - Outro: True Love Waits
We are placed in an implicit graph whose vertices are all non-negative integers. Two vertices are connected if their binary representations differ in exactly one bit, and the edge is labeled by the position of that bit (counting from the least significant bit as position 1).
CF 104869L - Rook Detection
We are working on an interactive system over an $n times n$ grid that contains an unknown set of rooks. The key constraint is not the usual chess interaction, but a visibility condition: every square is initially “controlled”, meaning it is either occupied by a rook or lies…
CF 104869K - Maximum Rating
We are given an array of integers representing rating changes from several contest rounds. We are allowed to reorder these rounds arbitrarily. We then simulate starting from rating zero, adding values one by one.
CF 104869J - Graft and Transplant
We are given an unrooted tree with up to 50 vertices. Two players alternate turns, and in each turn they pick an edge $u-v$. The move is not a local swap of endpoints, but a structural “rewiring”: every neighbor of $u$ except $v$ gets detached from $u$ and reattached to $v$.
CF 104869H - Line Graph Sequence
We are given an undirected simple graph and asked to repeatedly apply the line graph operation. Each application transforms the current graph into a new graph where every vertex represents an edge of the previous graph, and two vertices become adjacent if the original edges…
CF 104869I - Three Rectangles
We are given a fixed axis-aligned rectangular board with dimensions $H times W$. Onto this board we must place exactly three smaller axis-aligned rectangles, each having fixed dimensions, without rotation.
CF 104869G - Military Maneuver
We are given a rectangle on the plane. A point is chosen uniformly at random inside this rectangle. That point is the center of a beacon.
CF 104869F - Ursa Minor
We are given a circular system of positions that represent continents with heights, all starting at zero. The only way to modify these heights is by repeatedly applying operations that choose a fixed segment length and then add an arbitrary real value to every position in some…
CF 104869E - Sheep Eat Wolves
We are given a river-crossing scenario with two types of animals, sheep and wolves, and a boat controlled by a farmer. Initially, all sheep and wolves are on the left bank.
CF 104869D - Dark LaTeX vs. Light LaTeX
We are given two strings, one representing a sequence from the “Dark LaTeX” system and one from “Light LaTeX”. From each string we are allowed to pick a contiguous substring. That gives us a pair of substrings, one from the first string and one from the second.
CF 104869A - Intro: Dawn of a New Era
We are given several “scenes”. Each scene is described by a set of integers representing colors. For every scene, one special value is defined: its main color, which is simply the maximum value inside its set. We must arrange all scenes in a permutation.
CF 104869C - Swiss Stage
We are tracking a team in a Swiss-system tournament where progress is determined purely by the difference between wins and losses.
CF 104869B - Turning Permutation
We are working with permutations of the numbers from 1 to n, but only those permutations that satisfy a structural constraint defined through the positions of values rather than the values themselves. For each value i, let qi denote where i appears in the permutation.