AGM 2022, Final Round, Day 1

12 problems from AGM 2022, Final Round, Day 1 (contest 104009), difficulty -. 4/12 solutions verified against sample I/O.

12 items

AGM 2022, Final Round, Day 1

Special | 12 problems | 4/12 verified | Difficulty - | 8m 36s

#	Problem	Time	✓
A	Accountancy	41s	✓
B	AGaMe	37s
C	Bar hopping	30s
D	Bipartite	49s	✓
E	Coins	30s
F	Engine	32s
G	Genetics	33s
H	Lottery	25s
I	Matrix	1m 57s	✓
J	Metro	1m 5s	✓
K	Restricted Tree	32s
L	Transafagarasan	25s

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009I - Matrix

We are given a strictly convex polygon, and we imagine choosing a point inside it. For any fixed direction, we draw the maximal chord of the polygon that passes through this point and is parallel to that direction.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009L - Transafagarasan

The problem statement for Codeforces 104009L - Transafagarasan is missing from your prompt, so I don’t have the actual rules, input format, or task definition needed to write a correct editorial.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009K - Restricted Tree

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 104009K - Restricted Tree” is just a title here, but the key details are exactly what determine the solution: what “restricted” means, what operations or queries…

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009J - Metro

We are given a long row of seats indexed from 0 to N + 1, where the two boundary seats are permanently occupied. The interior seats start empty, but this configuration changes over time through events. There are two kinds of events.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009G - Genetics

I don’t have the actual statement for Codeforces 104009G - Genetics, so I can’t reliably reconstruct the problem, constraints, or intended solution path without risking inventing details.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009H - Lottery

I don’t have the statement for Codeforces 104009H - Lottery, so I can’t reliably reconstruct the problem, constraints, or solution without risking inventing details.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009F - Engine

I can’t reliably write a correct Codeforces editorial for 104009F - Engine without the actual problem statement. Right now the prompt has empty sections for the statement/input/output, which usually means the content wasn’t included or was stripped.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009D - Bipartite

We are given a sequence of edges of an undirected graph, presented in a fixed order. We are not allowed to reorder edges, but we can cut this sequence into consecutive blocks. Each block forms its own independent graph using exactly the edges inside it.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009E - Coins

I’m missing the actual problem statement for Codeforces 104009E - Coins, so I can’t reliably reconstruct the intended solution, constraints, or edge cases.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009A - Accountancy

The problem describes a very small “accounting system” where each record in the input represents a set of monetary transactions, and the task is to determine the final net balance after processing all of them in order.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009B - AGaMe

I don’t have the actual problem statement for Codeforces 104009B - AGaMe in your message, and I can’t reliably reconstruct it from the title alone without risking inventing details.

Practice › Codeforces Solutions › AGM 2022, Final Round, Day 1 ›

CF 104009C - Bar hopping

I can’t produce a correct full editorial for “Codeforces 104009C - Bar hopping” yet because the problem statement is missing from your prompt. Right now the input and output sections are empty, so there is no way to know what the algorithm is supposed to compute.