The 2024 ICPC Asia Hangzhou Regional Contest (The 3rd Universal Cup. Stage 25: Hangzhou)
13 problems from The 2024 ICPC Asia Hangzhou Regional Contest (The 3rd Universal Cup. Stage 25: Hangzhou) (contest 105657), difficulty -. 13/13 solutions verified against sample I/O.
The 2024 ICPC Asia Hangzhou Regional Contest (The 3rd Universal Cup. Stage 25: Hangzhou)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 9s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | AUS | 51s | ✓ | |||
| B | Barkley III | 55s | ✓ | |||
| C | Catch the Star | 57s | ✓ | |||
| D | Dividing Sequence | 1m 10s | ✓ | |||
| E | Elevator II | 56s | ✓ | |||
| F | Fuzzy Ranking | 52s | ✓ | |||
| G | Gathering Mushrooms | 54s | ✓ | |||
| H | Heavy-light Decomposition | 1m 12s | ✓ | |||
| I | Identify Chord | 56s | ✓ | |||
| J | Japanese Bands | 56s | ✓ | |||
| K | Kind of Bingo | 1m | ✓ | |||
| L | Let's Go! New Adventure | 46s | ✓ | |||
| M | Make It Divisible | 44s | ✓ |
CF 105657M - Make It Divisible
We are given an array $b1, b2, dots, bn$. We are allowed to choose an integer shift $x$ between 1 and $k$, and apply it to every element, forming a new array $ai = bi + x$.
CF 105657K - Kind of Bingo
A grid is filled with numbers, and these numbers describe an order in which cells will be marked. You can think of the process as reading a permutation of all grid cells and activating them one by one. After each activation, some subset of cells becomes marked.
CF 105657L - Let's Go! New Adventure
We are given a sequence of days, where each day produces a certain amount of experience if we play a character on that day. A character can only be played on a continuous segment of days, and once we stop using that character, it is discarded.
CF 105657J - Japanese Bands
We are assigning labels to two collections of cards. One collection contains n1 character cards and the other contains n2 music cards. Every card receives an integer value between 1 and m, and repetition is allowed, so the final state of each side is a multiset rather than a set.
CF 105657H - Heavy-light Decomposition
We are given a partition of the numbers from 1 to n into k consecutive segments. Each segment is meant to represent a heavy chain in some heavy-light decomposition of a rooted tree, where inside a chain every vertex is connected to the next one, and the last vertex of the…
CF 105657I - Identify Chord
We are given a cycle graph with vertices labeled from 1 to n in circular order, so each vertex i is connected to i−1 and i+1 modulo n. On top of this cycle, exactly one extra edge is added between two vertices that are not neighbors on the cycle.
CF 105657G - Gathering Mushrooms
We are given a directed graph on n nodes where every node has exactly one outgoing edge, defined by an array a. If we stand at node i, we deterministically move to node a[i].
CF 105657D - Dividing Sequence
We are given a sequence and we must split its elements into two subsequences, called $B$ and $C$, without changing the original order inside either subsequence. Every element of the original array goes to exactly one of them.
CF 105657E - Elevator II
Each task represents a person who must be picked up from a starting floor and dropped at a higher floor using a single elevator. The elevator begins at some initial floor and can only carry one person at a time.
CF 105657F - Fuzzy Ranking
We are given several complete rankings of the same set of universities. Each ranking is a permutation, so it defines a strict order from best to worst. From these rankings, we build a derived notion of “superiority”.
CF 105657C - Catch the Star
We are given a fixed horizontal segment on the x-axis, from $x=l$ to $x=r$, but the endpoints are forbidden, so we only care about positions strictly inside this interval.
CF 105657B - Barkley III
We are given an array of pig ratings, where each value is a 63-bit integer. The core operation that defines all behavior is bitwise AND, so every rating can only lose bits over time and never gain new ones unless explicitly assigned. The system supports three types of operations.
CF 105657A - AUS
We are given three strings over the lowercase English alphabet, and we are allowed to define a mapping from characters to characters. This mapping is not required to be bijective, multiple letters can map to the same letter, but every character must map to exactly one character.