2023 ICPC Southeastern Europe Regional Contest (The 2nd Universal Cup, Stage 14: Southeastern Europe)
13 problems from 2023 ICPC Southeastern Europe Regional Contest (The 2nd Universal Cup, Stage 14: Southeastern Europe) (contest 105465), difficulty -. 13/13 solutions verified against sample I/O.
2023 ICPC Southeastern Europe Regional Contest (The 2nd Universal Cup, Stage 14: Southeastern Europe)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 14m 27s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | AND-OR closure | 57s | ✓ | |||
| B | Build Permutation | 1m 3s | ✓ | |||
| C | Christmas Sky | 58s | ✓ | |||
| D | Distinct Game | 1m 27s | ✓ | |||
| E | Eliminate Tree | 1m 23s | ✓ | |||
| F | Fast XORting | 1m 9s | ✓ | |||
| G | Graph Race | 1m 29s | ✓ | |||
| H | High Towers | 1m 16s | ✓ | |||
| I | Impossible Numbers | 54s | ✓ | |||
| J | Jackpot | 1m 1s | ✓ | |||
| K | $K$ Subsequences | 52s | ✓ | |||
| L | LIS on Grid | 58s | ✓ | |||
| M | Max Minus Min | 1m | ✓ |
CF 105465M - Max Minus Min
We start with an array of integers. In one move, we are allowed to pick a contiguous segment and add the same value to every element in that segment. We may also choose not to perform any move at all.
CF 105465K - $K$ Subsequences
We are given an array consisting only of 1 and -1. We must split the indices of this array into k groups. Each group is treated as a subsequence in the original order, meaning we keep relative order but do not require contiguity.
CF 105465J - Jackpot
We are given an array of length 2n. We repeatedly pick two adjacent elements in the current array, remove them, and gain a score equal to the absolute difference of those two values. After doing this exactly n times, the array becomes empty.
CF 105465G - Graph Race
We are working with a connected, unweighted, undirected graph. Every vertex has two values attached to it, $au$ and $bu$. The task only cares about vertices that are directly connected to vertex $1$.
CF 105465I - Impossible Numbers
We are given a collection of $n$ cubes, each cube having six visible digits. Each cube can be oriented so that any one of its six faces becomes the top face, which means that for every cube we can choose any one of its six digits as the digit it contributes.
CF 105465F - Fast XORting
We are given a permutation of all integers from 0 to n − 1, where n is a power of two. The goal is to transform this permutation into sorted order using two types of operations.
CF 105465D - Distinct Game
We are given two sequences, each acting like a stack where only the last element is accessible. Every value from 1 to k appears exactly twice across both sequences, so each number forms exactly one pair of occurrences scattered between the two stacks. Two players alternate moves.
CF 105465B - Build Permutation
We are given an array of integers and asked to construct a permutation π of indices from 1 to n such that pairing each position i with π[i] makes all sums ai + aπ[i] identical across every index i.
CF 105465C - Christmas Sky
We are given two finite point sets in the plane. One set represents the stars in a new photograph, the other represents stars in an old photograph. We are allowed to translate the new photo by a vector $(tx, ty)$, without rotating or scaling it.
CF 105465L - LIS on Grid
We are given a grid with $n$ rows and $m$ columns. For each column $j$, we must choose exactly $aj$ cells to paint black. All other cells remain white. The choices inside each column are free, as long as the number of black cells per column is fixed.
CF 105465H - High Towers
We are given a line of positions representing towers, and for each position we are told how many other towers that tower must be able to “see” or communicate with. Two towers can communicate if, between them, there is no tower strictly higher than both endpoints.
CF 105465E - Eliminate Tree
We are given a tree where every operation changes the structure in a very specific way. One type of operation inserts a new vertex and connects it to exactly one existing vertex, effectively creating a new leaf.
CF 105465A - AND-OR closure
We are given a set of distinct integers, and we are allowed to repeatedly apply two operations: bitwise AND and bitwise OR between any two elements. Every time we apply one of these operations, the result must also belong to the set.