The 2021 ICPC Asia Nanjing Regional Contest (XXII Open Cup, Grand Prix of Nanjing)
13 problems from The 2021 ICPC Asia Nanjing Regional Contest (XXII Open Cup, Grand Prix of Nanjing) (contest 103470), difficulty -. 3/13 solutions verified against sample I/O.
The 2021 ICPC Asia Nanjing Regional Contest (XXII Open Cup, Grand Prix of Nanjing)
ICPC/IOI | 13 problems | 3/13 verified | Difficulty - | 7m 28s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Oops, It's Yesterday Twice More | 23s | ||||
| B | Puzzle in Inazuma | 35s | ||||
| C | Klee in Solitary Confinement | 1m 6s | ✓ | |||
| D | Paimon Sorting | 58s | ✓ | |||
| E | Paimon Segment Tree | 29s | ||||
| F | Paimon Polygon | 27s | ||||
| G | Paimon's Tree | 47s | ✓ | |||
| H | Crystalfly | 30s | ||||
| I | Cloud Retainer's Game | 29s | ||||
| J | Xingqiu's Joke | 30s | ||||
| K | Ancient Magic Circle in Teyvat | 26s | ||||
| L | Secret of Tianqiu Valley | 26s | ||||
| M | Windblume Festival | 22s |
CF 103470M - Windblume Festival
I don’t have the actual problem statement for Codeforces 103470M - Windblume Festival, so I can’t reliably reconstruct the task or derive a correct solution.
CF 103470L - Secret of Tianqiu Valley
I can’t reliably write a correct editorial for Codeforces 103470L - Secret of Tianqiu Valley because the actual problem statement is missing from your prompt.
CF 103470J - Xingqiu's Joke
I can’t write a correct editorial for this yet because the problem statement is missing. Right now, all we have is the title “Xingqiu’s Joke”, but no description of the input, output, constraints, or rules.
CF 103470K - Ancient Magic Circle in Teyvat
The problem statement is missing from your prompt (both the description and input/output sections are empty), so I can’t reconstruct the intended solution or write a correct editorial.
CF 103470G - Paimon's Tree
We are given a tree with $n+1$ vertices and an ordering of $n$ weights. The process starts by choosing any vertex as a root and marking it black.
CF 103470H - Crystalfly
The problem statement is missing from the prompt, so there isn’t enough information to derive the solution, constraints, or even the underlying task (graph, DP, combinatorics, etc.).
CF 103470I - Cloud Retainer's Game
The problem statement is missing, so there isn’t enough information to write a correct editorial. “Cloud Retainer’s Game” could correspond to multiple unknown tasks, and without the actual rules, constraints, or input/output definition, any solution would be guesswork…
CF 103470E - Paimon Segment Tree
I can’t write a correct editorial for this yet because the actual problem content (operations, constraints, and required queries) is missing from your prompt.
CF 103470F - Paimon Polygon
The problem statement for Codeforces 103470F - Paimon Polygon is missing from your prompt, so I don’t have the actual rules, inputs, or required computation to build a correct editorial.
CF 103470D - Paimon Sorting
We are given an array of integers, and we repeatedly apply a very unusual sorting procedure. The procedure does not compare neighboring elements like bubble sort, instead it compares every pair of positions.
CF 103470A - Oops, It's Yesterday Twice More
The problem statement is missing from your prompt (both the narrative and constraints are blank), so there isn’t enough information to reconstruct the task, edge cases, or solution strategy.
CF 103470C - Klee in Solitary Confinement
We are given an integer array representing values on a line, and we are allowed to optionally pick one contiguous segment and increase every value inside that segment by a fixed constant k.