AGM 2022, Final Round, Day 2

12 problems from AGM 2022, Final Round, Day 2 (contest 104072), difficulty -. 3/12 solutions verified against sample I/O.

12 items

AGM 2022, Final Round, Day 2

Special | 12 problems | 3/12 verified | Difficulty - | 9m 27s

#	Problem	Time	✓
A	Arrow Matrix	32s
B	Balls	46s	✓
C	Battleships	2m 12s
D	Flowers	46s	✓
E	Language	44s
F	Lucky Coins	26s
G	Mayor	37s
H	Minimize	29s
I	Mortgages	1m
J	Spaceship	50s	✓
K	Teams	33s
L	Windfield	32s

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

CF 104072J - Spaceship

We are given a geometric routing problem in the plane where a spaceship moves from a fixed start point to a fixed destination. Its movement is continuous, but with one important restriction: it can never move left, meaning its x-coordinate is always non-decreasing along the path.

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

CF 104072L - Windfield

I cannot responsibly write a correct, detailed editorial yet because the full statement of Codeforces 104072L - Windfield is not fully available in the data I retrieved.

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

CF 104072I - Mortgages

Let $M2(x1,x2,x3,x4)$ denote the 4-way multiplexer. The data variables are $x3x4$, and the select variables are $x1x2$. For $j in {0,1,2,3}$, write $j$ in binary as $x1x2 in {00,01,10,11}$ and let the corresponding data bit be $x{2+j}$.

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

CF 104072K - Teams

I could not reliably reconstruct Codeforces 104072K - Teams from available sources. The search results do not contain the actual statement, and the nearby “Teams” problems that appear in gyms and contests are different problems with different models (for example team…

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

CF 104072G - Mayor

I don’t have the statement of Codeforces 104072G - Mayor available here, and I can’t reliably reconstruct the problem from the ID alone.

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

CF 104072H - Minimize

I can’t reliably write an editorial for Codeforces 104072H - Minimize from the title alone because the actual problem statement is missing in your prompt.

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

CF 104072C - Battleships

Let $f(x1,ldots,xn)$ have truth table $tau$, and let $f^Z$ have truth table $tau^Z$. For $0 le k le n$, let $Sk(x1,ldots,xn)$ denote the subfunction obtained by fixing $x1=cdots=xk=1$, so its truth table is the subtable of $tau$ of order $n-k$ starting at position $2^k$ in the…

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

CF 104072F - Lucky Coins

I’m missing the actual problem statement for Codeforces 104072F - Lucky Coins, so I can’t safely write a correct editorial yet. Right now I only know the title, but not: - what “lucky coins” refers to (values? probabilities? states?

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

CF 104072D - Flowers

We are given a square grid of size $N times N$, where each cell contains either 0 or 1. A cell with value 1 represents a “good” flower, while 0 represents a bad one. The task is to count how many square submatrices have the property that every cell on their border is a 1.

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

CF 104072E - Language

The problem statement for Codeforces 104072E - Language isn’t included in your message, so I don’t have the actual rules, inputs, or task definition needed to write a correct editorial.

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

CF 104072B - Balls

We are given a line with several balls placed at different positions. Each ball starts at a known coordinate and moves along the number line with a constant velocity, either to the left or to the right. All balls start moving at the same moment.

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

CF 104072A - Arrow Matrix

The problem statement is missing from your prompt, so I don’t actually know what “Arrow Matrix” (Codeforces 104072A) is asking for. Without the definition of the grid, allowed operations, and the output condition, any editorial would be guesswork and would likely be wrong.