UTPC Contest 10-29-21 Div. 2 (Beginner)

8 problems from UTPC Contest 10-29-21 Div. 2 (Beginner) (contest 103380), difficulty -. 1/8 solutions verified against sample I/O.

8 items

UTPC Contest 10-29-21 Div. 2 (Beginner)

Div. 2 | 8 problems | 1/8 verified | Difficulty - | 6m 28s

#	Problem	Time	✓
A	Sad Santa	35s
B	North Pole Retirement	2m 32s
C	Sled Tracks	37s
D	Lazy Santa	50s	✓
E	Grandest Wreath	29s
F	Present Drops	29s
G	Santa's New Sled	25s
H	Label Cropping	31s

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380B - North Pole Retirement

Vertices are binary strings $a{2t-1}ldots a1a0$ with exactly $t$ ones. A move consists of choosing $j in {1,ldots,2t-1}$ and swapping $a0 leftrightarrow aj$. Each move preserves the condition $sum{i=0}^{2t-1} ai = t$, hence maps $(t,t)$-combinations to $(t,t)$-combinations.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380H - Label Cropping

I don’t have the actual statement for Codeforces 103380H - Label Cropping in your prompt, so there’s no way to correctly reconstruct the problem, constraints, or intended solution path.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380G - Santa's New Sled

The problem statement is missing from your prompt, so I don’t have the actual rules, input format, or what the sled is supposed to compute. Without that, any “full editorial” would just be guesswork, and for a Codeforces writeup that would be unreliable.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380F - Present Drops

The problem statement section is empty in your prompt, so I don’t actually know what “Codeforces 103380F - Present Drops” is asking for.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380D - Lazy Santa

We are given a weighted undirected graph whose vertices represent locations in Santa’s world. One special vertex is the North Pole, labeled as node 0, and there are several other special vertices that correspond to houses.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380E - Grandest Wreath

I’m missing the actual problem statement for “103380E - Grandest Wreath”. Right now I only have the template and metadata, but no description of what the input represents or what needs to be computed.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380C - Sled Tracks

I’m missing the actual problem statement for Codeforces 103380C - Sled Tracks in your prompt. Right now there’s no description of what the input represents, what needs to be computed, or even the constraints, so I can’t safely write a correct editorial without guessing.

Practice › Codeforces Solutions › UTPC Contest 10-29-21 Div. 2 (Beginner) ›

CF 103380A - Sad Santa

I’m missing the actual problem statement for Codeforces 103380A - Sad Santa, so I can’t safely reconstruct the correct model or derive the solution without risking inventing details.