Infoleague Winter 2021 Training Round

8 problems from Infoleague Winter 2021 Training Round (contest 103449), difficulty -. 2/8 solutions verified against sample I/O.

8 items

Infoleague Winter 2021 Training Round

Special | 8 problems | 2/8 verified | Difficulty - | 4m 39s

#	Problem	Time	✓
A	Mountains	34s
B	Antigo	50s	✓
C	Find Set	30s
D	Updating Inversions	30s
E	Rubik String	31s
F	\u00e0PaPdnarG	28s
G	Xor Plains	27s
H	Autumn	49s	✓

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449H - Autumn

We are given a rooted tree. Each node has a notion of depth (distance from the root), and we are interested in answering queries about properties of nodes in subtrees, typically something like maximum depth, height contribution, or aggregated values over all nodes in a subtree.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449G - Xor Plains

I don’t have the actual problem statement for Codeforces 103449G - Xor Plains, so I can’t safely write a correct editorial without risking inventing details.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449F - àPaPdnarG

The problem statement for Codeforces 103449F - àPaPdnarG is missing from your prompt. Without the actual definition of the input, output, and constraints, I can’t correctly reconstruct the problem or write a valid editorial.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449E - Rubik String

The statement for Codeforces 103449E - Rubik String is missing from your prompt, so I don’t have the actual rules, input format, or what is being computed.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449D - Updating Inversions

I can’t reliably write a correct editorial for Codeforces 103449D - Updating Inversions without the actual problem statement.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449B - Antigo

We are dealing with numbers written in base 5, so every number is treated as a sequence of digits where each digit is between 0 and 4.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449A - Mountains

The problem statement is missing, so I can’t reliably derive the solution or write a correct editorial for Codeforces 103449A.

Practice › Codeforces Solutions › Infoleague Winter 2021 Training Round ›

CF 103449C - Find Set

I can’t reliably reconstruct the exact statement of Codeforces 103449C “Find Set” from the available public index alone, and there isn’t enough structured problem text exposed to safely infer the intended task without risking a wrong editorial.