The 2025 CCPC National Invitational Contest (Northeast), The 19th Northeast Collegiate Programming Contest
12 problems from The 2025 CCPC National Invitational Contest (Northeast), The 19th Northeast Collegiate Programming Contest (contest 105924), difficulty -. 12/12 solutions verified against sample I/O.
The 2025 CCPC National Invitational Contest (Northeast), The 19th Northeast Collegiate Programming Contest
Special | 12 problems | 12/12 verified | Difficulty - | 13m 20s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | GD \u7ec8\u6781\u8282\u594f\u5b9e\u9a8c\u5ba4 | 1m 20s | ✓ | |||
| B | \u4ea4\u6362 | 1m 2s | ✓ | |||
| C | \u63bc\u86cb | 1m 11s | ✓ | |||
| D | \u4fdd\u536b\u841d\u535c | 53s | ✓ | |||
| E | \u6811\u4e0a\u5220\u8fb9 | 1m 26s | ✓ | |||
| F | \u5e74\u5c11\u7684\u8a93\u7ea6\u2161 | 51s | ✓ | |||
| G | \u52a0\u8fb9 | 45s | ✓ | |||
| H | \u738b\u56fd------\u8fc1\u79fb | 1m 36s | ✓ | |||
| I | \u738b\u56fd------\u6c42\u7b56 | 52s | ✓ | |||
| J | \u738b\u56fd------\u56de\u5fc6 | 1m 27s | ✓ | |||
| K | \u5fae\u4fe1\u5c0f\u6e38\u620f | 56s | ✓ | |||
| L | \u6fa1\u5802 | 1m 1s | ✓ |
CF 105924K - 微信小游戏
We are given an $n times m$ grid where each column contains a vertical stack of colored blocks. There is also an extra “floating” block $d$, initially colorless.
CF 105924H - 王国------迁移
We are given a system with two interacting sides: cities and groups of people. There are $n$ cities, each with a cost parameter $ci$, and $n$ groups of residents, where group $i$ contains $bi$ people.
CF 105924E - 树上删边
We are given a tree where every node carries a weight, and we repeatedly remove exactly $k$ edges. The removal process is constrained: at every step, the edge we remove must still lie inside the connected component that contains node 1.
CF 105924A - GD 终极节奏实验室
We are given a sequence of integers representing rhythm intensities across a level. The task is to count how many contiguous segments of this sequence are “perfectly synchronized”, meaning that within the segment the greatest common divisor of all values is exactly equal to…
CF 105924L - 澡堂
We are simulating a bathhouse that consists of a grid with 2m rows and n columns. Each cell can hold at most one person. Rows are naturally paired: row 1 faces row 2, row 3 faces row 4, and so on.
CF 105924I - 王国------求策
We are given a graph with 2n cities split into two rows. The first row contains cities labeled from 1 to n, and the second row contains cities labeled from n+1 to 2n.
CF 105924G - 加边
We are given an undirected graph with n vertices and m edges. The graph can already contain self-loops and multiple edges between the same pair of vertices.
CF 105924C - 掼蛋
We are looking at a partially dealt hand from a two-deck card game. The full deck has 108 cards, meaning each rank-suit combination appears twice.
CF 105924D - 保卫萝卜
We are given a one-dimensional world that behaves like a lane from position 0 to a large endpoint. Enemies spawn at the left end at specific times, each with an initial health value. Once spawned, every enemy moves right by one unit every second.
CF 105924J - 王国------回忆
We are given a directed graph on $n$ labeled cities, but we do not know its edges. Instead, we are told a matrix that describes reachability: for each pair $(i, j)$, we know whether it is possible to travel from $i$ to $j$ using one or more directed roads.
CF 105924F - 年少的誓约Ⅱ
We are working with a simplified analog clock where both the hour hand and minute hand can be controlled independently. The clock uses a 12-hour cycle for hours and a 60-minute cycle for minutes.
CF 105924B - 交换
We are given a permutation of length n, and we are allowed to apply at most k local operations. Each operation targets a pair of adjacent positions.