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

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

4 items

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

Special | 4 problems | 4/4 verified | Difficulty - | 3m 50s

#	Problem	Time	✓
A	\u0412\u043e\u0437\u0440\u0430\u0441\u0442\u0430\u044e\u0449\u0438\u0439 \u043c\u0430\u0441\u0441\u0438\u0432	1m 23s	✓
B	\u041f\u0435\u0440\u043b\u044b \u0438 \u043a\u043e\u043d\u0432\u0435\u0440\u0442\u0435\u0440	50s	✓
C	\u041d\u043e\u0432\u044b\u0439 \u043a\u043e\u0440\u0430\u0431\u043b\u044c	1m 1s	✓
D	Yahor in Menorca	36s	✓

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

CF 102806A - Возрастающий массив

We are given an array of integers. For every element, we are allowed to keep its current value or change its sign. The task is to decide whether there exists some choice of signs that makes the resulting array nondecreasing.

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

CF 102806B - Перлы и конвертер

We have a sequence of n pearls produced one by one. The color of the pearl produced at second i is given. A valid engine set must contain exactly one pearl of every color, so it always contains k pearls.

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

CF 102806D - Yahor in Menorca

We have several ant types. Type i has a[i] ants available. In one move, Dani can throw some ants away, but two limits apply at the same time: the total number of ants in the move cannot exceed m, and the number of ants taken from any single type cannot exceed k.

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

CF 102806C - Новый корабль

We have a rectangular planet divided into cells. Some cells are available for construction and some are blocked. The goal is to build the largest possible ship.