Всероссийская олимпиада по информатике им. Мстислава Келдыша - 2020
5 problems from Всероссийская олимпиада по информатике им. Мстислава Келдыша - 2020 (contest 104361), difficulty -. 5/5 solutions verified against sample I/O.
Всероссийская олимпиада по информатике им. Мстислава Келдыша - 2020
Special | 5 problems | 5/5 verified | Difficulty - | 4m 43s
CF 104361E - Шахматные баталии
We are working on a rectangular grid of size $2n times 2m$ with a fixed chess coloring: a cell $(i, j)$ is white if $i + j$ is even, otherwise it is black. Only white cells matter for the game.
CF 104361D - Перевернутые родословные
We are given a structure on $n$ labeled people where each person has either zero or exactly one child. If a person has no child, their outgoing pointer is 0. Otherwise, every person points to exactly one child index in $[1, n]$.
CF 104361B - Выбор цветов для букета
We are given a bouquet that must contain exactly n flowers, and there are m flower types. Each type can be used any number of times. The reward model for a type is not constant per flower.
CF 104361C - Межпланетные электрички
We are working with a cyclic daily timetable split into minutes. A passenger railway service must run forever with a fixed periodic pattern: trains depart exactly every m/2 minutes, and each departure occupies the platform for a fixed interval before it.
CF 104361A - Подготовка к экзамену
We are asked to construct three integers $a, b, c$, all chosen from a fixed interval $[l, r]$, together with a positive integer $n$, such that a linear expression holds exactly: $$n cdot a + b - c = m.$$ The input gives us the bounds $l$ and $r$, and a target value $m$.