2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin)
13 problems from 2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin) (contest 104768), difficulty -. 13/13 solutions verified against sample I/O.
2023 China Collegiate Programming Contest (CCPC) Guilin Onsite (The 2nd Universal Cup. Stage 8: Guilin)
Special | 13 problems | 13/13 verified | Difficulty - | 12m 58s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Easy Diameter Problem | 54s | ✓ | |||
| B | The Game | 1m 8s | ✓ | |||
| C | Master of Both IV | 57s | ✓ | |||
| D | Subway | 1m 23s | ✓ | |||
| E | Prefix Mahjong | 1m 7s | ✓ | |||
| F | Redundant Towers | 54s | ✓ | |||
| G | Hard Brackets Problem | 51s | ✓ | |||
| H | Sweet Sugar | 1m 3s | ✓ | |||
| I | Barkley II | 1m 11s | ✓ | |||
| J | The Phantom Menace | 57s | ✓ | |||
| K | Randias Permutation Task | 44s | ✓ | |||
| L | Alea Iacta Est | 52s | ✓ | |||
| M | Flipping Cards | 57s | ✓ |
CF 104768M - Flipping Cards
We are given a row of cards, and each card has two numbers written on it. For each position, one number is initially facing up and the other is facing down. The initial configuration is fixed: the value we see on card i is $ai$, while $bi$ is hidden underneath.
CF 104768L - Alea Iacta Est
We are given two standard dice, one with faces labeled from 1 to $n$ and another from 1 to $m$. Rolling them produces a sum distribution that is fully determined by convolution: each sum $k$ can be obtained in a number of ways equal to how many pairs $(i, j)$ satisfy $i + j = k$.
CF 104768J - The Phantom Menace
We are given two collections of strings, each collection containing the same number of strings, and every string has the same fixed length. The task is to reorder the strings inside each collection independently, then concatenate each reordered collection into one long string.
CF 104768K - Randias Permutation Task
We are given several permutations of the same size, each permutation acting as a rearrangement of positions. When we compose two permutations, the result is another permutation where the i-th position of the result is obtained by applying one permutation after another.
CF 104768I - Barkley II
We are given several test cases. Each test case describes a line of students, where each student is associated with a single integer value between 1 and m. That value represents which algorithm (by difficulty rank) the student knows.
CF 104768H - Sweet Sugar
We are given a tree where each vertex carries a small number of “sugar units”, specifically 0, 1, or 2. A single cake requires exactly k units of sugar.
CF 104768G - Hard Brackets Problem
We are given a final string of parentheses that appears on the screen after some sequence of typing operations in a special editor. The editor starts empty with a cursor between two parts of the string, and at every step the user types either an opening or a closing parenthesis.
CF 104768D - Subway
We are given a set of points in the plane, each point representing a subway station. Every station comes with a requirement that it must lie on exactly a specified number of subway lines.
CF 104768E - Prefix Mahjong
We are given a sequence of integers, revealed one by one. After each new element, we must decide whether the entire prefix can be interpreted as a valid Mahjong hand under simplified rules.
CF 104768F - Redundant Towers
We are given a set of points in the plane, each point representing a communication tower. Every tower can directly communicate with another tower if the Euclidean distance between them is at most a fixed radius $R$.
CF 104768B - The Game
We are given two multisets, A of size n and B of size m. The goal is to transform A into exactly B using a very specific operation that mixes modification and deletion.
CF 104768C - Master of Both IV
We are given an array of integers, and we are asked to count how many non-empty subsequences of this array satisfy a constraint that ties together two operations on the chosen elements: bitwise XOR of all selected values, and integer divisibility.
CF 104768A - Easy Diameter Problem
We are given a tree and repeatedly delete vertices until nothing remains. The twist is that at every step we are not allowed to delete an arbitrary vertex: we must pick a vertex that can serve as an endpoint of some diameter of the current tree.