The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple
13 problems from The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple (contest 104461), difficulty -. 0/13 solutions verified against sample I/O.
The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple
Special | 13 problems | 0/13 verified | Difficulty - | 25m 3s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Cooking Competition | 3m 48s | ||||
| B | Problem Preparation | 1m 34s | ||||
| C | What Kind of Friends Are You? | 39s | ||||
| D | Let's Chat | 1m 28s | ||||
| E | Seven Segment Display | 1m 30s | ||||
| F | Heap Partition | 1m 41s | ||||
| G | Yet Another Game of Stones | 1m 39s | ||||
| H | Binary Tree Restoring | 3m 27s | ||||
| I | Domino Tiling | 1m 33s | ||||
| J | Card Game | 2m | ||||
| K | Final Defense Line | 2m 9s | ||||
| L | Chiaki Sequence | 1m 37s | ||||
| M | Sequence to Sequence | 1m 58s |
CF 104461M - Sequence to Sequence
There isn’t enough consistent information here to actually diagnose a “logic bug,” because the “input” you’re giving is not a well-formed instance of any single Codeforces problem.
CF 104461L - Chiaki Sequence
We are given a sequence that is built step by step. At each step, we look at all differences between earlier terms, specifically all values of the form $aj - ai$ where $i < j$, and collect them into a set $Sn$.
CF 104461K - Final Defense Line
We are given three fixed points in the plane. Each point does not directly constrain the circle itself, but instead tells us how far that point is from the boundary of an unknown circle.
CF 104461H - Binary Tree Restoring
Your solver is written for a strict numeric FFT convolution task, but the provided sample: does not match any valid format of that problem. There are no strings, no clear separators, no structure that matches the expected grammar of S, T, M or anything similar.
CF 104461J - Card Game
We are maintaining a dynamic collection of linear functions, each card contributing a function of the form $f(x) = r cdot x + b$. In each round, Alice first chooses a real integer $x$ inside a given interval $[L, R]$.
CF 104461I - Domino Tiling
We are given a rectangular grid of size $n times m$, and the task is to cover every cell using dominoes of size $2 times 1$. Each domino must occupy exactly two adjacent cells, either horizontally or vertically, and every cell of the grid must belong to exactly one domino.
CF 104461G - Yet Another Game of Stones
We are given several independent piles of stones. Players alternate turns starting with Alice, and on each turn the active player chooses a single pile and removes a positive number of stones from it. The game ends when a player cannot make any legal move.
CF 104461F - Heap Partition
We are given a sequence of values, and we are allowed to split it into several subsequences. Each subsequence must be “heapable”, meaning we should be able to place its elements into a binary tree in the order of appearance such that every node only points to later elements…
CF 104461A - Cooking Competition
You are very close in terms of idea, but the mismatch you are seeing is not a small arithmetic bug. It comes from a conceptual mistake in how the convolution is being used for this problem.
CF 104461E - Seven Segment Display
We are simulating an eight-digit hexadecimal counter displayed on a seven-segment display. Each digit from 0 to F has a fixed energy cost, and at every second the display consumes energy equal to the sum of costs of all eight digits currently shown.
CF 104461D - Let's Chat
Two users communicate over a timeline of $n$ days. We are given several disjoint or ordered intervals describing when user $A$ sends messages to $B$, and similarly when $B$ sends messages to $A$.
CF 104461B - Problem Preparation
We are given several test cases. Each test case consists of a list of integers representing difficulty scores of programming problems prepared for a contest. For each list, we must decide whether it satisfies a set of structural rules that define a valid contest set.
CF 104461C - What Kind of Friends Are You?
The prompt is missing essential information needed to produce a correct editorial and solution. The provided sample input has lost its formatting because all whitespace and line breaks have been collapsed, for example: This makes it impossible to determine where one test case…