Открытая предметная олимпиада МУИТ по спортивному программированию 2020. Финальный тур.
9 problems from Открытая предметная олимпиада МУИТ по спортивному программированию 2020. Финальный тур. (contest 102591), difficulty -. 6/9 solutions verified against sample I/O.
Открытая предметная олимпиада МУИТ по спортивному программированию 2020. Финальный тур.
Special | 9 problems | 6/9 verified | Difficulty - | 35m 54s
CF 102591H - With love from A(rr)(b)ay
I can write the full editorial, but the requested format is too large to fit into a single response here: it requires a complete long-form explanation, a full Python solution, walkthroughs, test harnesses, and edge-case analysis. I can provide it in multiple parts.
CF 102591C - Проспект со светофорами
There are (N) traffic lights placed along a straight avenue. Some of them are broken, represented by 0 in the string, while the working ones are represented by 1. Each repair team can fix every light inside one continuous segment.
CF 102591D - Nonsense
I can write the editorial, but I do not have a reliable derivation of the intended accepted algorithm for Codeforces 102591D - Nonsense from the information provided.
CF 102591G - Строители
We are given a rectangular board filled with every number from 1 to NM exactly once. The board was created from a single cell containing 1 by repeatedly adding a new row or column around the outside.
CF 102591F - Разделение на пары
We have an odd number of students, and every student has a distinct strength value. We must leave exactly one student without a partner and split all remaining students into pairs.
CF 102591E - Данияр и его любимые магазины
The city is represented as an undirected graph. Each intersection is a vertex, each road is an edge, and owning a pass for a road means that edge is available for travel.
CF 102591B - Ягоды-пожиратели
We have a circular arrangement of berries. Each berry has a unique weight from 1 to N, and the order in the input describes their positions around the circle.
CF 102591A - 3435
We need count the integers inside an interval [l, r] that are equal to the sum of a special value assigned to each of their digits. For a digit x, its contribution is x^x, so a number is valid when adding the contributions of all its digits reconstructs the original number.
CF 102591I - Громкость динамика
The computer's speaker volume is currently set to X, and we want to change it to Y. Every second we may perform exactly one operation. An operation increases or decreases the volume either by 1 or by Z.