The 2024 CCPC National Invitational Contest (Changchun) , The 17th Jilin Provincial Collegiate Programming Contest
12 problems from The 2024 CCPC National Invitational Contest (Changchun) , The 17th Jilin Provincial Collegiate Programming Contest (contest 105170), difficulty -. 12/12 solutions verified against sample I/O.
The 2024 CCPC National Invitational Contest (Changchun) , The 17th Jilin Provincial Collegiate Programming Contest
Special | 12 problems | 12/12 verified | Difficulty - | 11m 14s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Eminor Array | 52s | ✓ | |||
| B | Dfs Order 0.5 | 1m 3s | ✓ | |||
| C | Fibonacci Sum | 43s | ✓ | |||
| D | Parallel Lines | 33s | ✓ | |||
| E | Connected Components | 43s | ✓ | |||
| F | Best Player | 52s | ✓ | |||
| G | Platform Game | 34s | ✓ | |||
| H | Games on the Ads 2: Painting | 50s | ✓ | |||
| I | The Easiest Problem | 2m 5s | ✓ | |||
| J | Lone Trail | 1m 14s | ✓ | |||
| K | String Divide II | 1m | ✓ | |||
| L | Recharge | 45s | ✓ |
CF 105170I - The Easiest Problem
The task gives a single fixed sentence as input: “Scan the QR code to sign in now.”. The goal is not to transform it or interpret it, but to compute a simple property of this exact text, namely how many characters in it are lowercase English letters from a to z.
CF 105170L - Recharge
We are simulating a charging system for an activated item with a fixed capacity. Each test case gives a capacity k and a collection of rooms: x small rooms and y large rooms.
CF 105170K - String Divide II
We are given a string of lowercase letters and an integer $k$. The task is to locate a contiguous block inside the string that can be split into $k$ consecutive segments, where every segment is identical in content and length.
CF 105170J - Lone Trail
We are given a tree with n nodes. Each node i starts with an initial energy value bi and also has a “growth rate” ai. After x days, if nothing changed, node i would have value bi + x·ai.
CF 105170H - Games on the Ads 2: Painting
We are given an $n times n$ grid where every row and every column has an associated brush. Each brush has a fixed color, and the row brushes and column brushes together form two independent permutations of the colors $1 ldots n$.
CF 105170F - Best Player
Each test case describes a tournament where players repeatedly face each other in pairwise duels. Every duel contributes a potentially different score to both participants, but the score is not fully fixed.
CF 105170G - Platform Game
The robot moves in a very rigid vertical and horizontal pattern inside a plane that contains several disjoint horizontal segments. Each segment acts like a one-way conveyor when the robot is on it, always pushing the robot to the right endpoint.
CF 105170E - Connected Components
We are given a set of $n$ kingdoms arranged by their indices from 1 to $n$. Each kingdom has two numeric attributes, $ai$ and $bi$. These attributes define a geometric condition under which two kingdoms become directly connected by an undirected road.
CF 105170D - Parallel Lines
We are given a set of points in the plane, and we are told that in the original hidden construction these points were partitioned into exactly $k$ distinct straight lines, and all those lines were parallel to each other.
CF 105170B - Dfs Order 0.5
We are given a rooted tree where each vertex has a value. We perform a depth-first traversal starting from the root, but the order in which we visit children of any node is completely flexible.
CF 105170A - Eminor Array
We are asked to count how many strictly increasing sequences can be formed using integers from the range $1$ to $2n-1$, with one additional structural restriction on triples of consecutive chosen elements.
CF 105170C - Fibonacci Sum
We are given a very large integer written in binary, call it n. Instead of interpreting it as a number in the usual way and looping from 1 to n, we are asked to work directly with its binary representation.