2020-2021 ACM-ICPC, Asia Nanjing Regional Contest (XXI Open Cup, Grand Prix of Nanjing)
13 problems from 2020-2021 ACM-ICPC, Asia Nanjing Regional Contest (XXI Open Cup, Grand Prix of Nanjing) (contest 102992), difficulty -. 4/13 solutions verified against sample I/O.
2020-2021 ACM-ICPC, Asia Nanjing Regional Contest (XXI Open Cup, Grand Prix of Nanjing)
ICPC/IOI | 13 problems | 4/13 verified | Difficulty - | 11m 49s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Ah, It's Yesterday Once More | 26s | ||||
| B | Baby's First Suffix Array Problem | 2m 39s | ||||
| C | Certain Scientific Railgun | 33s | ||||
| D | Degree of Spanning Tree | 46s | ✓ | |||
| E | Evil Coordinate | 1m 13s | ✓ | |||
| F | Fireworks | 46s | ✓ | |||
| G | Go | 42s | ✓ | |||
| H | Harmonious Rectangle | 2m 31s | ||||
| I | Interested in Skiing | 23s | ||||
| J | Just Another Game of Stones | 23s | ||||
| K | K Co-prime Permutation | 24s | ||||
| L | Let's Play Curling | 41s | ||||
| M | Monster Hunter | 22s |
CF 102992H - Harmonious Rectangle
Let $T=binom{2t-1}{t}$ and write $x=N/T$. In Section 7.2.1.3, the number $kappa{tN}$ is expressed through the binary representation of $N$ by decomposing the corresponding $(s,t)$-combination into the associated compositions $qt,dots,q0$ of (11).
CF 102992M - Monster Hunter
I can’t write a correct editorial for Codeforces 102992M - Monster Hunter because the actual problem statement (input/output definition and constraints) is missing.
CF 102992L - Let's Play Curling
The problem statement is missing from your prompt, so I can’t reliably reconstruct what “Let’s Play Curling” (Codeforces 102992L) is asking.
CF 102992K - K Co-prime Permutation
I can’t reliably write a correct editorial for “Codeforces 102992K - K Co-prime Permutation” because the actual problem statement is missing from your prompt.
CF 102992J - Just Another Game of Stones
I’m missing the actual problem statement for Codeforces 102992J - Just Another Game of Stones. Right now the “Problem Statement / Input / Output” sections are empty, so there’s no way to correctly reconstruct: - what the game rules are, - what the players can do, - what…
CF 102992A - Ah, It's Yesterday Once More
I don’t have the actual statement for Codeforces 102992A (“Ah, It’s Yesterday Once More”) in your prompt, and I can’t reliably reconstruct the problem from the title alone without risking inventing details.
CF 102992B - Baby's First Suffix Array Problem
A simplicial complex on an $n$-element vertex set is an order ideal in the Boolean lattice, so if a set is in the complex then all of its subsets are also in the complex.
CF 102992D - Degree of Spanning Tree
We are given an undirected connected graph, and the task is to extract a spanning tree under a structural restriction on vertex degrees. A spanning tree here is a subset of exactly n minus 1 edges that connects all vertices without forming cycles.
CF 102992C - Certain Scientific Railgun
I don’t have the actual statement of Codeforces 102992C - Certain Scientific Railgun in the prompt, so I can’t reliably reconstruct the problem, constraints, or solution without guessing.
CF 102992I - Interested in Skiing
I can’t write a correct editorial for “Codeforces 102992I - Interested in Skiing” without the actual problem statement. The structure you requested depends heavily on the precise mechanics of the task, and guessing would produce a misleading solution.
CF 102992G - Go
The input is a square board where each position is either black, white, or empty. White stones can connect through up-down-left-right adjacency, forming clusters. A cluster survives only if at least one of its stones touches an empty cell.
CF 102992F - Fireworks
We are modeling a situation where a person repeatedly produces probabilistic “fireworks batches” over time. Each production attempt takes a fixed amount of time, and each produced firework independently has a small probability of being “perfect”.
CF 102992E - Evil Coordinate
We are building a walk on an infinite grid starting from the origin. Each move is one unit in one of the four cardinal directions: right, left, up, or down, with given available counts for each direction. The final walk must use exactly all moves.