2019 Московская командная олимпиада школьников, лига A

12 problems from 2019 Московская командная олимпиада школьников, лига A (contest 102399), difficulty -. 10/12 solutions verified against sample I/O.

12 items

2019 Московская командная олимпиада школьников, лига A

Special | 12 problems | 10/12 verified | Difficulty - | 1h 11m

#	Problem	Time	✓
A	\u041c\u0430\u0440\u0438\u043e \u0438 \u043c\u0438\u0440\u043e\u0432\u043e\u0439 \u0440\u0435\u043a\u043e\u0440\u0434	1m 58s	✓
B	\u041b\u0438\u0447\u043d\u043e\u0441\u0442\u044c \u0448\u0438\u0440\u043e\u043a\u0438\u0445 \u0432\u0437\u0433\u043b\u044f\u0434\u043e\u0432	14m 8s	✓
C	\u0418\u0432\u0430\u043d\u0443\u0448\u043a\u0430-\u0434\u0443\u0440\u0430\u0447\u043e\u043a \u0438 \u0442\u0435\u043e\u0440\u0438\u044f \u0432\u0435\u0440\u043e\u044f\u0442\u043d\u043e\u0441\u0442\u0435\u0439	2m 14s	✓
D	\u0414\u043e\u0440\u043e\u0433\u0438 \u0432 \u0441\u0442\u0440\u0430\u043d\u0435	3m 5s	✓
E	write me!	10m 1s	✓
F	XOR \u0448\u0438\u0444\u0440\u043e\u0432\u0430\u043d\u0438\u0435	12m 42s	✓
G	\u0426\u0435\u043b\u044b\u0435 \u0442\u043e\u0447\u043a\u0438	3m 3s	✓
H	\u0424\u043e\u043a\u0443\u0441 \u0441 \u0434\u0435\u043b\u0435\u043d\u0438\u0435\u043c \u0438 \u0443\u043c\u043d\u043e\u0436\u0435\u043d\u0438\u0435\u043c	4m 8s	✓
I	\u0416\u0443\u043b\u0438\u043a, \u043d\u0435 \u0432\u043e\u0440\u0443\u0439	11m 11s	✓
J	\u041a\u043e\u043d\u043a\u0443\u0440\u0441 \u043a\u043e\u0442\u0438\u043a\u043e\u0432	3m 47s
K	\u0427\u0435\u0440\u0435\u043f\u0430\u0448\u043a\u0430	3m 59s
L	\u0414\u043e\u0440\u043e\u0433\u043e\u0439 \u0448\u043a\u0430\u0444	1m 24s	✓

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399G - Целые точки

We have two families of straight lines. The first family contains lines of the form (y=x+p), and the second contains lines of the form (y=-x+q). The values (p) are distinct integers, as are the values (q).

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399K - Черепашка

We have a (2times n) grid containing exactly (2n) lettuce leaves. Each leaf has a nonnegative energy value, and Kolya may freely permute all leaves before the turtle starts.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399D - Дороги в стране

We have a directed weighted graph of cities. City 1 is the capital, and every directed road u - v has a capacity w, meaning a cargo of weight at most w can traverse that road. For a fixed city s, a route from s to the capital can use several roads.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399J - Конкурс котиков

There are (n) residents and (n) cats. Resident (i) owns cat (i). Each acquaintance relation is represented by a directed edge from resident (a) to cat (b), meaning that resident (a) knows cat (b). Every resident knows their own cat, so every vertex has a self-loop.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399H - Фокус с делением и умножением

We have (n) distinct positive integers (a1,ldots,an). A card contains some positive integer (x). Taking that card lets us perform exactly one operation on exactly one array element: multiply it by (x), or divide it by (x) when the division is exact.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399C - Иванушка-дурачок и теория вероятностей

We have an (n times m) rectangular grid whose cells are colored with two colors. Two cells are neighbors when they share a side. A coloring is valid if every cell has at most one neighbor with the same color.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399L - Дорогой шкаф

We have a rectangular cabinet standing in the corner of a room. Its two dimensions along the walls are a and b. A door of length d is mounted at a distance l from the corner.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399E - write me!

We have (n) passengers sitting in seats numbered from left to right. Passenger (i) becomes hungry at time (ti). The hot-water tank is to the left of everyone, and only one passenger can use it at a time.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399A - Марио и мировой рекорд

We have (n) pipes. The (i)-th pipe has length (sqrt{ai}), where (1 le ai le 10^6). Mario wants to connect some of these pipes into one polyline starting at the origin. Every joint, including the final faucet, must have integer coordinates.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399I - Жулик, не воруй

We have a connected simple undirected graph. Swiper chooses a nonempty proper set of vertices and removes those vertices together with all incident edges. The remaining vertices must keep the same degree modulo (3) that they had before the removal.

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399F - XOR шифрование

We maintain a dynamic set (A) of distinct integers, initially empty. After every insertion or deletion, we must determine how small the MEX can become after choosing some XOR mask (x) with (0 le x le k).

Practice › Codeforces Solutions › 2019 Московская командная олимпиада школьников, лига A ›

CF 102399B - Личность широких взглядов

We work with a mutable string of parentheses. A substring is considered beautiful by counting how many of its cyclic rotations form a correct bracket sequence.