The 2024 ICPC Asia Kunming Regional Contest (The 3rd Universal Cup. Stage 20: Kunming)
13 problems from The 2024 ICPC Asia Kunming Regional Contest (The 3rd Universal Cup. Stage 20: Kunming) (contest 105588), difficulty -. 13/13 solutions verified against sample I/O.
The 2024 ICPC Asia Kunming Regional Contest (The 3rd Universal Cup. Stage 20: Kunming)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 56s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Antivirus | 53s | ✓ | |||
| B | Brackets | 1m 35s | ✓ | |||
| C | Coin | 50s | ✓ | |||
| D | Dolls | 59s | ✓ | |||
| E | Extracting Weights | 1m 20s | ✓ | |||
| F | Flowers | 1m 3s | ✓ | |||
| G | GCD | 1m 1s | ✓ | |||
| H | Horizon Scanning | 56s | ✓ | |||
| I | Items | 1m 21s | ✓ | |||
| J | Just another Sorting Problem | 54s | ✓ | |||
| K | Key Recovery | 59s | ✓ | |||
| L | Last Chance: Threads of Despair | 1m 18s | ✓ | |||
| M | Matrix Construction | 47s | ✓ |
CF 105588J - Just another Sorting Problem
We are given a permutation and a two-player game played on it. The goal of the game is to transform the permutation into a fully sorted sequence in increasing order.
CF 105588B - Brackets
We are given a long bracket string s that uses eight bracket symbols, four opening types and their matching closing counterparts. From this string we extract m substrings. Each substring is treated as an independent sequence, and we are allowed to pair some of these substrings.
CF 105588I - Items
We are given several independent test cases. In each test case, there are $n$ types of items. Each type can be used any number of times, including zero, and every item of type $i$ has a fixed weight $wi$.
CF 105588E - Extracting Weights
We are given a fixed tree with $n$ nodes. Each node $i$ hides a value $wi$, with the root node $1$ guaranteed to have value $0$. The only way to obtain information is by querying pairs of nodes $(u, v)$.
CF 105588L - Last Chance: Threads of Despair
Two opposing teams are on the battlefield, each consisting of several units with integer health values. Before any combat begins, a global spell is cast that triggers a cascading “death explosion” effect: whenever a unit dies, every unit on the field loses one additional…
CF 105588M - Matrix Construction
We are asked to place the integers from 1 up to $n cdot m$ into an $n times m$ grid, using each number exactly once.
CF 105588H - Horizon Scanning
We place a radar at the origin, and every island becomes a direction from the origin, represented by its polar angle.
CF 105588G - GCD
We are given two positive integers, one small (up to 5000) and one potentially extremely large (up to 10^18). In a single move, we pick one of the numbers and subtract from it the greatest common divisor of the current pair.
CF 105588D - Dolls
We are given several test cases. In each test case there is a permutation of integers representing doll sizes placed in a row. Each position initially contains exactly one doll, and all sizes are distinct.
CF 105588C - Coin
We are simulating a repeated elimination process on a line of positions from 1 to n. In each round, the pirates are currently arranged in order, and we remove every k-th position starting from the first one.
CF 105588K - Key Recovery
We are interacting with a hidden transformation machine that always processes a block of 8 MBTI values at once. Each MBTI is encoded as a 4-bit value, so the full machine state is exactly 32 bits. The machine applies a fixed sequence of 19 operations to these 8 values.
CF 105588F - Flowers
We are asked to count how many different labeled graphs on vertices numbered from 1 to n satisfy a set of strong structural and arithmetic constraints.
CF 105588A - Antivirus
We are given a directed graph of cities where city 1 is special and reachable from every other city via directed paths. Each day, a virus starts from a chosen city and immediately spreads along outgoing roads, infecting every city reachable from that start.