2024 National Invitational of CCPC (Zhengzhou), 2024 CCPC Henan Provincial Collegiate Programming Contest
13 problems from 2024 National Invitational of CCPC (Zhengzhou), 2024 CCPC Henan Provincial Collegiate Programming Contest (contest 105158), difficulty -. 13/13 solutions verified against sample I/O.
2024 National Invitational of CCPC (Zhengzhou), 2024 CCPC Henan Provincial Collegiate Programming Contest
Special | 13 problems | 13/13 verified | Difficulty - | 10m 18s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Once In My Life | 45s | ✓ | |||
| B | \u626b\u96f7 1 | 48s | ✓ | |||
| C | \u4e2d\u4e8c\u75c5\u4e5f\u8981\u6253\u6bd4\u8d5b | 1m 11s | ✓ | |||
| D | \u8ddd\u79bb\u4e4b\u6bd4 | 53s | ✓ | |||
| E | \u4fdd\u536b\u57ce\u90a6 | 46s | ✓ | |||
| F | \u4f18\u79c0\u5b57\u7b26\u4e32 | 44s | ✓ | |||
| G | \u626b\u96f7 2 | 51s | ✓ | |||
| H | \u968f\u673a\u6808 | 44s | ✓ | |||
| I | 378QAQ \u548c\u5b57\u7b26\u4e32 | 48s | ✓ | |||
| J | \u6392\u5217\u4e0e\u5408\u6570 | 33s | ✓ | |||
| K | \u6811\u4e0a\u95ee\u9898 | 45s | ✓ | |||
| L | Toxel \u4e0e PCPC II | 43s | ✓ | |||
| M | \u6709\u6548\u7b97\u6cd5 | 47s | ✓ |
CF 105158K - 树上问题
We are given a tree with weighted nodes. The tree is undirected and can be rooted at any node we choose. Once a root is fixed, every other node has exactly one parent defined by the rooted tree structure.
CF 105158G - 扫雷 2
We are asked to construct an $n times n$ binary grid, where each cell is either a mine or an empty cell. The grid must contain exactly $m$ mines.
CF 105158D - 距离之比
We are given a set of points in the plane, and for every pair of points we can measure two different distances: the Manhattan distance, which adds absolute horizontal and vertical displacement, and the Euclidean distance, which is the straight-line distance.
CF 105158M - 有效算法
We are given multiple independent test cases. In each test case, there are two integer arrays of the same length. For every index, we are allowed to “adjust” the value at that position, but the adjustment is not arbitrary.
CF 105158L - Toxel 与 PCPC II
We are given a program consisting of $n$ lines, and a subset of $m$ of these lines contain bugs. The positions of all buggy lines are known in advance and are strictly increasing. Toxel repeatedly performs a debugging operation. In one operation, he chooses a prefix length $i$.
CF 105158I - 378QAQ 和字符串
We are given a string consisting of lowercase letters, and we are allowed to change at most $k$ characters. The goal is to determine whether we can turn the string into a very rigid periodic structure.
CF 105158J - 排列与合数
We are given a five-digit integer where all digits are different. From these five digits we are allowed to rearrange their order arbitrarily, but the resulting number must still be a valid five-digit integer, meaning it cannot start with zero.
CF 105158H - 随机栈
We are given a process that builds a multiset dynamically. There are exactly n insert operations and n removal operations, interleaved in a fixed order. Each insertion adds a known value, while each removal deletes a uniformly random element from the current multiset.
CF 105158F - 优秀字符串
We are given a collection of strings and we need to count how many of them satisfy a very specific structural pattern.
CF 105158E - 保卫城邦
We are given a tree with $n$ vertices representing cities connected by $n-1$ roads. After each query, one existing road is removed and a new road is added, and the structure remains a tree. In each resulting tree, we must place troops on vertices.
CF 105158C - 中二病也要打比赛
We are given an array of length $n$, where each element is an integer in the range $[1, n]$. We are allowed to apply a transformation defined by a function $f$, which maps every value in $[1, n]$ to another value in the same range.
CF 105158B - 扫雷 1
We are given a sequence of $n$ game rounds. At the start of each round, exactly one coin is added to T0xel’s wallet, and coins are never lost except when they are spent.
CF 105158A - Once In My Life
We are given a positive integer n and a digit d. We are allowed to choose another positive integer k, and we look at the product x = n · k. The goal is to make this resulting number satisfy a very specific digit pattern constraint.