2024 China Collegiate Programming Contest (CCPC) Female Onsite (2024年中国大学生程序设计竞赛女生专场)
13 problems from 2024 China Collegiate Programming Contest (CCPC) Female Onsite (2024年中国大学生程序设计竞赛女生专场) (contest 105487), difficulty -. 13/13 solutions verified against sample I/O.
2024 China Collegiate Programming Contest (CCPC) Female Onsite (2024年中国大学生程序设计竞赛女生专场)
Special | 13 problems | 13/13 verified | Difficulty - | 14m 47s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Box | 1m 20s | ✓ | |||
| B | Aho-Corasick Automaton | 1m 27s | ✓ | |||
| C | CCPC | 51s | ✓ | |||
| D | Excellent Splitting | 1m 13s | ✓ | |||
| E | Centroid Tree | 53s | ✓ | |||
| F | Perfect Square | 1m 19s | ✓ | |||
| G | Increasing Sequence | 57s | ✓ | |||
| H | Square Root | 1m 13s | ✓ | |||
| I | String Duplication | 1m 19s | ✓ | |||
| J | Sum of Squares of GCDs | 1m 19s | ✓ | |||
| K | Xiao Kai's Dream of Provincial Scholarship | 57s | ✓ | |||
| L | Puzzle | 52s | ✓ | |||
| M | Covering a Tree | 1m 7s | ✓ |
CF 105487A - Box
A rectangular box is placed in 3D space with its bottom face lying flat on a known horizontal plane. The height of the box is given, so the top face is just a vertical translation of the bottom face.
CF 105487M - Covering a Tree
A tree is given in parent representation, so every node except the root has a single parent and the edges are implicitly directed upward toward that root. We are asked to cover every tree edge exactly once using several directed segments.
CF 105487K - Xiao Kai's Dream of Provincial Scholarship
Each student in the class has two separate sets of attributes: one for each semester. For each semester, we care about three scores: intelligence, morality, and sports. The sum of these three defines that semester’s “comprehensive score”.
CF 105487J - Sum of Squares of GCDs
We are given two permutations of the integers from 1 to n, but they are stored as arrays indexed by positions. Each query selects a contiguous segment of indices in the first permutation and another contiguous segment in the second permutation.
CF 105487I - String Duplication
We are given a base string s and we construct a much longer string T by concatenating m copies of s back to back. So T = s + s + ... + s. The task is to compute how many distinct substrings appear anywhere inside T.
CF 105487H - Square Root
We are given a binary string, and we interpret it as a sequence where only the 1 characters matter. Every maximal contiguous block of 1s forms a segment, while 0s act as separators that break the string into independent segments.
CF 105487G - Increasing Sequence
We are given an array of non-negative integers. We are allowed to choose a single integer x in the range from 0 to k, and we apply XOR with x to every element of the array. After this transformation, we require the resulting array to be non-decreasing.
CF 105487E - Centroid Tree
We are given a rooted tree on $n$ labeled nodes where every node except the root has exactly one parent, and parents always have smaller indices than children.
CF 105487B - Aho-Corasick Automaton
We are asked to count how many different Aho-Corasick automata could have produced a certain final shape, under very limited structural information. An Aho-Corasick automaton in this setting is built from two intertwined objects.
CF 105487D - Excellent Splitting
We are given a permutation, and we are allowed to split its elements into two subsequences while preserving original order inside each subsequence. One subsequence is called A, the other is B.
CF 105487L - Puzzle
We are given four kinds of puzzle pieces, labeled A, B, C, and D, with limited quantities of each. Each piece has special edge geometry, and pieces can only be placed next to each other if their touching edges are compatible in a complementary way, meaning one side must “fit…
CF 105487F - Perfect Square
We are given a sequence of positive integers. For each number $ai$, we must choose a divisor $di$. After making all choices, we look at the product $D = prod di$. Among all possible choices, we only care about those where this product is a perfect square.
CF 105487C - CCPC
We are given a single long string consisting only of uppercase letters. We are allowed to rearrange its characters arbitrarily. After rearranging, we look at how many times the pattern “CCPC” appears as a contiguous substring in the resulting string.