Индивидуальная олимпиада школьников по информатике и программированию 2025
6 problems from Индивидуальная олимпиада школьников по информатике и программированию 2025 (contest 106201), difficulty -. 6/6 solutions verified against sample I/O.
Индивидуальная олимпиада школьников по информатике и программированию 2025
Special | 6 problems | 6/6 verified | Difficulty - | 6m 9s
CF 106201A - Нестандартный подход
We are given an $n times m$ grid, and we are allowed to choose a single starting cell on the boundary of this grid. From that chosen cell, a process starts that spreads to all four neighboring cells each second, exactly like a breadth-first expansion on a grid.
CF 106201D - Не доверяйте свиткам
We are dealing with three arrays of equal length, representing daily expenses split into food, equipment, and tavern spending. For the original data, every day has the same total spending across all three categories.
CF 106201E - Подъем на Высокий Хротгар
We are given a mountain represented as a vertical line from height 0 up to height n. Movement is linear: going up costs tu per meter and going down costs td per meter. On this line there are tasks. Each task consists of two heights ai and bi.
CF 106201F - Простая загадка
We are interacting with a hidden pair of integers $l$ and $r$, initially unknown but guaranteed to satisfy $1 le l le r le 10^6$. Our only way to learn about them is through an interactive process.
CF 106201B - Спасти Лютика!
We have a linear dungeon made of n chambers ordered from exit to entrance. Each chamber can hold at most m bandits. Initially all chambers are empty. Time progresses in discrete minutes, and every minute consists of two actions applied in a fixed order.