Всероссийская олимпиада по информатике им. Мстислава Келдыша - 2024
6 problems from Всероссийская олимпиада по информатике им. Мстислава Келдыша - 2024 (contest 105931), difficulty -. 6/6 solutions verified against sample I/O.
Всероссийская олимпиада по информатике им. Мстислава Келдыша - 2024
Special | 6 problems | 6/6 verified | Difficulty - | 7m 34s
CF 105931E - Матрица циклических сдвигов
We start with a one-dimensional array, but instead of working with it directly, we use it to generate an $n times n$ matrix where every row is just a cyclic shift of the original array.
CF 105931D - Вычислительная машина
We are given two binary strings of equal length, which we can think of as two rows aligned vertically. On each query, we take a substring interval and are allowed to apply two local transformation rules inside that interval.
CF 105931B - Манхэттенские перестановки
We are given a permutation of length $n$, meaning an arrangement of the numbers from $1$ to $n$ without repetition. For any position $i$, the contribution of that position is the distance between the value placed there and the index itself, taken in absolute value.
CF 105931A - Новый университет
The university is enrolling up to n students in total. Every student must fall into one of two categories. If a student pays tuition, they contribute a fixed amount a to the university. If a student receives a scholarship, their funding comes from a sponsor.
CF 105931F - Еж на дереве
We are given a rooted tree with a weight on every vertex. The tree structure is described by a parent array, so every node except the root has exactly one parent and the whole graph is connected and acyclic.
CF 105931C - Выборы
We are given a set of candidates indexed from 1 to n. Each candidate i starts with ai loyal supporters. In addition, there is a pool of c undecided voters who, if nothing changes, always vote for the smallest-numbered candidate among those who are still participating.