1951A - Двойное включение
Author: MofK
Prepared by Kuroni
First solve: tourist at 00:00:01
1951B - Битвы коров
Author: MofK
Prepared by Kuroni
First solve: tourist at 00:00:02
Hint 1What is the condition for your cow to win her first match?
Hint 2If your cow is not already winning her first match, there are at most two candidate positions you can swap her to.
Comments from the authorsThis problem was added after 1951D - Buying Jewels was deemed too hard to be problem B. At first, we decided to hide the case of swapping with the first stronger cow from the sample test. The testers weren't too impressed:
1951C - Запас билетов
Author: MofK
Prepared by Kuroni
First solve: tourist at 00:00:03
Hint 1If there is no additional cost (i.e. buying a ticket at day $$$i$$$ costs only $$$a_i$$$), what is the optimal buying strategy?
Hint 2If there \textit{is} additional cost but $$$a_i = 1$$$ for all $$$i$$$, what is the optimal buying strategy?
Hint 3The above two strategies are the same, and the primary and secondary costs are independent of each other. \textit{Surely} the solution is not just choosing $$$k$$$ cheapest tickets right?
1951D - Покупка драгоценностей
Author: MofK
Prepared by MofK
First solve: tourist at 00:00:04
HintPerhaps the easiest way of dealing with this problem is writing down small cases and see what happens.
Comments from the authorsThis problem was originally problem B. It turned out to be too hard and was switched to C, with 1951B - Battle Cows inserted, before being further switched to D as it was still too hard.
1951E - Без палиндромов
Author: MofK
Prepared by MofK
First solve: tourist at 00:00:05
HintLet $$$i$$$ be the first character that is different from $$$s_1$$$. Then $$$s_{1..i}$$$ is not a palindrome. If $$$s_{i+1..n}$$$ is also not a palindrome then we are done, but what can we do if it is?
Comments from the authorsIt is rather unfortunate that the solution only uses partitions of at most size $$$2$$$, therefore one can solve'' the problem by brute forcing every possible partition and check validity using any string matching algorithm. Nevertheless, we tried our hardest to make sure dumber
solutions'' won't pass.
1951F - Инверсии композиции
Author: Kuroni
Prepared by Kuroni
First solve: tourist at 00:00:06
1951G - Клацанье шарами
Author: MofK
Prepared by Kuroni
First solve: tourist at 00:00:07
Hint 1We should represent a state as the sequence of distances between each pair of consecutive balls.
1951H - Щелчок Таноса
Author: Kuroni
Prepared by Kuroni
First solve: tourist at 00:00:08
1951I - Выращивание деревьев
Author: Kuroni
Prepared by Kuroni
First solve: tourist at 00:00:09