2025 National Invitational of CCPC (Fujian), The 12th Fujian Collegiate Programming Contest
13 problems from 2025 National Invitational of CCPC (Fujian), The 12th Fujian Collegiate Programming Contest (contest 105977), difficulty -. 13/13 solutions verified against sample I/O.
2025 National Invitational of CCPC (Fujian), The 12th Fujian Collegiate Programming Contest
Special | 13 problems | 13/13 verified | Difficulty - | 14m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | We are watching you! | 1m 4s | ✓ | |||
| B | XCPC | 1m 8s | ✓ | |||
| C | \u4e2d\u4f4d\u6570 | 1m 4s | ✓ | |||
| D | \u4e8c\u53c9\u6811 | 1m 7s | ✓ | |||
| E | \u5361\u724c\u6e38\u620f | 1m 17s | ✓ | |||
| F | \u5e15\u7d2f\u6258\u524d\u6cbf | 1m 3s | ✓ | |||
| G | \u7092\u80a1\u9ad8\u624b | 58s | ✓ | |||
| H | \u96be\u4ee5\u63a7\u5236\u7684\u6ed1\u677f\u706b\u7bad | 1m 6s | ✓ | |||
| I | \u5272\u70b9 | 1m 39s | ✓ | |||
| J | \u6784\u9020\u5927\u5e08\u5468\u4e09\u91d1 | 1m 29s | ✓ | |||
| K | VERTeX | 1m 12s | ✓ | |||
| L | \u4f17\u6570 | 55s | ✓ | |||
| M | \u81f4\u8c22 | 46s | ✓ |
CF 105977M - 致谢
The problem gives a fixed historical table describing 11 editions of a programming contest series in Fujian. Each edition has an organizing university, and each university is associated with a short English abbreviation.
CF 105977I - 割点
We are asked to construct an undirected simple connected graph on vertices labeled from 1 to n, with very specific structural constraints tied to articulation points and vertex degrees. For every vertex except 1 and n, we are given a binary indicator.
CF 105977J - 构造大师周三金
We start with a positive integer and are allowed to repeatedly modify it. One move consists of choosing a number that divides the current value, adding it to the current value, and never using the same chosen addend twice across the whole process.
CF 105977L - 众数
We are given a sequence of integers, and we process it incrementally by prefixes. For each prefix, we conceptually look at every non-empty subset of its indices.
CF 105977E - 卡牌游戏
We are given a sequence of $2n$ card values arranged in a fixed top-to-bottom order. After this, the cards are dealt strictly by position: cards in odd positions go to one player and cards in even positions go to the other player.
CF 105977H - 难以控制的滑板火箭
We are given a grid of size $n times m$ where each cell is either free or blocked. The start is always the top-left cell $(1,1)$ and the goal is the bottom-right cell $(n,m)$. Movement is not the standard four-direction grid walk.
CF 105977G - 炒股高手
The problem gives a sequence of stock prices over $n$ days, but the prices are encoded in logarithmic form. On day $i$, the actual price is $e^{ai}$, where $ai$ is a positive integer.
CF 105977B - XCPC
We start with a pile of identical base tokens, each initially considered as a “bronze level” unit worth 1 point. There are four possible grades of items: iron, copper, silver, and gold, with values 1, 2, 3, and 4 respectively.
CF 105977D - 二叉树
We are given an undirected tree. This tree is not arbitrary in origin: it is formed by taking two perfect binary trees and connecting them with exactly one extra edge. After this connection, the structure is still a tree, but it is no longer a perfect binary tree.
CF 105977A - We are watching you!
We are given several independent test cases. In each test case, there is a string S consisting of lowercase letters, and a second sequence of integers c[i] that describe values assigned to states of a deterministic automaton built from suffixes of S.
CF 105977K - VERTeX
We are given a tree with one weight attached to every node, but those node weights are hidden. Instead of node weights, every edge already tells us the sum of its endpoints: for an edge connecting u and v, we are told that this value equals the sum of the unknown positive…
CF 105977F - 帕累托前沿
We are given a sequence of points indexed from left to right. Each position $i$ has a pair of values $(xi, yi)$. For any query interval $[l, r]$, we look only at the points inside this segment and classify a point $j$ as valid if there is no other point $k$ in the same…
CF 105977C - 中位数
We are given an array of odd length, and we repeatedly compress it until only one number remains. Each compression step picks three consecutive elements in the current array, replaces those three values with their median, and shortens the array by two elements.