2020 NHSPC (Taiwan National High School Programming Contest) Mock Contest - Day 2 (Div. 1)
8 problems from 2020 NHSPC (Taiwan National High School Programming Contest) Mock Contest - Day 2 (Div. 1) (contest 102891), difficulty -. 4/8 solutions verified against sample I/O.
2020 NHSPC (Taiwan National High School Programming Contest) Mock Contest - Day 2 (Div. 1)
Div. 1 | 8 problems | 4/8 verified | Difficulty - | 5m 7s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Apples and Oranges | 28s | ||||
| B | Sphinx | 59s | ✓ | |||
| C | Elliptic-EX | 25s | ||||
| D | Towers | 46s | ✓ | |||
| E | Entanglement | 54s | ✓ | |||
| F | Alarm Clocks | 24s | ||||
| G | Silver Fences | 24s | ||||
| H | Ant MRT | 47s | ✓ |
CF 102891C - Elliptic-EX
I don’t have the actual statement of Codeforces 102891C - Elliptic-EX, and writing a correct editorial without it would force guessing the problem structure, which would make the explanation unreliable.
CF 102891G - Silver Fences
I don’t have the actual problem statement for Codeforces 102891G - Silver Fences in your message, and without it I can’t safely reconstruct the solution or write a correct editorial.
CF 102891E - Entanglement
We are given a tree-like structure of states, rooted at node 1, where each new state attaches to an earlier state and the connection carries a lowercase letter. Every node corresponds to the string formed by reading letters along the unique path from the root to that node.
CF 102891F - Alarm Clocks
I can’t write a correct editorial for Codeforces 102891F without the actual problem statement. Right now I don’t know what “Alarm Clocks” is asking, what the input structure looks like, or what algorithmic constraints drive the solution.
CF 102891A - Apples and Oranges
I don’t have the actual statement for Codeforces 102891A - Apples and Oranges, so I can’t reliably reconstruct the problem or write a correct editorial without guessing.
CF 102891H - Ant MRT
We are given several ants placed at distinct points on a circular track of length (m). Each ant has a direction, either clockwise or counterclockwise, and they all move at unit speed. Whenever two ants meet, they instantly reverse direction.
CF 102891D - Towers
The city is represented as a line of towers, each with a positive height. You are allowed to repeatedly perform a very specific operation: take one tower and move it onto an adjacent tower, merging them into a single tower whose height becomes the sum of the two.
CF 102891B - Sphinx
We are given a line of numbered spheres placed from left to right in their natural order. Two agents repeatedly remove spheres from this line in a fixed alternating pattern until only one sphere remains.