Высшая проба - 2023. Заключительный этап

5 problems from Высшая проба - 2023. Заключительный этап (contest 104964), difficulty -. 0/5 solutions verified against sample I/O.

5 items

Высшая проба - 2023. Заключительный этап

Special | 5 problems | 0/5 verified | Difficulty - | 8m 6s

#	Problem	Time
A	3 \u0422\u043e\u0447\u043a\u0438	1m 26s
B	\u041a\u043e\u043c\u043c\u0443\u043d\u0438\u043a\u0430\u0446\u0438\u044f \u043d\u0430 \u0432\u044b\u0441\u043e\u043a\u043e\u043c \u0443\u0440\u043e\u0432\u043d\u0435	1m 39s
C	\u0421\u043b\u0435\u0434\u0441\u0442\u0432\u0438\u0435 \u0432\u0435\u043b\u0438	1m 37s
D	\u0412\u044b\u0431\u043e\u0440 \u043f\u043e\u043b\u043e\u0441\u044b	1m 29s
E	\u041f\u043e\u0434\u0432\u044f\u0437\u044b\u0432\u0430\u043d\u0438\u0435 \u043c\u0430\u043b\u0438\u043d\u044b	1m 55s

Practice › Codeforces Solutions › Высшая проба - 2023. Заключительный этап ›

CF 104964E - Подвязывание малины

We are given a large rectangular grid. Some grid cells contain a plant, and each plant has a fixed length. From each plant, we may choose to “tie” it in at most one of four directions: up, down, left, or right.

Practice › Codeforces Solutions › Высшая проба - 2023. Заключительный этап ›

CF 104964D - Выбор полосы

We are moving through a road that is split into consecutive segments between terminals. Each segment can be traveled in several parallel lanes, and each lane has its own travel cost for that segment.

Practice › Codeforces Solutions › Высшая проба - 2023. Заключительный этап ›

CF 104964B - Коммуникация на высоком уровне

We are given a line of buildings, and each building must receive a sensor placed at some integer height. For building $i$, the chosen height $di$ is restricted to lie inside its own interval $[ai, bi]$.

Practice › Codeforces Solutions › Высшая проба - 2023. Заключительный этап ›

CF 104964C - Следствие вели

We are given a binary sequence and an expression formed by chaining them with the logical implication operator. If we evaluate it strictly left to right, every step combines the current accumulated value with the next bit using implication.

Practice › Codeforces Solutions › Высшая проба - 2023. Заключительный этап ›

CF 104964A - 3 Точки

We are given three integer positions on a number line, representing three points. One operation lets us pick an ordered pair of these points and move one unit of value from the second chosen point to the first chosen point.