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

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

8 items

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

Special | 8 problems | 6/8 verified | Difficulty - | 10m 38s

#	Problem	Time	✓
A	\u0412\u044b\u0441\u0442\u0430\u0432\u043a\u0430 \u0438\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u043e\u043d\u0438\u0441\u0442\u043e\u0432	1m 45s	✓
B	\u041d\u0430\u0440\u0443\u0442\u043e	33s
C	\u041f\u043e\u0434 \u0434\u043e\u0436\u0434\u0451\u043c	1m 12s	✓
D	\u0418\u0433\u0440\u0430 \u0432 \u0433\u043e\u0440\u043e\u0434\u0430	1m 39s	✓
E	\u0421\u0430\u0448\u0430 \u0438 \u0437\u0430\u0447\u0451\u0442	1m 20s
F	\u0421\u0430\u0448\u0430 \u043e\u043f\u044f\u0442\u044c \u0434\u0435\u043b\u0430\u0435\u0442 \u0437\u0430\u0434\u0430\u0447\u0443 \u043f\u0440\u043e \u043f\u0440\u043e\u0441\u0442\u044b\u0435 \u0447\u0438\u0441\u043b\u0430	1m 13s	✓
G	\u041f\u043b\u0430\u043d \u0414	1m 1s	✓
H	\u0414\u043e\u0441\u0442\u0430\u0432\u043a\u0430 \u0435\u0434\u044b	1m 55s	✓

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

CF 102739D - Игра в города

The task is to divide a square city map into two countries. Each cell either contains a city or is empty. The number of cities in the whole map is even, and the two countries must receive exactly the same number of cities.

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

CF 102739A - Выставка импрессионистов

The gallery contains n paintings placed in a fixed order from left to right. Arina starts at the first side of the gallery and walks toward the last painting. During a walk she can only stop at paintings that are ahead of her in the current direction.

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

CF 102739H - Доставка еды

The problem asks us to answer many range queries on a sequence of delivery companies. During the day, the companies of arriving couriers are recorded as an array a.

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

CF 102739E - Саша и зачёт

I can write the editorial, but the problem identifier in your prompt does not match the actual problem details. Codeforces problem 102739E - “Саша и зачёт” does not have the statement text included here, and I cannot reliably reconstruct its algorithm from the…

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

CF 102739B - Наруто

I can write the full editorial, but the problem statement for Codeforces 102739B - “Наруто” is missing from the prompt. I could not reliably reconstruct the problem from the title and ID alone, and inventing the algorithm would likely produce a wrong editorial.

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

CF 102739G - План Д

We have n independent subtasks that must be completed during m consecutive days. Each subtask has an allowed time interval: it can be done on any day from si to fi.

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

CF 102739F - Саша опять делает задачу про простые числа

The task is to make every fitness tracker value acceptable to Sasha. A value is acceptable if it is either a prime number or a power of two. For each recorded number, we need to find the smallest acceptable number that is not smaller than the recording.

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

CF 102739C - Под дождём

Polina has a fixed route home. The first part of the route is an uncovered street that takes t1 minutes, and the second part is an alley under trees that takes t2 minutes. She may choose when to leave school, but she has to arrive no later than time d.