Moscow team school olympiad (MKOSHP) 2024

12 problems from Moscow team school olympiad (MKOSHP) 2024 (contest 105449), difficulty -. 1/12 solutions verified against sample I/O.

12 items

Moscow team school olympiad (MKOSHP) 2024

Special | 12 problems | 1/12 verified | Difficulty - | 20m 1s

#	Problem	Time	✓
A	\u0421\u043a\u0438\u043f \u0438\u043b\u0438 \u043d\u0435 \u0441\u043a\u0438\u043f	1m 35s
B	\u041e\u0442\u0433\u0430\u0434\u0430\u0439 \u0441\u0442\u0440\u043e\u043a\u0443	2m 22s
C	\u0425\u043e\u043b\u043c\u044b \u0438 \u044f\u043c\u044b	1m 45s
D	\u0425\u043e\u0440\u043e\u0448\u0438\u0435 \u0440\u0430\u0441\u043a\u0440\u0430\u0441\u043a\u0438 6	3m 34s
E	\u041f\u043e\u043a\u0443\u043f\u043a\u0430 \u043a\u043e\u043b\u044b	1m 52s
F	\u041d\u0412\u041f\u0411\u041f	1m 31s
G	\u0421\u043a\u043b\u0435\u0438\u0432\u0430\u043d\u0438\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u043e\u0432	1m 24s
H	\u0427+\u041a+\u0421	1m 40s
I	\u041f\u0440\u043e\u0441\u0442\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430 \u0434\u043b\u044f \u043b\u044e\u0431\u0438\u0442\u0435\u043b\u0435\u0439	28s
J	\u041c\u043d\u043e\u0433\u043e \u0438\u0433\u0440	1m 17s
K	\u0414\u0440\u0435\u0432\u043e \u0436\u0438\u0437\u043d\u0438	1m 20s
L	\u0412\u044b\u0433\u043e\u0434\u043d\u044b\u0439 \u043f\u0440\u043e\u0446\u0435\u043d\u0442	1m 13s	✓

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

CF 105449F - НВПБП

We are given an array and its longest strictly increasing subsequence length. For every query, we remove a contiguous segment and ask whether this removal keeps the LIS length unchanged. In other words, the original array has some optimal increasing subsequence of length L.

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

CF 105449K - Древо жизни

We are given a tree, meaning a connected graph with no cycles, and each edge represents a “magical channel” between two nodes. At every node, several edges meet, and any pair of edges incident to the same node creates a potential conflict that must be neutralized.

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

CF 105449J - Много игр

We are given a collection of independent gambling games. Each game has a probability of success and a payout if it succeeds. The twist is that if any chosen game fails, the entire selection yields zero reward.

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

CF 105449I - Простая задача для любителей

I cannot reliably reconstruct the solution to Codeforces 105449I - “Простая задача для любителей” from the information currently available.

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

CF 105449H - Ч+К+С

We are given two directed graphs, each with $n$ vertices. Both graphs are strongly connected, and every directed cycle inside either graph has length divisible by $k$. Each vertex is labeled either as outgoing or incoming.

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

CF 105449G - Склеивание массивов

We are given several independent test cases. In each test case there are $n$ small blocks, and each block contains exactly two numbers. We are allowed to reorder these blocks arbitrarily, but we are not allowed to change the order inside any block.

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

CF 105449D - Хорошие раскраски 6

We need to fill a grid with integers from $0$ to $2^c - 1$, where each integer represents a subset of $c$ colors via its binary representation. If the $k$-th bit of a cell value is $1$, that cell belongs to color $k$. Three constraints govern the construction.

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

CF 105449L - Выгодный процент

A bank offers a special high-interest deposit that can only be opened if the deposited amount reaches or exceeds a threshold value b. Philip has a rubles available, and his goal is to maximize how much money he can place into this high-interest deposit.

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

CF 105449A - Скип или не скип

We are given a process that starts from task 1 and moves through a system that dynamically chooses the next task based on what we previously did. Each task has a score value and also a “jump limit” that affects where the next available task can come from if we skip.

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

CF 105449E - Покупка колы

We are given a vending machine with several hidden compartments, each containing some number of cans. There are also the same number of buttons, but the labels are lost, so each button is secretly wired to exactly one compartment via a fixed unknown permutation.

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

CF 105449B - Отгадай строку

We are given a hidden string of length $n$, built from the first $k$ lowercase Latin letters. We are not given the string directly. Instead, we are given two pieces of information that uniquely determine it.

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

CF 105449C - Холмы и ямы

We are given an array of integers that represents terrain heights along a one-dimensional road. Each position has either surplus sand (positive value) or a deficit that must be filled (negative value).