The 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan)
13 problems from The 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan) (contest 104901), difficulty -. 11/13 solutions verified against sample I/O.
The 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan)
ICPC/IOI | 13 problems | 11/13 verified | Difficulty - | 13m 38s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Many Many Heads | 1m 4s | ✓ | |||
| B | Graph Partitioning 2 | 4m 8s | ✓ | |||
| C | Turn on the Light 2 | 1m 17s | ✓ | |||
| D | Largest Digit | 45s | ✓ | |||
| E | I Just Want... One More... | 27s | ||||
| F | Say Hello to the Future | 35s | ✓ | |||
| G | Gifts from Knowledge | 1m 24s | ✓ | |||
| H | Basic Substring Structure | 28s | ||||
| I | Strange Sorting | 38s | ✓ | |||
| J | Computational Intelligence | 56s | ✓ | |||
| K | Rainbow Subarray | 33s | ✓ | |||
| L | Ticket to Ride | 39s | ✓ | |||
| M | Almost Convex | 44s | ✓ |
CF 104901M - Almost Convex
We are given a set of points in the plane, with no duplicates and no three collinear. From these points we want to form polygons whose vertices are chosen from the set. A valid polygon must be simple, meaning its edges do not intersect except at consecutive vertices.
CF 104901B - Graph Partitioning 2
We are given a tree, and we want to “cut” some edges so that the remaining connected components all have very specific sizes: each component must contain exactly k or k + 1 vertices.
CF 104901L - Ticket to Ride
We are given a line of cities from 0 to n, and between every adjacent pair we may or may not place a rail segment. Choosing a subset of these segments determines a collection of connected intervals on the line. A ticket is a triple (l, r, v).
CF 104901J - Computational Intelligence
We are given two line segments in the plane. From each segment, a point is chosen uniformly along its length, independently of the other segment. For every test case, we need the expected Euclidean distance between these two random points.
CF 104901K - Rainbow Subarray
We are given an integer array and we are allowed to modify it a limited number of times. Each modification increases or decreases a single element by exactly one.
CF 104901I - Strange Sorting
We are given a permutation, meaning an array of length $n$ containing every integer from $1$ to $n$ exactly once in some order. Our task is to transform this array into increasing order using a specific operation that modifies a contiguous segment.
CF 104901G - Gifts from Knowledge
We are given a binary matrix, but the only operation we are allowed is to optionally reverse each row. Reversing a row flips it horizontally, so the first column becomes the last, the second becomes the second last, and so on.
CF 104901H - Basic Substring Structure
Working
CF 104901F - Say Hello to the Future
We are given an array of problem difficulties, and we want to count how many valid ways exist to split the index range from 1 to n into contiguous segments.
CF 104901D - Largest Digit
We are given two closed integer intervals. One interval describes the possible values of an integer $a$, and the other describes the possible values of an integer $b$.
CF 104901E - I Just Want... One More...
Working
CF 104901C - Turn on the Light 2
We are asked to design, for each test case, a connected simple graph that uses exactly $m$ edges and as few or as many vertices as we choose (but at most $m+1$), under a degree constraint $d$.