2024 Taiwan NHSPC Mock Contest (Mirror)

9 problems from 2024 Taiwan NHSPC Mock Contest (Mirror) (contest 105570), difficulty -. 8/9 solutions verified against sample I/O.

9 items

2024 Taiwan NHSPC Mock Contest (Mirror)

Special | 9 problems | 8/9 verified | Difficulty - | 9m 54s

# Problem Rating Tags Accepted Time ✓
A Challenges in Bolivia (challenges) 43s
B Growing Cucumbers (cucumber) 1m 17s ✓
C Get Out Away (getoutaway) 1m 17s ✓
D Building Gondola (gondola) 1m 26s ✓
E Horse Racing In The Wilderness (horse) 1m 19s ✓
F Railway Renovation (rail) 46s ✓
G Soccer (soccer) 1m 5s ✓
H The Taiko Problem (taiko) 1m 2s ✓
I Huge Cannon Volleyball (volleyball) 59s ✓
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570D - Building Gondola (gondola)

We are given a left-to-right sequence of peaks, but their exact heights are not fixed. Instead, each peak has a range of possible heights derived from a noisy vertical photograph.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570G - Soccer (soccer)

We are given a polyline that represents a highway. It is defined by a sequence of points, and consecutive points are connected by straight segments, forming a broken line that always moves strictly to the right in the x-direction.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570E - Horse Racing In The Wilderness (horse)

We are given $N$ competitors. Each competitor $i$ has an unknown parameter $hi$, which represents how fast they finish. Smaller values of $hi$ always correspond to earlier finishing times, so the final ranking is exactly the ordering of all $hi$ in increasing order.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570C - Get Out Away (getoutaway)

We are given a weighted tree of up to 500,000 nodes. Two people start from the same unknown city and then take turns moving through the tree. On a turn, the active person may move to a neighboring city as long as that city has never been visited by either person before.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570H - The Taiko Problem (taiko)

We are given a rhythm chart of length $N$. Each position is either a note requiring a hit (D or K) or a rest (.). Every non-rest position must be assigned exactly one hand, either left or right, meaning we construct an assignment string $T$ where $T[i] in {L, R}$ if $S[i] neq '.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570B - Growing Cucumbers (cucumber)

We are building a sequence of integers $a1, a2, dots, an$. Each value $ai$ must stay within its personal range $[1, bi]$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570I - Huge Cannon Volleyball (volleyball)

Each team is represented by a permutation of size $N$, where position $i$ corresponds to a player with some height rank. The opponent’s lineup is partially observed: some positions are known exactly, and the rest are missing.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570F - Railway Renovation (rail)

We are given an undirected connected graph where towns are vertices and railway lines are edges. Each edge must be assigned one of two labels, Red or Blue.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Taiwan NHSPC Mock Contest (Mirror) ›

CF 105570A - Challenges in Bolivia (challenges)

I can’t reliably reconstruct the actual problem from the text you provided, and the missing parts change the meaning in a way that affects both the solution and the correctness guarantee.
codeforces competitive-programming Jun 22, 2026