2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)
11 problems from 2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019) (contest 102392), difficulty -. 11/11 solutions verified against sample I/O.
2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 29m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Max or Min | 2m 43s | ✓ | |||
| B | Level Up | 2m 17s | ✓ | |||
| C | Find the Array | 3m 34s | ✓ | |||
| D | Cycle String? | 1m 52s | ✓ | |||
| E | Life Transfer | 4m 16s | ✓ | |||
| F | Game on a Tree | 1m 25s | ✓ | |||
| G | Projection | 2m 11s | ✓ | |||
| H | Tree Permutations | 2m 42s | ✓ | |||
| I | Absolute Game | 1m 16s | ✓ | |||
| J | Graph and Cycles | 1m 23s | ✓ | |||
| K | Stranded Robot | 6m 12s | ✓ |
CF 102392A - Max or Min
We have a circular array. In one operation, we choose one position and replace its value by either the minimum or the maximum of that position and its two neighbors.
CF 102392C - Find the Array
We have a hidden array a of n distinct positive integers. We do not receive its values directly. Instead, an interactive judge lets us ask two kinds of questions. A type 1 query gives the exact value at one position.
CF 102392I - Absolute Game
Alice and Bob each start with an array of (n) integers. On every turn, a player deletes one value from their own array, with Alice moving first. Deletions continue until each array contains exactly one value.
CF 102392H - Tree Permutations
The original tree is rooted at vertex (1), and every vertex (i1) has a parent (pi<i) and an edge weight (wi). The multiset containing all these parent values and all these edge weights has (2n-2) elements, but their roles are lost because the array was shuffled.
CF 102392K - Stranded Robot
We have a three-dimensional rectangular grid with dimensions m × n × p. A cell is either solid wreckage, empty space, the robot's starting cell R, or the teleporter T. The robot occupies an empty cell and is initially attached to some neighboring solid wreckage.
CF 102392J - Graph and Cycles
We have a complete undirected graph on an odd number (n) of vertices. Every one of its (frac{n(n-1)}2) edges has a positive weight. We must partition all edges into cycle-arrays.
CF 102392G - Projection
For a fixed depth coordinate x, the first projection tells us which y-positions must contain at least one cube, while the second projection tells us which z-positions must contain at least one cube. A cube at (x,y,z) simultaneously creates the projection cells (x,y) and (x,z).
CF 102392F - Game on a Tree
Root the given tree at vertex 1. The game can be viewed more naturally as a game on another graph. Create a graph whose vertices are the tree vertices, and connect two vertices whenever one is an ancestor of the other in the rooted tree.
CF 102392E - Life Transfer
We have (n) people with known ages. Every person must travel either as a driver or as a passenger in a car, or alone on a motorcycle. A car has capacity (k), exactly one of its occupants is the driver, and that driver must be at least (lc) years old.
CF 102392D - Cycle String?
Let the input length be (L=2n). The input is a multiset of lowercase letters, because the original cyclic order has been destroyed and only the symbols remain. We have to rearrange those letters into a cycle such that the (L) cyclic substrings of length (n) are all different.
CF 102392B - Level Up
Steve has a collection of quests, and every quest can be completed at most once. Before the first level is completed, quest (i) gives (xi) experience and costs (ti) minutes. After the first level is completed, the same quest gives only (yi) experience and costs (ri) minutes.