The 2024 ICPC Asia Yokohama Regional Contest

12 problems from The 2024 ICPC Asia Yokohama Regional Contest (contest 105633), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 2024 ICPC Asia Yokohama Regional Contest

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 12m 14s

#	Problem	Time	✓
A	Ribbon on the Christmas Present	55s	✓
B	The Sparsest Number in Between	57s	✓
C	Omnes Viae Yokohamam Ducunt?	54s	✓
D	Tree Generators	58s	✓
E	E-Circuit Is Now on Sale!	54s	✓
F	The Farthest Point	1m 8s	✓
G	Beyond the Former Explorer	1m 19s	✓
H	Remodeling the Dungeon 2	1m 22s	✓
I	Greatest of the Greatest Common Divisors	46s	✓
J	Mixing Solutions	1m 11s	✓
K	Scheduling Two Meetings	55s	✓
L	Peculiar Protocol	55s	✓

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633D - Tree Generators

We are given two expressions that describe how a labeled tree is constructed. Each expression is a binary structure written using a single leaf symbol 1 and a binary concatenation written as parentheses containing two subexpressions written side by side.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633H - Remodeling the Dungeon 2

The dungeon is given as a grid where only certain cells are actual rooms. Between neighboring rooms there may be doors embedded in the walls, and these doors define an undirected graph: each room is a node, and each door connects two adjacent rooms.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633K - Scheduling Two Meetings

We are given a set of candidate time slots for scheduling two separate meetings. For each time slot, every judge either attends on-site or only joins remotely.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633G - Beyond the Former Explorer

We are placed at the center of a square grid and there is a single hidden target cell somewhere in this grid. A previous explorer started from the same center cell and walked through the grid without ever revisiting a cell.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633B - The Sparsest Number in Between

We are given a closed interval of integers from a to b, where both endpoints can be as large as $10^{18}$. Among all numbers in this interval, we need to choose one whose binary representation contains the smallest number of set bits, meaning the fewest 1s.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633L - Peculiar Protocol

We are given a sequence of banknotes in a fixed order. Each banknote has a value, and we repeatedly perform an operation where we choose a contiguous block of currently remaining notes whose sum fits a specific arithmetic form, remove that block entirely, and then compress the…

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633J - Mixing Solutions

We are given several containers of a solution. Each container has a fixed amount of liquid, but the amount of dissolved substance inside each unit of liquid is not known exactly.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633I - Greatest of the Greatest Common Divisors

We are given an array of positive integers and multiple queries, each query specifying a contiguous segment of that array. For each segment, we conceptually consider every pair of distinct indices inside it and compute the gcd of the two corresponding values.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633F - The Farthest Point

We are standing on a corner of a rectangular box and are only allowed to move along its surface, not through the interior. From that starting corner, we want the point on the surface that is as far as possible in terms of shortest surface distance.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633E - E-Circuit Is Now on Sale!

The grid describes a physical layout of components that behave like nodes in a computation tree. Each non-empty cell contains a unit, and every unit connects only to its orthogonally adjacent neighbors.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633A - Ribbon on the Christmas Present

We are given a linear ribbon split into $n$ consecutive sections. Each section has a target dye level, and higher numbers correspond to darker shades. The ribbon starts completely white, and we need to transform it into the target pattern using dye operations.

Practice › Codeforces Solutions › The 2024 ICPC Asia Yokohama Regional Contest ›

CF 105633C - Omnes Viae Yokohamam Ducunt?

We are given a set of cities connected by candidate undirected roads. Each city has a weight that represents its importance. Among these cities, city 1 is the capital, Yokohama.