The 2024 ICPC Asia EC Regionals Online Contest (II)

12 problems from The 2024 ICPC Asia EC Regionals Online Contest (II) (contest 105358), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 2024 ICPC Asia EC Regionals Online Contest (II)

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 13m 46s

#	Problem	Time	✓
A	Gambling on Choosing Regionals	1m 22s	✓
B	Mountain Booking	1m 21s	✓
C	Prefix of Suffixes	56s	✓
D	Query on Tree	1m 12s	✓
E	Escape	57s	✓
F	Tourist	48s	✓
G	Game	1m 1s	✓
H	Points Selection	1m 19s	✓
I	Strange Binary	1m 27s	✓
J	Stacking of Goods	52s	✓
K	Match	1m 12s	✓
L	502 Bad Gateway	1m 19s	✓

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358L - 502 Bad Gateway

We are simulating a system that holds a single countdown timer whose initial value is random. At time zero, the timer is set to a uniformly chosen integer between 1 and T. Time then advances in discrete seconds. Every second, the timer decreases by one.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358K - Match

We are given a complete bipartite setup with two groups of size $n$, which we can think of as left vertices indexed by $i$ and right vertices indexed by $j$. An edge between $i$ and $j$ exists only when the XOR of their values, $ai oplus bj$, is at least $k$.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358I - Strange Binary

We are given a non-negative integer and asked to express it as a sum of powers of two, but instead of standard binary digits, each bit position can take the value −1, 0, or 1. The contribution of position i is ai · 2^i, and the total sum must equal the given number.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358J - Stacking of Goods

We are given a sequence of goods, each with three attributes: a weight, an initial volume, and a compression factor. We must arrange all goods in a single stack. Once stacked, each item’s final volume is reduced depending on how much total weight is placed above it.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358G - Game

Two players start with piles of chips. In each round they either have no change in position (a draw) or exactly one of them wins the round. A win is not just a point, it can immediately end the game if the winner already has at least as many chips as the opponent.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358F - Tourist

We are tracking a single evolving value, the rating of a user. The rating starts at a fixed initial value, 1500, and then changes after each of n upcoming contests.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358E - Escape

We are given an undirected, connected graph of rooms and passages. Sneaker starts at room 1 and wants to reach room n using as few passages as possible. The graph is simple in the sense that there are no self-loops and no multiple edges between the same pair of rooms.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358A - Gambling on Choosing Regionals

Each team belongs to a university and has a fixed strength. Inside any contest, all participating teams are ranked strictly by strength, so stronger teams always appear ahead of weaker ones.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358D - Query on Tree

We are given a rooted tree where node 1 acts as the root, and each node stores an integer weight. The structure of the tree stays fixed, but the weights change over time due to updates.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358C - Prefix of Suffixes

We are building an array step by step. At each operation, a new value is appended to the end of the array. After each insertion, we must compute a running expression that depends on all suffixes ending at the current position and on a special prefix-suffix overlap value.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358H - Points Selection

We are given a set of points on a grid, each point having an integer position and a weight. For any rectangle anchored at the origin and defined by coordinates $(a, b)$, we look at all points whose $x$-coordinate is at most $a$ and whose $y$-coordinate is at most $b$.

Practice › Codeforces Solutions › The 2024 ICPC Asia EC Regionals Online Contest (II) ›

CF 105358B - Mountain Booking

We are given a tree on $n$ nodes where each edge has a weight. Over time, the tree is modified in a very controlled way: each day removes exactly one existing edge and adds exactly one new edge, and the structure always remains a tree.