2017 China Collegiate Programming Contest Final (CCPC-Final 2017)
11 problems from 2017 China Collegiate Programming Contest Final (CCPC-Final 2017) (contest 104207), difficulty -. 11/11 solutions verified against sample I/O.
2017 China Collegiate Programming Contest Final (CCPC-Final 2017)
Special | 11 problems | 11/11 verified | Difficulty - | 13m 3s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Dogs and Cages | 45s | ✓ | |||
| B | Same Digit | 2m 48s | ✓ | |||
| C | Rich Game | 1m 2s | ✓ | |||
| D | Mr. Panda and Circles | 1m 7s | ✓ | |||
| E | Evil Forest | 42s | ✓ | |||
| F | Fair Lottery | 1m 25s | ✓ | |||
| G | Alice's Stamps | 54s | ✓ | |||
| H | Equidistance | 1m 14s | ✓ | |||
| I | Inkopolis | 1m 32s | ✓ | |||
| J | Subway Chasing | 50s | ✓ | |||
| K | Knightmare | 44s | ✓ |
CF 104207K - Knightmare
We are watching a knight moving on an infinite chessboard. It starts from a single square, and every time it jumps, it moves according to the usual chess knight rules.
CF 104207I - Inkopolis
We are given a connected undirected graph with exactly one cycle, meaning the number of edges equals the number of vertices. Each edge has a color.
CF 104207H - Equidistance
We are given several points in an N-dimensional Euclidean space. The key condition is that every pair of given points is exactly one unit apart, so these points already form a perfectly regular geometric structure where all mutual distances are identical.
CF 104207J - Subway Chasing
We are given a linear subway line with stations numbered from 1 to N. Between every pair of adjacent stations i and i+1 there is an unknown travel time ti, and these values are strictly positive integers bounded above by 2×10^9.
CF 104207F - Fair Lottery
We are given several groups of people. Each group has a fixed size, and if a group is chosen in a lottery outcome then all its members win together. In any single outcome, the total number of winners across all chosen groups is limited by an upper bound $M$.
CF 104207B - Same Digit
We are given a single digit $D$ and a target integer $N$. Using only copies of the digit $D$, we are allowed to build arithmetic expressions using concatenation and standard operations like addition, subtraction, multiplication, division, factorial, negation, and a few unary…
CF 104207G - Alice's Stamps
We are given a line of positions from 1 to N, where each position represents a distinct stamp type. Instead of buying stamps individually, Alice can only purchase bundles, and each bundle contributes all stamp types in a contiguous interval [L, R].
CF 104207D - Mr. Panda and Circles
We are working on a line segment that has integer positions from 0 to $M-1$. At each integer coordinate we may place at most one circle center, and we must place all $N$ circles.
CF 104207E - Evil Forest
We are asked to size production for a sequence of painting competitions. Each competition has a known number of participants, and every participant consumes exactly one sketchpad.
CF 104207C - Rich Game
Each test case describes a repeated interaction where a player tries to maximize how many badminton sets he can win, starting with no money. In each point of a match, he can choose whether to intentionally win or lose that point.
CF 104207A - Dogs and Cages
We are given a system with the same number of dogs and cages, both labeled from 0 to N − 1. Each dog independently chooses a cage uniformly at random, and each cage can hold at most one dog, which means the final configuration is a random permutation of the dogs over the cages.