2025 ICPC Asia Taiwan Online Programming Contest

12 problems from 2025 ICPC Asia Taiwan Online Programming Contest (contest 106084), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2025 ICPC Asia Taiwan Online Programming Contest

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 11m 17s

#	Problem	Time	✓
A	Take It or Double It	44s	✓
B	Twin Guardians	43s	✓
C	One-Way Abyss	1m 14s	✓
D	Palindromic Distance	1m 6s	✓
E	Explosive Slabstones Rearrangement	55s	✓
F	Fruitful Compression	55s	✓
G	Gamer Bafuko	50s	✓
H	Chopsticks	1m 28s	✓
I	Reactor	59s	✓
J	Gas Station	1m	✓
K	Move Stone	42s	✓
L	Stapler	41s	✓

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084C - One-Way Abyss

Each test case describes a vertical cave system with several shafts. You start at the top of one chosen shaft and move strictly downward. While descending, you may encounter horizontal tunnels placed at distinct depths.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084J - Gas Station

The input describes a weighted tree. Each node represents an interchange and each edge represents a road with a travel distance. The graph is connected and there is exactly one simple path between any two nodes, so every trip between interchanges is uniquely determined.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084L - Stapler

We are given a rectangular screen aligned with the coordinate axes. Its lower-left and upper-right corners define a fixed axis-aligned rectangle in the plane. Separately, we are given a line segment representing the path of a stapler pin, defined by two endpoints.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084G - Gamer Bafuko

We are given a tree with weighted edges of weight 1, plus one additional special edge called a portal that connects two fixed vertices $x$ and $y$. The portal can be used any number of times, and every use has cost 0.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084A - Take It or Double It

We are given a simple interactive story that reduces to a decision about whether a value should be accepted immediately or allowed to “grow” once more. A starting amount of money $x$ is offered to the first person.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084K - Move Stone

We are given an $n times n$ board where each cell contains some number of stones, and the total number of stones over the whole grid is exactly $n^2$. The target configuration is very rigid: after all operations, every cell must contain exactly one stone.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084E - Explosive Slabstones Rearrangement

We are given a rectangular grid and a set of k distinct occupied cells, each containing a labeled slabstone. A rectangular forbidden zone is also given. If any slabstone ends up inside this rectangle at the moment the device is placed, the entire configuration becomes invalid.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084H - Chopsticks

We start with a collection of chopsticks grouped by type. Each type contributes a known number of identical items. From the full pool, we randomly select exactly 2n chopsticks without replacement.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084D - Palindromic Distance

We are given a string for each test case and we want to measure how far it is from being a palindrome, where “distance” is the standard edit distance with insertions, deletions, and substitutions allowed.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084I - Reactor

We are managing a line of reactors, each one behaving like a small system with two internal values: a current pressure and a maximum pressure threshold. Initially every reactor has zero pressure, while each position starts with its own threshold value.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084F - Fruitful Compression

We are given a 4 by 4 Latin square over four symbols representing fruits, except that some cells are already empty. The valid full configuration is always a Latin square: every row and every column contains each of the four fruits exactly once.

Practice › Codeforces Solutions › 2025 ICPC Asia Taiwan Online Programming Contest ›

CF 106084B - Twin Guardians

We are given several independent queries. Each query contains two integers, and we need to decide whether these two numbers form a pair of twin primes.