The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online (The 2nd Universal Cup. Stage 1: Qingdao)
11 problems from The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online (The 2nd Universal Cup. Stage 1: Qingdao) (contest 104566), difficulty -. 11/11 solutions verified against sample I/O.
The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online (The 2nd Universal Cup. Stage 1: Qingdao)
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 11m 39s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Live Love | 50s | ✓ | |||
| B | Red Black Tree | 1m 23s | ✓ | |||
| C | Halting Problem | 1m 58s | ✓ | |||
| D | Pixel Art | 51s | ✓ | |||
| E | Infinite Parenthesis Sequence | 53s | ✓ | |||
| F | Chaleur | 48s | ✓ | |||
| G | Couleur | 53s | ✓ | |||
| H | Traveling on the Axis | 1m 21s | ✓ | |||
| I | Kuririn MIRACLE | 1m 4s | ✓ | |||
| J | Press the Button | 51s | ✓ | |||
| K | XOR Clique | 47s | ✓ |
CF 104566K - XOR Clique
We are given several independent test cases. In each test case, there is an array of integers. From this array we want to select as many indices as possible, forming a subset $S$, with the constraint that every pair of chosen values behaves in a very specific way under XOR.
CF 104566J - Press the Button
We are simulating a game that evolves over continuous time, but all interactions only happen at integer seconds. At certain seconds, two players may press a special button multiple times.
CF 104566H - Traveling on the Axis
We are given a line of integer points from 0 to n. Between every adjacent pair of integers i and i+1 there is a traffic light located at i + 0.5. Each light is either type 0 or type 1.
CF 104566I - Kuririn MIRACLE
Two circular cars move on a plane. The first car starts at the origin and must reach a point on the positive x-axis at distance d. The second car starts to the right of the origin and moves further right at constant speed v. Both cars have the same radius r.
CF 104566G - Couleur
We are asked to construct an initial ordering of players in a knockout tournament. There are three types of players, Rock, Paper, and Scissors, with fixed counts.
CF 104566F - Chaleur
We are given a friendship graph. Each vertex represents a person, and an edge means two people know each other. For each test case, we must reason about two extreme types of groups.
CF 104566E - Infinite Parenthesis Sequence
We start with a finite string of parentheses, and then extend it into a doubly infinite sequence by repeating it periodically in both directions.
CF 104566C - Halting Problem
We are asked to construct an initial ordering of players in a knockout tournament. There are three types of players, Rock, Paper, and Scissors, with fixed counts.
CF 104566D - Pixel Art
We are given a grid with $n$ rows and $m$ columns, initially completely white. We then paint $k$ disjoint segments on this grid.
CF 104566B - Red Black Tree
We are given a weighted tree rooted at node 1. Some vertices are initially colored red, including the root, and all other vertices are black.
CF 104566A - Live Love
We are given a binary-like sequence, but instead of bits it consists of two labels: PERFECT and NON-PERFECT. The sequence has fixed length n, and exactly m of its positions must be PERFECT while the remaining n - m are NON-PERFECT.