AGM 2022 Qualification Round

12 problems from AGM 2022 Qualification Round (contest 103604), difficulty -. 3/12 solutions verified against sample I/O.

12 items

AGM 2022 Qualification Round

Special | 12 problems | 3/12 verified | Difficulty - | 8m 21s

#	Problem	Time	✓
A	CoinFlip	27s
B	Dungeon	50s	✓
C	TimeToFarm	30s
D	Rainy Garden	37s
E	Intervals	29s
F	Kube	31s
G	Parenthesis	27s
H	Magic Powers	32s
I	River	34s
J	Shelters	1m 47s	✓
K	Split	1m 1s	✓
L	Uranium	36s

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604K - Split

We are given an array that is guaranteed to start in non-increasing order, so values never go up as we move to the right. On this array we must support two kinds of operations. The first operation modifies a single interior position.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604L - Uranium

I can’t reliably write a correct Codeforces-style editorial for “103604L - Uranium” without the actual problem statement.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604I - River

I’m missing the actual problem statement for Codeforces 103604I - River, so I can’t reliably reconstruct the intended solution or write a correct editorial.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604J - Shelters

We are given a tree of houses where house 1 is a special node acting as a permanent shelter. Every house initially contains some number of people. The roads between houses are bidirectional, and initially all roads are usable. We process two types of updates.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604E - Intervals

I can’t reliably write a correct editorial for this without the actual problem statement. “Codeforces 103604E - Intervals” isn’t a standard public statement I can reconstruct from the title alone, and guessing would very likely produce a completely wrong solution and…

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604D - Rainy Garden

I can’t produce a correct Codeforces-style editorial yet because the problem statement for “103604D - Rainy Garden” is not actually included in your prompt, and it is not uniquely recoverable from the contest ID alone.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604H - Magic Powers

I don’t have the actual statement of Codeforces 103604H - Magic Powers in your prompt, so I can’t reliably reconstruct the problem, constraints, or the intended solution path.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604G - Parenthesis

I’m missing the actual problem statement for Codeforces 103604G - Parenthesis, and I can’t reliably reconstruct it from the ID alone.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604F - Kube

I can’t safely write a correct editorial yet because the actual problem statement for Codeforces 103604F - Kube is not included in your prompt, and I don’t have reliable access to it from the information available here.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604C - TimeToFarm

I can’t reliably write an editorial yet because the actual problem content for Codeforces 103604C - TimeToFarm is missing from your prompt (the statement, input/output definitions, and constraints are all blank).

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604A - CoinFlip

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 103604A - CoinFlip is missing from your prompt.

Practice › Codeforces Solutions › AGM 2022 Qualification Round ›

CF 103604B - Dungeon

We are given a multi-level dungeon. Each level is a grid of cells, and all levels are connected sequentially through special exit cells. The player starts at the top-left cell of the first level with initial power equal to 1. Each cell in the dungeon behaves like a terrain type.