The 2023 ICPC Asia Macau Regional Contest (The 2nd Universal Cup. Stage 15: Macau)
11 problems from The 2023 ICPC Asia Macau Regional Contest (The 2nd Universal Cup. Stage 15: Macau) (contest 104891), difficulty -. 2/11 solutions verified against sample I/O.
The 2023 ICPC Asia Macau Regional Contest (The 2nd Universal Cup. Stage 15: Macau)
ICPC/IOI | 11 problems | 2/11 verified | Difficulty - | 16m 29s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | (-1,1)-Sumplete | 53s | ✓ | |||
| B | Basic Equation Solving | 1m 26s | ||||
| C | Bladestorm | 2m | ||||
| D | Graph of Maximum Degree 3 | 2m 29s | ||||
| E | Inverse Topological Sort | 1m 22s | ||||
| F | Land Trade | 1m 43s | ||||
| G | Parity Game | 51s | ✓ | |||
| H | Random Tree Parking | 1m 30s | ||||
| I | Refresher into Midas | 1m 23s | ||||
| J | Teleportation | 1m 20s | ||||
| K | Understand | 1m 32s |
CF 104891K - Understand
We are given a hidden multiset of points inside a 256 by 256 grid. There are $n$ items, each occupying some cell, and multiple items may share a cell. We do not know any coordinates initially.
CF 104891I - Refresher into Midas
We are given a setup with two interacting cooldown systems that behave like reusable actions in time. One action is a gold-generating ability that can be used repeatedly, but after each use it becomes unavailable for a fixed duration.
CF 104891J - Teleportation
We are given a system of rooms arranged in a cycle from 0 to n-1. Each room has a single integer a[i] shown on a circular dial. From room i, Bobo has two possible actions, each costing exactly one unit of time.
CF 104891H - Random Tree Parking
We are given a rooted tree on vertices labeled from 1 to n, where every node except the root has exactly one outgoing edge pointing to a smaller-indexed parent. This orientation makes every vertex have a unique path to the root. A sequence of n drivers arrives one after another.
CF 104891F - Land Trade
We are given a rectangular region in the plane, aligned with the axes. Inside this rectangle, we want to compute the area of a subset of points defined by a logical formula over linear inequalities of the form $ax + by + c ge 0$.
CF 104891G - Parity Game
We are given a system of parity constraints over positions arranged in a line. Each constraint describes the parity relationship between two prefix positions, typically expressing whether the number of “active” elements between two indices is even or odd.
CF 104891D - Graph of Maximum Degree 3
We are given a simple undirected graph where every edge is labeled either red or blue. The underlying graph is sparse in the sense that every vertex touches at most three edges in total, regardless of color. From this graph we choose a nonempty subset of vertices.
CF 104891E - Inverse Topological Sort
We are given two permutations of the same set of vertices in a directed acyclic graph. One of them is the lexicographically smallest topological ordering of some unknown DAG, and the other is the lexicographically largest topological ordering of that same DAG.
CF 104891C - Bladestorm
We are building a growing multiset of distinct integers, where after each insertion we must compute the minimum number of spells needed to completely remove all current values. Each spell acts on all current elements at once, but the two spell types behave very differently.
CF 104891B - Basic Equation Solving
We are given a small collection of constraints, each comparing two strings using either equality or strict inequality. Each string is not a number in the usual sense but a base-10 numeral where each character is either a digit or an uppercase English letter.
CF 104891A - (-1,1)-Sumplete
We are effectively dealing with a matrix where each entry contributes either $+1$ or $-1$, and we must select a subset of entries so that every row and column has a prescribed resulting sum.