The 2023 ICPC Asia Hangzhou Regional Contest (The 2nd Universal Cup. Stage 22: Hangzhou)
13 problems from The 2023 ICPC Asia Hangzhou Regional Contest (The 2nd Universal Cup. Stage 22: Hangzhou) (contest 104976), difficulty -. 2/13 solutions verified against sample I/O.
The 2023 ICPC Asia Hangzhou Regional Contest (The 2nd Universal Cup. Stage 22: Hangzhou)
ICPC/IOI | 13 problems | 2/13 verified | Difficulty - | 21m 3s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Submissions | 50s | ✓ | |||
| B | Festival Decorating | 1m 25s | ||||
| C | Yet Another Shortest Path Query | 1m 25s | ✓ | |||
| D | Operator Precedence | 34s | ||||
| E | Period of a String | 1m 29s | ||||
| F | Top Cluster | 2m 27s | ||||
| G | Snake Move | 1m 31s | ||||
| H | Sugar Sweet II | 2m 4s | ||||
| I | Dreamy Putata | 1m 41s | ||||
| J | Mysterious Tree | 1m 33s | ||||
| K | Card Game | 1m 34s | ||||
| L | Master of Both V | 2m 27s | ||||
| M | V-Diagram | 2m 3s |
CF 104976L - Master of Both V
We are maintaining a dynamic collection of geometric segments in the plane. After every update, we must decide whether it is possible to draw a convex polygon such that every segment we currently have lies completely on one of the polygon’s edges.
CF 104976M - V-Diagram
We are given a sequence that already has a very specific shape: it first strictly descends until a single lowest point, and after that point it strictly ascends.
CF 104976K - Card Game
We are given a sequence of integers representing cards placed one by one into a line. As we process the sequence from left to right, we maintain another sequence that behaves like a stack with a special cancellation rule.
CF 104976I - Dreamy Putata
We are given a toroidal grid, meaning moving off one edge wraps around to the opposite side. Each cell of this grid behaves like a probabilistic state machine: from a position $(x, y)$, Putata moves left, right, up, or down with probabilities determined by four local…
CF 104976J - Mysterious Tree
We are dealing with a hidden tree on vertices labeled from 1 to n. The tree is guaranteed to be in one of only two shapes: either it forms a simple path, where every vertex has degree at most two and exactly two vertices have degree one, or it forms a star, where there exists…
CF 104976H - Sugar Sweet II
We are given a collection of children, each starting with some amount of sugar. Alongside them is a set of events, one event per child. Each event refers to two children: the event’s owner and another fixed “reference” child.
CF 104976F - Top Cluster
We are working on a weighted tree where each vertex carries a unique non-negative integer label. For each query, we are given a starting vertex and a distance limit, and we look at all vertices that lie within that distance from the start.
CF 104976G - Snake Move
We are given a grid with blocked and free cells and an initial configuration of a snake whose body occupies a simple path of length $k$. The head is the first coordinate, the tail is the last, and every consecutive pair of segments is adjacent in the grid.
CF 104976E - Period of a String
We are given a sequence of strings, and we are allowed to freely permute characters inside each individual string.
CF 104976B - Festival Decorating
We are given a set of lamps placed on a number line. Each lamp has a fixed position and a color label. For each query distance $d$, we want to find a lamp $u$ with the smallest index such that if we move exactly $d$ units to the right, there exists another lamp at that…
CF 104976D - Operator Precedence
I can’t write a correct editorial for this yet because the actual problem statement is missing from your prompt.
CF 104976C - Yet Another Shortest Path Query
We are given a large undirected weighted graph and then many independent queries. Each query asks for the cheapest way to travel between two given vertices, but with a strict restriction: the route is allowed to use at most three edges.
CF 104976A - Submissions
We are given a sequence of programming contest submissions ordered by time. Each submission records a team name, a problem identifier, a timestamp, and whether the attempt was accepted or rejected.