The 15th Shandong CCPC Provincial Collegiate Programming Contest
13 problems from The 15th Shandong CCPC Provincial Collegiate Programming Contest (contest 105930), difficulty -. 13/13 solutions verified against sample I/O.
The 15th Shandong CCPC Provincial Collegiate Programming Contest
Special | 13 problems | 13/13 verified | Difficulty - | 14m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Project Management | 1m 13s | ✓ | |||
| B | Pinball | 54s | ✓ | |||
| C | Bracket Integer | 1m 24s | ✓ | |||
| D | Distributed System | 1m | ✓ | |||
| E | Greatest Common Divisor | 57s | ✓ | |||
| F | ACE String | 1m 2s | ✓ | |||
| G | Assembly Line | 49s | ✓ | |||
| H | Minimum Spanning Tree | 1m 9s | ✓ | |||
| I | Square Puzzle | 53s | ✓ | |||
| J | Useful Algorithm | 1m | ✓ | |||
| K | Path Planning 2 | 1m 36s | ✓ | |||
| L | Stella | 43s | ✓ | |||
| M | Triangulation | 1m 20s | ✓ |
CF 105930M - Triangulation
We are given a circle with $n$ equally spaced points. Think of them as vertices placed around a round table in clockwise order, but their labels are unknown.
CF 105930H - Minimum Spanning Tree
We are given a connected undirected weighted graph. On top of the existing edges, we are allowed to add up to k extra edges.
CF 105930J - Useful Algorithm
We are given a permutation of size $n$ and a target value $k$. We imagine running a binary search algorithm on this permutation, treating it as if it were a sorted array even though it may be completely arbitrary.
CF 105930A - Project Management
Each employee comes with two attributes: a rank value and a personal tolerance. The rank determines who they consider “higher” than themselves, and the tolerance specifies how many higher-ranked colleagues they are willing to tolerate in the same project team.
CF 105930F - ACE String
We are given a string and we want to find a substring that has a very rigid internal structure. Inside such a substring, we must be able to choose a length p and a starting position for a middle block so that the substring can be conceptually split into five consecutive parts.
CF 105930D - Distributed System
We are given a system with n worker nodes arranged in a circle, indexed from 0 to n-1. Each task does not go to a single node, but instead generates a contiguous sequence of sub-tasks. A task is described by two values: a and b.
CF 105930L - Stella
Each input test case gives two stellar classifications written in a fixed format: a capital letter followed by a digit. The letter represents a coarse temperature class ordered from hottest to coldest as O, B, A, F, G, K, M.
CF 105930I - Square Puzzle
We are given two configurations of a 3 by 3 grid, each cell containing a distinct digit from 1 to 9. So each grid is really a permutation of the numbers 1 through 9 arranged in row-major order.
CF 105930G - Assembly Line
We are simulating a production pipeline with k workers arranged in a line. Each worker has a private inbox. Over time, n items arrive at specified workers at specified minutes. Once an item is in a worker’s inbox, it participates in a synchronized daily routine.
CF 105930E - Greatest Common Divisor
We are given a list of positive integers, and we are allowed to perform exactly $k$ operations. Each operation picks a single position and increases that element by 1.
CF 105930C - Bracket Integer
We are given a decimal integer $A$ with no leading zeros. Think of its digits as positions in a sequence. We want to construct another integer $B le A$ such that the digit sequence of $B$ can be interpreted as a valid weighted parenthesis system.
CF 105930B - Pinball
We are simulating a point moving inside a vertical strip between two horizontal boundaries, at heights 0 and H. Inside this strip, there are point obstacles called boards. These boards are not intervals or segments, they are exact coordinates.
CF 105930K - Path Planning 2
We are given a grid where each cell contains an integer value. From the top-left corner we can only move right or down until we reach the bottom-right corner. Any such movement forms a monotone path, and every path collects the values of the cells it passes through.