Codemasters Codecup 2023 - Отборочный тур

10 problems from Codemasters Codecup 2023 - Отборочный тур (contest 104586), difficulty -. 6/10 solutions verified against sample I/O.

10 items

Codemasters Codecup 2023 - Отборочный тур

Special | 10 problems | 6/10 verified | Difficulty - | 14m 59s

#	Problem	Time	✓
A	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u044f\u0433\u043e\u0434\u044b	1m 4s	✓
B	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f	1m 24s	✓
C	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u043a\u0432\u0430\u0434\u0440\u0430\u0442\u0438\u043a\u0438	1m 8s	✓
D	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u0432\u044b\u043f\u0435\u043a\u0430\u043d\u0438\u0435 \u0431\u0443\u043b\u043e\u0447\u0435\u043a	59s	✓
E	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u043a\u043e\u043a\u0442\u0435\u0439\u043b\u0438	1m 21s
F	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u043a\u0440\u043e\u043b\u0438\u0447\u044c\u0438 \u043d\u043e\u0440\u044b	1m 40s	✓
G	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u0448\u0430\u0445\u043c\u0430\u0442\u044b	1m 29s
H	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u043f\u043e\u0434\u0441\u0442\u0440\u043e\u043a\u0438	1m 52s
I	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u0443\u0442\u0435\u0440\u044f\u043d\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432	2m 2s
J	\u0420\u0443\u0434\u043e\u043b\u044c\u0444 \u0438 \u043f\u043e\u0440\u0442\u0430\u043b \u0432 \u0420\u0430\u043c\u0435\u043d\u044c	2m	✓

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586J - Рудольф и портал в Рамень

We are given a set of vertical posts placed on a line, each defined by a position on the x-axis and a height. We are allowed to pick two different posts, say one as the “falling” post and one as the “target” post.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586I - Рудольф и утерянный массив

We are given a binary array, but instead of seeing it directly, we only receive partial information in the form of short interval constraints. Each constraint says that within a segment of length at most 10, the number of ones is exactly some value.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586H - Рудольф и подстроки

We are given an unknown string of length $n le 5000$, built from an alphabet of at most 26 characters. We cannot see the string directly. Instead, we can ask queries on any segment $[l, r]$, and the interactor returns how many distinct characters appear in that substring.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586G - Рудольф и шахматы

We are given an 8 by 8 chessboard where some cells are marked as possible destinations of a single unknown chess move.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586F - Рудольф и кроличьи норы

We are given a tree of caves. Each cave contains some number of balls. A character starts at a fixed cave and walks through the tree toward a leaf, but at every junction he chooses the next unvisited edge uniformly at random.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586E - Рудольф и коктейли

We are given several independent test cases. In each one, there is an array of small integers arranged in a line. Each number represents an ingredient, and any cocktail is formed by choosing a contiguous segment of this array.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586D - Рудольф и выпекание булочек

We are given a production system that bakes pastries using two types of machines. The first machine is special because it has a built-in fatigue cycle: it bakes one item every fixed amount of time, but after producing a fixed batch size, it must rest for a fixed cooldown…

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586B - Рудольф и сообщения

We are given a short message split into words, and we want to decide whether the special keyword “codecup” could have appeared somewhere in that message after transmission errors. The key detail is the error model.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586C - Рудольф и квадратики

We are given a sorted list of task completion times measured in minutes from the start of training. Each time corresponds to when a single task was solved. These timestamps can be converted into calendar days by grouping every 1440 minutes into a day bucket.

Practice › Codeforces Solutions › Codemasters Codecup 2023 - Отборочный тур ›

CF 104586A - Рудольф и ягоды

We are told that all berries were originally packed into identical jars, and every jar contains the same number of berries. Each jar contains only one type of berry.