Moscow team school olympiad (MKOSHP) 2023

10 problems from Moscow team school olympiad (MKOSHP) 2023 (contest 104730), difficulty -. 1/10 solutions verified against sample I/O.

10 items

Moscow team school olympiad (MKOSHP) 2023

Special | 10 problems | 1/10 verified | Difficulty - | 17m 8s

#	Problem	Time	✓
A	\u0423\u043d\u0438\u043a\u0430\u043b\u044c\u043d\u0430\u044f \u043f\u0435\u0441\u043d\u044f	1m 11s	✓
B	\u0418\u0433\u0440\u0430 \u0434\u0436\u0435\u043d\u0442\u043b\u044c\u043c\u0435\u043d\u043e\u0432	1m 44s
C	Minimum Array	2m 12s
D	Minimum Segments	1m 37s
E	Time Travel	1m 15s
F	Split	1m 32s
G	Good Colorings	1m 58s
H	\u0417\u0430\u0434\u0430\u0447\u0430 \u0432 \u043f\u043e\u0434\u0430\u0440\u043e\u043a	1m 38s
I	\u0412\u044b\u0438\u0433\u0440\u0430\u0439 \u041c\u041a\u041e\u0428\u041f	2m 29s
J	\u041f\u0443\u0442\u0451\u0432\u043a\u0430 \u043d\u0430 \u041e\u0441\u0442\u0440\u043e\u0432\u0430 \u041a\u0443\u043a\u0430	1m 32s

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730I - Выиграй МКОШП

We are given a small team of up to 12 students and up to 100 monsters. Each student has three attributes: current health, attack power, and a one-time shielding ability that can be used to increase any student’s health.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730J - Путёвка на Острова Кука

We are given several independent test cases. In each test case, there are $3n$ points on the plane, all with integer coordinates and all distinct.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730H - Задача в подарок

We are given a collection of problems, each with a non-negative difficulty value, and a total mental budget $S$. We may choose a subset of problems whose total difficulty does not exceed $S$, and these are considered “solved normally”.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730G - Good Colorings

We are given an $n times n$ grid. At the start, Alice has already colored exactly $2n$ distinct cells, and each of these cells is assigned a unique color from $1$ to $2n$.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730F - Split

We are given a permutation of size $n$, meaning every value from $1$ to $n$ appears exactly once in the array. For each query, we look at a contiguous segment and ask whether it can be split into two consecutive parts such that every value in the left part is strictly smaller…

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730E - Time Travel

We are given a fixed set of cities, but the road network between them changes over time. Each “time moment” describes a different undirected graph on the same set of cities, and there are up to 200000 such snapshots. You are also given a fixed sequence of time jumps.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730B - Игра джентльменов

We are given a collection of cards, each card contains an array of length n. There are n players, and exactly m cards available. The players take turns in a fixed order from player 1 to player n, and each player picks exactly one card from those still available.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730D - Minimum Segments

We are given a sequence $r1, r2, ldots, rn$. This sequence does not come from the original array directly, but from a derived process applied to some hidden array $a$, where each $ai$ is an integer between 1 and $n$.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730C - Minimum Array

We start with an initial array and a sequence of range updates that are applied one after another. After each prefix of these operations, we obtain a new version of the array.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2023 ›

CF 104730A - Уникальная песня

We are given two collections of strings, each of size $n$. We must arrange them into a single sequence of length $2n$, but the positions are fixed by parity: every odd position must contain a string from the first collection, and every even position must contain a string from…