The 2025 Asia Yokohama Regional Contest

12 problems from The 2025 Asia Yokohama Regional Contest (contest 106268), difficulty -. 9/12 solutions verified against sample I/O.

12 items

The 2025 Asia Yokohama Regional Contest

Special | 12 problems | 9/12 verified | Difficulty - | 14m 26s

#	Problem	Time	✓
A	Tatami Renovation	50s	✓
B	Minimizing Wildlife Damage	55s	✓
C	Seagull Population	1m 2s	✓
D	Decompose and Concatenate	47s	✓
E	Cutting Tofu	35s	✓
F	Astral Geometry	1m 3s	✓
G	Charity Raffle	1m 13s	✓
H	U-Shaped Panels	29s
I	Game of Names	54s	✓
J	ICPC Board	27s
K	Membership Structure of a Secret Society	53s	✓
L	Common Tangent Lines	5m 18s

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268B - Minimizing Wildlife Damage

We are given a line of farmland split into $n$ consecutive plots. Each plot initially contains some amount of wheat.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268G - Charity Raffle

We are given a process that ultimately produces a vector of counts over $n$ prize types after exactly $k$ rounds. In each round, two distinct types are selected.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268I - Game of Names

We are given a one-dimensional board, represented as a string. Each position can either already contain Alice’s mark, Bob’s mark, or be empty. The game is turn-based starting with Alice.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268L - Common Tangent Lines

Thinking

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268D - Decompose and Concatenate

We are given a single large integer $N$, up to $10^{17}$. We are allowed to split it into two positive integers $a$ and $b$ such that $a + b = N$.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268K - Membership Structure of a Secret Society

We are given a set of statements that describe relationships between people in a secret society. Each person has a hidden “recommender set”, meaning the set of members who directly recommended them when they joined.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268J - ICPC Board

We are given a grid where each cell originally contained one of three letters: C, I, or P. Over time, some cells remain readable, while others are replaced by a wildcard character.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268F - Astral Geometry

We are given a set of points in three-dimensional space, but their actual coordinates are hidden. What we do know is that each point lies on an integer lattice and we are additionally given its squared distance to the origin.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268H - U-Shaped Panels

We are given a rectangular grid representing a pond, where each cell is either required to be covered or must remain empty. The target configuration is described by a pattern of and . characters: every cell must be covered exactly once by a set of identical rigid panels, while .

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268E - Cutting Tofu

We are given a rectangular block of tofu with integer side lengths $a$, $b$, and $c$. We are allowed to cut it only by slicing completely through the block along planes parallel to its faces, so every cut splits all pieces it intersects.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268C - Seagull Population

We are given a cyclic year with n days and a sequence b[i] describing how many seagulls are observed at noon on each day.

Practice › Codeforces Solutions › The 2025 Asia Yokohama Regional Contest ›

CF 106268A - Tatami Renovation

We are given a corridor shaped like a grid with two rows and a very large number of columns. Some cells already contain fixed tiles. Every empty cell must be covered using domino-shaped tatami mats, each covering exactly two adjacent cells either horizontally or vertically.