2019 China Collegiate Programming Contest Final (CCPC-Final 2019)
12 problems from 2019 China Collegiate Programming Contest Final (CCPC-Final 2019) (contest 102431), difficulty -. 12/12 solutions verified against sample I/O.
2019 China Collegiate Programming Contest Final (CCPC-Final 2019)
Special | 12 problems | 12/12 verified | Difficulty - | 1h 9m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Kick Start | 3m 14s | ✓ | |||
| B | Infimum of Paths | 9m 12s | ✓ | |||
| C | Mr. Panda and Typewriter | 3m 11s | ✓ | |||
| D | Pulse Nova | 5m 32s | ✓ | |||
| E | Non-Maximum Suppression | 6m 59s | ✓ | |||
| F | Ferry | 6m 58s | ✓ | |||
| G | Game on the Tree | 4m 7s | ✓ | |||
| H | Mr. Panda and SAD | 4m 14s | ✓ | |||
| I | Mr. Panda and Blocks | 5m 37s | ✓ | |||
| J | Wire-compatible Protocol buffer | 14m 2s | ✓ | |||
| K | Russian Dolls on the Christmas Tree | 4m 22s | ✓ | |||
| L | Spiral Matrix | 2m 18s | ✓ |
CF 102431C - Mr. Panda and Typewriter
We need to construct a fixed array (S) from left to right. At any point, we may type one new element, copy any substring that already exists on the paper into a clipboard, or append the entire clipboard to the paper. Typing costs (X), copying costs (Y), and every paste costs (Z).
CF 102431I - Mr. Panda and Blocks
There are (n) colors. For every unordered pair of colors ((i,j)), including the self-pair ((i,i)), there is exactly one domino-shaped block whose two unit cubes have those colors. Thus the input does not describe an existing arrangement.
CF 102431F - Ferry
There are three islands, A, B, and C, and the ferry is forced to move cyclically in the order A, B, C, A, and so on. Every visitor starts at A and has a fixed destination, either B or C. A visitor also has a seasickness limit t.
CF 102431J - Wire-compatible Protocol buffer
A protobuf message is a sequence of encoded fields. The field name never appears on the wire. What identifies a field is its numeric tag, and the wire type tells the decoder how many bytes belong to that field.
CF 102431L - Spiral Matrix
We have an (n times m) rectangular grid of booths. Lee may choose any booth as the starting point and any of the four initial directions. After that, every move is either straight ahead or a single right turn followed by one step.
CF 102431G - Game on the Tree
We have a tree rooted at vertex 1, with a token initially at vertex 1. Panda moves first. On every turn after the first, the player must move the token farther than the opponent moved on the preceding turn. A player who has no legal move loses.
CF 102431B - Infimum of Paths
Each directed edge carries one decimal digit from 0 through 9. A path is interpreted as a decimal fraction from left to right, but each new digit is divided by another factor of 10. For example, a path with edge weights 3, 1, 3 has value [ frac{3+frac{1+frac{3}{10}}{10}}{10}=0.
CF 102431K - Russian Dolls on the Christmas Tree
We have a rooted tree with (n) vertices. Vertex (i) contains doll (i), and vertex (1) is the root. For every vertex (v), we look at the entire subtree rooted at (v), collect all dolls there, and try to nest as many of them as possible.
CF 102431H - Mr. Panda and SAD
We have several string pieces, and we may concatenate them in any order. The score of the resulting string is the number of times the consecutive three characters SAD appear.
CF 102431E - Non-Maximum Suppression
Each detection is a square of the same side length S. Its position is determined by the bottom-left corner (x, y), and it has a distinct confidence score. NMS processes these detections from highest score to lowest score.
CF 102431D - Pulse Nova
We need to choose the center of a circle of fixed radius (R). For every input line, we measure how much of that infinite line lies inside the circle, and add these lengths over all lines. The task is to find the maximum possible sum.
CF 102431A - Kick Start
For each test case, we have the 2019 schedule of Kick Start rounds and a date representing today. The scheduled dates can appear in any order. We need to find the scheduled date that comes strictly after today and is as early as possible.