Московская командная олимпиада (МКОШП) 2017, Лига А

10 problems from Московская командная олимпиада (МКОШП) 2017, Лига А (contest 103985), difficulty -. 10/10 solutions verified against sample I/O.

10 items

Московская командная олимпиада (МКОШП) 2017, Лига А

Special | 10 problems | 10/10 verified | Difficulty - | 8m 36s

#	Problem	Time	✓
A	\u0412 \u0441\u0432\u0435\u0442\u0435 \u0441\u043e\u0444\u0438\u0442\u043e\u0432	52s	✓
B	\u0417\u0432\u0451\u0437\u0434\u043d\u043e\u0435 \u043d\u0435\u0431\u043e	1m 1s	✓
C	\u041a\u043e\u0440\u043e\u043b\u0435\u0432\u0441\u043a\u0438\u0435 \u0432\u043e\u043f\u0440\u043e\u0441\u044b	47s	✓
D	\u041d\u0430\u0446\u0438\u043e\u043d\u0430\u043b\u044c\u043d\u043e\u0435 \u0434\u043e\u0441\u0442\u043e\u044f\u043d\u0438\u0435	47s	✓
E	\u0421\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u043a\u0430 \u043c\u043e\u043d\u0435\u0442	45s	✓
F	\u041e\u0440 \u0432\u044b\u0448\u0435 \u0433\u043e\u0440	1m 10s	✓
G	\u041a\u043e\u0440\u043e\u0431\u043a\u0430 \u043a\u043e\u043d\u0444\u0435\u0442	47s	✓
H	\u0421\u043e\u043b\u044f\u043d\u043e\u0439 \u0440\u0443\u0434\u043d\u0438\u043a	47s	✓
I	\u041a\u0443\u0440\u044c\u0435\u0440\u0441\u043a\u0438\u0439 \u043a\u043b\u0443\u0431	1m 1s	✓
J	\u041a\u043e\u043c\u043f\u0430\u043d\u0438\u044f \u0438 \u043f\u043e\u0431\u0438\u0442\u043e\u0432\u043e\u0435 \u0418	39s	✓

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985J - Компания и побитовое И

We are given a list of non-negative integers, each representing a value assigned to a person in a group. The task is to compute a global measure of “group cohesion”, defined as the sum over all unordered pairs of people of the bitwise AND of their values.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985I - Курьерский клуб

We are given a sequence of delivery points on a number line that must be visited in a fixed order. Two couriers start at known positions on the same line.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985H - Соляной рудник

We are given a tree with $n$ vertices, where vertex 1 is the start and vertex $n$ is the destination. Each edge connects two vertices, but unlike a standard weighted tree, every edge is directed in a sense: if we traverse it from $u$ to $v$, we gain one value, and if we…

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985G - Коробка конфет

We are given a final visible sequence of candy wrappers arranged in the order the candies were eaten. Each wrapper is either red, blue, or unknown. The unknown symbol means we cannot see whether that eaten candy was red or blue.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985F - Ор выше гор

We are given a sequence of mountain heights. For any choice of two distinct positions $l < r$, consider the segment of mountains between them, including both endpoints.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985E - Сортировка монет

We are given a binary row of length $n$. Initially every position contains the same type of coin, which we can think of as “inactive”.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985D - Национальное достояние

We are given a sequence of book titles, each title being a list of integers. Each integer represents a letter in a large alphabet. Every letter can appear in two forms: lowercase and uppercase.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985B - Звёздное небо

We are given a set of distinct points on a plane representing stars. No three points lie on the same straight line, which removes degeneracies in geometric orientation checks.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985A - В свете софитов

We are given a rectangular painting of width $w$ and height $h$. Two identical square light sources are placed on the left and right vertical sides of this rectangle.

Practice › Codeforces Solutions › Московская командная олимпиада (МКОШП) 2017, Лига А ›

CF 103985C - Королевские вопросы

We are given a set of princes and a set of princesses. Each princess arrives with a fixed amount of dowry and two specific princes she is willing to marry. If she is used in the final arrangement, she must be matched to exactly one of those two princes.