Интернет-олимпиады, Сезон 2019-2020, Четвёртая командная олимпиада, усложненная номинация
10 problems from Интернет-олимпиады, Сезон 2019-2020, Четвёртая командная олимпиада, усложненная номинация (contest 102437), difficulty -. 5/10 solutions verified against sample I/O.
Интернет-олимпиады, Сезон 2019-2020, Четвёртая командная олимпиада, усложненная номинация
Special | 10 problems | 5/10 verified | Difficulty - | 42m 51s
CF 102437F - Быстрый перевод
This is an interactive problem. There is no ordinary input containing the account balance. The interactor secretly chooses an initial balance (n), with (0 le n le 10^{18}), and our program has to discover enough information about it to transfer the entire balance away.
CF 102437J - Delivery Robot
The robot moves in the plane, and its four commands are quarter-turns around one of two fixed radio towers. Commands 1 and 2 rotate the current point by 90 degrees clockwise or counterclockwise around the origin. Commands 3 and 4 do the same around the point ((1,0)).
CF 102437G - Regulated Shortest Path
We have an undirected graph whose vertices are cities and whose edges are roads. Sam starts in city s at time 0 and wants to reach city t as early as possible. Every road has its own repeating weather schedule. If a road has parameters a, b, and d, then its period is P = a + b.
CF 102437D - Квадраты Фибоначчи
We need to compute the sum of squares of the first (n+1) elements of a Fibonacci-like sequence. The sequence starts with two ones, so its first values are [ 1,1,2,3,5,8,ldots ] and every later value is the sum of the previous two.
CF 102437E - Похожие заказы
We have two strings of length (n). The string (s) describes the current stack of boxes, while (t) describes the previous stack. We may rotate (s) cyclically to the left by some (k), and then apply the same Caesar shift to every character.
CF 102437H - Сэм и хранилище
We have an array of positive values a[1..n]. Two players process it from left to right. On each turn, the current player may discard any number of still-unused elements from the front, then takes the next element.
CF 102437B - Breaking the Code
We start with a string s of length n. We may repeatedly delete one character, but only a character currently occupying one of the first two or one of the last two positions can be removed. After exactly n-k deletions, the remaining characters form the password.
CF 102437I - Road building
We have an initially empty (n times m) grid. A move consists of choosing an axis-aligned rectangle whose cells are all still empty and whose area is at most (s), then marking every cell of that rectangle as built.
CF 102437A - Блэк \& Уайт
There are (n) cities arranged around a circle and one capital in the middle. The only possible roads are the (n) circular roads between consecutive outer cities and the (n) spokes from the capital to the outer cities. Some roads may be absent.
CF 102437C - Единая сеть
We have a connected undirected graph whose edges form a cactus: every road belongs to at most one simple cycle. Each city must receive one of three transmitter types, and adjacent cities must receive different types.