The 2025 ICPC Asia Chengdu Regional Contest (The 4rd Universal Cup. Stage 4: Grand Prix of Chengdu)
13 problems from The 2025 ICPC Asia Chengdu Regional Contest (The 4rd Universal Cup. Stage 4: Grand Prix of Chengdu) (contest 106161), difficulty -. 12/13 solutions verified against sample I/O.
The 2025 ICPC Asia Chengdu Regional Contest (The 4rd Universal Cup. Stage 4: Grand Prix of Chengdu)
ICPC/IOI | 13 problems | 12/13 verified | Difficulty - | 14m 29s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | A Lot of Paintings | 1m 6s | ✓ | |||
| B | Blood Memories | 1m 8s | ✓ | |||
| C | Crossing River | 1m 2s | ✓ | |||
| D | Deductive Snooker Scoring | 54s | ✓ | |||
| E | Escaping from Trap | 1m 29s | ✓ | |||
| F | Following Arrows | 1m 16s | ✓ | |||
| G | GCD of Subsets | 1m 28s | ✓ | |||
| H | Heuristic Knapsack | 1m 12s | ✓ | |||
| I | Inside Triangle | 1m 10s | ✓ | |||
| J | Judging Papers | 1m 18s | ✓ | |||
| K | K-Coverage | 59s | ✓ | |||
| L | Label Matching | 58s | ✓ | |||
| M | Meeting for Meals | 29s |
CF 106161K - K-Coverage
We are given a rooted tree, and every node carries two values, one from array a and one from array b. Some entries in both arrays may be zero, and zero acts as a wildcard that can match anything.
CF 106161H - Heuristic Knapsack
We are given a fixed convex polygon $P$ with $n$ vertices, and another convex polygon $Q$ that lies strictly inside it. From the vertices of $P$, we must choose exactly three distinct points to form a triangle.
CF 106161G - GCD of Subsets
We are given a collection of items. Each item has a weight and a value, but for some items exactly one of these two numbers is missing and must be assigned by us as a positive integer not exceeding one billion. Two greedy procedures will later run on the completed dataset.
CF 106161D - Deductive Snooker Scoring
We are given a target state of a simplified snooker-like scoring system. At any moment, there are two players, and one of them is currently at the table. We know the current scores of Player A and Player B, we know how many balls remain on the table, and we know whose turn it is.
CF 106161L - Label Matching
We are given a connected weighted undirected graph. Several friends start from distinct nodes and all of them want to reach a common destination node, the mall at node 1.
CF 106161A - A Lot of Paintings
We are given a small party of up to six characters who repeatedly fight over a long sequence of rounds. Each round starts with a fixed pool of energy, and each character may either use their skill once or stay idle.
CF 106161M - Meeting for Meals
I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Meeting for Meals”, but there are no details about the input, output, constraints, or rules of the problem.
CF 106161J - Judging Papers
We are given a collection of identical-length segments placed on the non-negative integer line. Each segment starts at some integer coordinate and covers exactly L consecutive integer points. So a segment starting at position l covers all points from l to l + L − 1.
CF 106161I - Inside Triangle
Each test case gives a collection of papers, and each paper is evaluated by a small group of reviewers. Every reviewer assigns an integer score between −3 and 3, and the paper’s total score is just the sum of these values.
CF 106161E - Escaping from Trap
We are designing a small maze, at most 8 by 8 cells, where each cell contains one of four directional arrows. A token starts at the top-left cell and repeatedly follows a deterministic process until it first reaches the bottom-right cell. Each step has two phases.
CF 106161F - Following Arrows
We start with the integers from 1 to n, each appearing once. In one move, we pick some non-empty subset of the current numbers and delete it, but the chosen subset must have a very specific property: the greatest common divisor of all numbers inside it must be exactly k.
CF 106161B - Blood Memories
There are two independent queues of people waiting on opposite riverbanks. Each person becomes eligible to board a boat only after their individual arrival time.
CF 106161C - Crossing River
We are looking at a partially observed snooker frame. At the moment Panda turns on the TV, the table is in some intermediate configuration: a number of balls remain on the table, and both players already have some accumulated scores.