Интернет-олимпиады, Сезон 2019-2020, Вторая командная олимпиада, усложненная номинация
11 problems from Интернет-олимпиады, Сезон 2019-2020, Вторая командная олимпиада, усложненная номинация (contest 102407), difficulty -. 9/11 solutions verified against sample I/O.
Интернет-олимпиады, Сезон 2019-2020, Вторая командная олимпиада, усложненная номинация
Special | 11 problems | 9/11 verified | Difficulty - | 55m 44s
CF 102407A - Сумасшедшие транспортные налоги
We have a sorted tax table. Each row contains a horsepower boundary bi and a tax rate ti. The first boundary is always zero, and the boundaries strictly increase.
CF 102407K - Crazy Arrangements
The tree itself looks central to the statement, but the useful representation is not the edge weights. Root the tree at any vertex, say vertex 1, and let (hv) be the XOR of the edge weights on the path from the root to (v).
CF 102407B - Crazy dance
The Joker counts seconds starting from one. At second (t), he says the representation of (t) in base (a), without leading zeroes. For example, in base (3), the sequence starts with (1,2,10,11,12,ldots).
CF 102407I - Вырваться из окружения
We have an (n times n) grid, with the Joker at cell ((a,b)). We need to count cells inside the grid whose Manhattan distance from the Joker is exactly (d). For a cell ((x,y)), the condition is [ ] Without the grid boundaries, these cells form a diamond around ((a,b)).
CF 102407F - Беспорядочное выступление
We have an array of nonnegative values a 1 ,…,a n , one value for each spectator. Each police officer watches one contiguous interval [l i ,r i ].
CF 102407E - Странная игра на графе
The board is an undirected simple graph. A move does not remove a vertex, it removes an edge, and the next move has to use an edge sharing an endpoint with the edge removed immediately before it. An edge can be used only once because it disappears after being selected.
CF 102407C - Catch the Animals
I can write the editorial, but the problem statement and samples are missing from your prompt, and I cannot reliably reconstruct the task from the title alone. Please provide the actual statement so I can derive the correct algorithm and tests. Waiting for your answer
CF 102407J - Убийственная математика
На экране находятся два целых числа a и b, причём a <= b. За один ход можно выбрать одно из них и заменить выбранное число либо на округлённое вверх…
CF 102407D - Ограбление банка
We encode each lowercase letter by its position from 0 to 25. The first number a[0] fixes the exact first letter of the code. Every later number a[i] specifies the absolute difference between the numerical values of two consecutive letters.
CF 102407H - Этажи
We have a building with floors numbered from (1) to (n). Some floors have working number signs. The sorted array (a1,ldots,at) contains exactly those signed floors, with floors (1) and (n) always included. Arthur initially stands on a uniformly random floor.
CF 102407G - Crazy domino
We have an (n times n) chessboard. We may place at most (n) checkers on individual cells. Every remaining cell must be covered by exactly one domino, where a domino always covers two cells sharing a side.