2024 ICPC Asia Chengdu Regional Contest (The 3rd Universal Cup. Stage 15: Chengdu)
13 problems from 2024 ICPC Asia Chengdu Regional Contest (The 3rd Universal Cup. Stage 15: Chengdu) (contest 105486), difficulty -. 13/13 solutions verified against sample I/O.
2024 ICPC Asia Chengdu Regional Contest (The 3rd Universal Cup. Stage 15: Chengdu)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 13m 52s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Arrow a Row | 1m 27s | ✓ | |||
| B | Athlete Welcome Ceremony | 56s | ✓ | |||
| C | Chinese Chess | 1m 16s | ✓ | |||
| D | Closest Derangement | 1m 2s | ✓ | |||
| E | Disrupting Communications | 1m 9s | ✓ | |||
| F | Double 11 | 1m 19s | ✓ | |||
| G | Expanding Array | 1m 10s | ✓ | |||
| H | Friendship is Magic | 55s | ✓ | |||
| I | Good Partitions | 58s | ✓ | |||
| J | Grand Prix of Ballance | 51s | ✓ | |||
| K | Magical Set | 53s | ✓ | |||
| L | Recover Statistics | 49s | ✓ | |||
| M | Two Convex Holes | 1m 7s | ✓ |
CF 105486G - Expanding Array
We start with a list of integers, and we are allowed to repeatedly expand it by taking any neighboring pair and inserting a value derived from them using bitwise operations: AND, OR, or XOR.
CF 105486L - Recover Statistics
We are given three target order statistics extracted from an unknown multiset of integers: a value that is supposed to act as the median position at 50 percent, another that corresponds to the 95 percent cutoff, and a final one for the 99 percent cutoff.
CF 105486K - Magical Set
We are given a collection of distinct integers. You can repeatedly perform an operation where you pick a number larger than 1 from the current collection, remove it, and replace it with one of its proper divisors.
CF 105486J - Grand Prix of Ballance
The system is simulating a live competition that produces a stream of server logs while a contest is running. There are several levels, and at any moment only one level is “active”, determined by the most recent log of type 1.
CF 105486I - Good Partitions
We are given a sequence and we want to understand, for each possible block size $k$, whether a very specific partitioning of the array behaves nicely. The array is cut into consecutive segments of length $k$, except possibly the last segment which may be shorter.
CF 105486H - Friendship is Magic
We are given a large integer written in decimal form. For each such number, we consider all ways to cut its decimal representation into two non-empty parts. Each cut produces two strings, which we interpret again as integers by reading them in base 10.
CF 105486E - Disrupting Communications
We are given a tree, so every pair of nodes is connected by exactly one simple path. Alongside this structure, we consider many possible connected subgraphs, meaning we choose some set of nodes and edges from the tree such that everything stays connected.
CF 105486A - Arrow a Row
We are given a binary string consisting of two symbols, and -. We start from a blank canvas of the same length filled with , and we are allowed to perform painting operations.
CF 105486C - Chinese Chess
We are given a 10×9 chessboard and a hidden piece that belongs to one of six movement types inspired by Chinese chess. We do not know its type or its position.
CF 105486D - Closest Derangement
We are given a permutation p of size n. The task is to construct another permutation q of the same numbers such that no position keeps its original value, meaning for every index i, the value q[i] must differ from p[i].
CF 105486M - Two Convex Holes
We are tracking how a point light source moves in a horizontal plane while two fixed convex “gates” in space restrict which points on the ground can be illuminated.
CF 105486F - Double 11
We are given a list of positive values $si$, each representing the daily demand of a product type. We must partition these $n$ items into exactly $m$ non-empty groups. For each group $j$, we assign a positive real parameter $kj$. Two quantities are defined from this construction.
CF 105486B - Athlete Welcome Ceremony
We are given a line of n volunteers, each position already partially assigned one of three costume types or left unassigned. The fixed assignments are immutable, while the unassigned positions must be filled using costumes of type a, b, or c.