The 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)
13 problems from The 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang) (contest 104160), difficulty -. 13/13 solutions verified against sample I/O.
The 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 11m 38s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Absolute Difference | 51s | ✓ | |||
| B | Binary Substrings | 47s | ✓ | |||
| C | Clamped Sequence | 1m 8s | ✓ | |||
| D | DRX vs. T1 | 51s | ✓ | |||
| E | Graph Completing | 49s | ✓ | |||
| F | Half Mixed | 43s | ✓ | |||
| G | Meet in the Middle | 1m 2s | ✓ | |||
| H | P-P-Palindrome | 48s | ✓ | |||
| I | Quartz Collection | 50s | ✓ | |||
| J | Referee Without Red | 50s | ✓ | |||
| K | Security at Museums | 1m 4s | ✓ | |||
| L | Tavern Chess | 1m 2s | ✓ | |||
| M | Vulpecula | 53s | ✓ |
CF 104160M - Vulpecula
We are given a tree of up to $n$ vertices, where each vertex represents a star. The tree is rooted implicitly by the input construction, but conceptually it is just an undirected tree defined by $n-1$ edges. For each star, Mu chooses it as a viewing center.
CF 104160L - Tavern Chess
Two players build small combat teams, each consisting of at most seven units placed in a fixed left-to-right order. Every unit starts with a single attribute value, which simultaneously acts as its hit points and its attack power.
CF 104160K - Security at Museums
We are given a simple polygon described by its vertices in counterclockwise order. On each vertex sits an object, and we want to count how many subsets of these vertices a group of thieves could choose, under a strong geometric constraint.
CF 104160J - Referee Without Red
We are given an $n times m$ grid where each cell contains a species label. The grid represents a rigid matrix formation of dancers. The only way the configuration can change is through operations triggered by showing cards. A white card labeled $k$ affects row $k$.
CF 104160I - Quartz Collection
We are given $n$ quartz types, and each type has two prices: a first piece price and a second piece price. Every type has exactly two pieces, but the second piece only becomes available after the first one of that type has been bought.
CF 104160G - Meet in the Middle
We are given two independent weighted networks on the same set of cities. One network consists of roads and the other consists of railways.
CF 104160H - P-P-Palindrome
We are given a collection of strings. From all substrings of all these strings, we are interested only in those substrings that are palindromes. Each such palindrome can be used as a building block.
CF 104160E - Graph Completing
We start with a connected simple undirected graph. We are allowed to insert any number of missing edges, as long as we never introduce self-loops or duplicate edges. Every different subset of edges that we choose to add counts as a different construction.
CF 104160F - Half Mixed
We are asked to fill an $n times m$ binary matrix, each cell being either 0 or 1, and then consider every subrectangle formed by choosing a contiguous block of rows and a contiguous block of columns.
CF 104160D - DRX vs. T1
We are given a fixed-length sequence of 5 characters describing the outcomes of a best-of-five series between DRX and T1.
CF 104160C - Clamped Sequence
We are given a sequence of numbers and asked to apply a single global “compression” operation defined by an interval $[l, r]$, where the interval length is limited by $r - l le d$.
CF 104160A - Absolute Difference
We are given two players, Alice and Bob. Each of them does not pick from a discrete list, but from a continuous set of real numbers. Their allowed numbers are described as a union of several disjoint closed intervals.
CF 104160B - Binary Substrings
We are given a length $n$, and we must construct a binary string of that length. The goal is not to satisfy any pattern constraint, but to maximize how many distinct nonempty substrings appear in the string.