Квалификационный тур Уральского четвертьфинала Чемпионата мира по программированию 2019
11 problems from Квалификационный тур Уральского четвертьфинала Чемпионата мира по программированию 2019 (contest 102386), difficulty -. 5/11 solutions verified against sample I/O.
Квалификационный тур Уральского четвертьфинала Чемпионата мира по программированию 2019
Special | 11 problems | 5/11 verified | Difficulty - | 1h 41m
CF 102386K - Малыш и Карлсон
We have a strictly convex polygon whose vertices are given counterclockwise and have integer coordinates. We need to draw one straight line that divides the polygon into two regions of exactly equal area.
CF 102386H - Светофоры
There are two traffic-light countdowns, initially showing (A) and (B). After every second, both values decrease by one. We are interested only in moments when both counters are still positive, because as soon as one reaches zero, the red-light period ends.
CF 102386B - Турнир УрФУ
We need to judge one round of Rock-Paper-Scissors-Lizard-Spock. The first input line is the move chosen by the first player, and the second line is the move chosen by the second player. Each move is one of Rock, Scissors, Paper, Lizard, or Spock.
CF 102386I - Персеантовка
We are given a sentence whose words may have had their internal letters rearranged. For every word, the first and last letters were kept fixed, while any permutation of the letters between them was allowed.
CF 102386D - Артем в армии
There are exactly three tanks, numbered 1, 2, and 3, and Artem starts in tank k. Each command names two different tanks. The crews of those two tanks exchange their tanks, so Artem moves only when his current tank is one of the two mentioned in the command.
CF 102386F - Кубик
На клетчатом поле движется обычный кубик. До начала движения на его шести гранях можно расставить числа от 1 до 6, каждое число ровно один раз.
CF 102386E - Отложенные операции
We have a sequence of (n) days. On day (i), a homework assignment for subject (ai) appears. Dima may either spend the day doing all currently accumulated homework for one subject, or do nothing. Doing a subject clears every assignment of that subject received so far.
CF 102386C - Найди отличия
We are given two rectangular character images of the same size. Each image is represented by n rows, each containing exactly m non-whitespace characters.
CF 102386J - Катамари
We have an (n times m) grid. Every cell contains an object with an integer size (a{ij}). We need to visit every cell exactly once, moving only between side-adjacent cells, and the sequence of object sizes along the route must be nondecreasing.
CF 102386G - Уральские блинчики
Think of every non-burnt cell as a vertex of a graph. Two vertices are connected when their cells share a side. The statement guarantees that this graph is connected.