Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада

4 problems from Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада (contest 105030), difficulty -. 2/4 solutions verified against sample I/O.

4 items

Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада

Special | 4 problems | 2/4 verified | Difficulty - | 5m 45s

#	Problem	Time	✓
A	\u0420\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u0438\u0435 \u043f\u0440\u044f\u043d\u043e\u0441\u0442\u0438	1m 17s	✓
B	\u0414\u043e\u0431\u044b\u0447\u0430 \u043f\u0440\u044f\u043d\u043e\u0441\u0442\u0438	1m 28s
C	\u041f\u0440\u0435\u0434\u0430\u0442\u0435\u043b\u044c\u0441\u0442\u0432\u043e \u042e\u044d	1m 22s	✓
D	\u041f\u0435\u0441\u0447\u0430\u043d\u0430\u044f \u0431\u0443\u0440\u044f	1m 38s

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада ›

CF 105030D - Песчаная буря

We are given a line of buildings, each with a fixed height. Over time, sandstorms partially “cover” some segment of buildings, and each building inside that segment is only visible up to a certain height limit.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада ›

CF 105030B - Добыча пряности

We are modeling a production pipeline with three sequential stages that behave like a single constrained assembly line. Each final unit, a harvester, is composed of one unit from stage I and one unit from stage II, and both of these must first be produced by earlier stages.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада ›

CF 105030C - Предательство Юэ

We are asked to count how many length $2n$ sequences can be formed using digits from 1 to 9 such that a very specific symmetry holds between the first half and the second half. Split any valid sequence into two parts of length $n$.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Четвертая личная олимпиада ›

CF 105030A - Распределение пряности

Each unit of spice is labeled with an integer topic. We must distribute all units among as few students as possible. A single student may receive several units, but any two topics assigned to that student must differ by more than k.