The 2020 ICPC Asia Shenyang Regional Programming Contest

13 problems from The 2020 ICPC Asia Shenyang Regional Programming Contest (contest 103202), difficulty -. 1/13 solutions verified against sample I/O.

13 items

The 2020 ICPC Asia Shenyang Regional Programming Contest

ICPC/IOI | 13 problems | 1/13 verified | Difficulty - | 13m 46s

#	Problem	Time	✓
A	The Grand Tournament	35s
B	Whispers of the Old Gods	29s
C	Mean Streets of Gadgetzan	1m
D	Journey to Un'Goro	30s
E	Knights of the Frozen Throne	30s
F	Kobolds and Catacombs	31s
G	The Witchwood	2m 32s
H	The Boomsday Project	34s
I	Rise of Shadows	27s
J	Descent of Dragons	56s	✓
K	Scholomance Academy	2m 23s
L	Forged in the Barrens	2m 25s
M	United in Stormwind	54s

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202K - Scholomance Academy

Let $G$ be the multigraph whose vertices are ${0,1,2,3,4,5,6}$ and whose edges are the $28$ dominoes of the double-six set, namely one edge between $i$ and $j$ for each $0 le i le j le 6$, including one loop at each vertex.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202I - Rise of Shadows

I can’t write a correct editorial for “Codeforces 103202I - Rise of Shadows” without the actual problem statement. Right now the prompt only includes metadata, but no description of the rules, inputs, or required output.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202M - United in Stormwind

Connection interrupted. Waiting for the complete answer

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202L - Forged in the Barrens

Let $G{s,t}$ denote the graph whose vertices are all subcubes of length $s+t$ having $s$ digits in ${0,1}$ and $t$ asterisks, with edges given by the transformations $ast 0 leftrightarrow 0ast$, $ast 1 leftrightarrow 1ast$, and $0 leftrightarrow 1$.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202G - The Witchwood

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202J - Descent of Dragons

We are maintaining an array of size $n$, initially all zeros, where values only ever increase. However, increments are not applied uniformly. Instead, a training operation targets a value $x$ and only increments those positions that currently equal $x$ inside a segment.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202H - The Boomsday Project

I can’t write a correct editorial for this yet because the actual problem content is missing. Right now, I only see the title, but there is no statement, no input/output description, and no constraints.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202F - Kobolds and Catacombs

I can’t produce a correct editorial for this problem yet because the actual problem statement is missing. “Codeforces 103202F - Kobolds and Catacombs” alone doesn’t contain enough information to reconstruct the task reliably.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202E - Knights of the Frozen Throne

The problem statement is missing from the prompt, so I can’t reconstruct what “Knights of the Frozen Throne” is asking for or derive a correct solution.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202C - Mean Streets of Gadgetzan

Connection interrupted. Waiting for the complete answer

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202D - Journey to Un'Goro

The problem statement is missing from your prompt, so there isn’t enough information to reconstruct the task or derive a correct solution.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202A - The Grand Tournament

I can’t responsibly write a full Codeforces editorial yet because the actual problem statement for Codeforces 103202A - The Grand Tournament is missing from your prompt, and it’s not included in what you provided.

Practice › Codeforces Solutions › The 2020 ICPC Asia Shenyang Regional Programming Contest ›

CF 103202B - Whispers of the Old Gods

I can’t produce a correct editorial for this problem because the actual problem statement is missing. Right now I don’t know what the input represents, what transformation or query is required, or what constraints define the intended solution.