Сириус.2019.Ноябрь.Очный отбор

7 problems from Сириус.2019.Ноябрь.Очный отбор (contest 102330), difficulty -. 7/7 solutions verified against sample I/O.

7 items

Сириус.2019.Ноябрь.Очный отбор

Special | 7 problems | 7/7 verified | Difficulty - | 20m 4s

#	Problem	Time	✓
A	\u0414\u043e\u043a\u0442\u043e\u0440 \u0410\u0439\u0431\u043e\u043b\u0438\u0442	5m 9s	✓
B	\u041f\u043e\u0435\u0437\u0434\u043a\u0430 \u043d\u0430 \u043e\u043b\u0438\u043c\u043f\u0438\u0430\u0434\u0443	54s	✓
C	\u041c\u044f\u0447\u0438\u043a\u0438	4m 33s	✓
D	\u041f\u0440\u043e\u0433\u0440\u0435\u0441\u0441\u0438\u0432\u043d\u044b\u0439 \u0442\u043e\u0440\u0433	1m	✓
E	\u0413\u0435\u043e\u0440\u0433\u0438\u0439 \u0438 \u0432\u043e\u0435\u043d\u043a\u043e\u043c\u0430\u0442	4m 42s	✓
F	\u0417\u0432\u0435\u0440\u044c\u043a\u0438	2m 26s	✓
G	\u0421\u0430\u0448\u0430 \u0438 \u0441\u0442\u0430\u0436\u0438\u0440\u043e\u0432\u043a\u0438	1m 20s	✓

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330C - Мячики

Petya throws one ball every minute toward Vova. The distance between them is L, and every ball moves at speed X, so a ball needs L / X minutes to reach Vova. Vova does not shoot balls immediately. He starts shooting when a ball gets within distance D of him.

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330A - Доктор Айболит

We have an array a of n animals. The value a[i] is the amount of time Doctor Aibolit needs to examine animal i. The doctor handles one animal at a time, so the animals form a single queue. For a chosen order, the first animal waits 0 time units.

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330G - Саша и стажировки

We are given a task number written as a sequence of decimal digits. A split chooses several cut positions between digits, so every resulting piece is interpreted as a separate task number.

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330F - Зверьки

We have n animals. Animal i has three parameters a i , b i , and c i . If the cage currently contains at most c i animals, this animal contributes a i aggression. If the cage contains more than c i animals, it contributes b i , where a i ≤b i .

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330E - Георгий и военкомат

Есть n человек и k последовательных печатей. Печати расположены в фиксированном порядке: сначала человек должен получить первую, затем вторую и так…

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330D - Прогрессивный торг

We have two current offers, x from Barnum and y from Carlisle, with x <= y. Barnum increases his offer by a, then Carlisle decreases his offer by b. On the next pair of moves the changes become 2a and 2b, then 3a and 3b, and so on.

Practice › Codeforces Solutions › Сириус.2019.Ноябрь.Очный отбор ›

CF 102330B - Поездка на олимпиаду

There are n train cars. In car i, a[i] seats are still free after the chemistry team has bought its tickets. The informatics team has exactly k participants and wants to buy tickets so that every car in which they travel becomes completely full.