Командный турнир для школьников по программированию

13 problems from Командный турнир для школьников по программированию (contest 105864), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Командный турнир для школьников по программированию

Special | 13 problems | 13/13 verified | Difficulty - | 12m 18s

#	Problem	Time	✓
A	\u041a\u0440\u043e\u0441\u0441\u0432\u043e\u0440\u0434	55s	✓
B	\u041f\u043e\u0445\u043e\u0434 \u0432 \u043c\u0430\u0433\u0430\u0437\u0438\u043d	1m	✓
C	\u041a\u043e\u0444\u0435\u0431\u043e\u043b	53s	✓
D	\u0425\u043e\u0440\u043e\u0448\u0438\u0435 \u0440\u0430\u0441\u043a\u0440\u0430\u0441\u043a\u0438 6	57s	✓
E	\u0414\u043b\u0438\u043d\u043d\u044b\u0439 \u043e\u0441\u0442\u0440\u043e\u0432	56s	✓
F	\u0425\u0435\u0448\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435	57s	✓
G	\u041b\u0438\u0441\u0438\u0446\u0430 \u043d\u0430 \u0434\u0440\u0435\u0432\u0435	1m 22s	✓
H	\u0427\u0435\u0440\u0435\u043f\u0430\u0448\u043a\u0430	47s	✓
I	\u0412\u043e\u0440\u043e\u043d\u0435\u0436\u0438\u043d\u0438 \u0436\u0438\u0432\u043e\u0442\u043d\u0438\u043d\u0438	51s	✓
J	\u0420\u043e\u0431\u043e\u0442\u044b \u0432 \u043f\u0435\u0449\u0435\u0440\u0435	54s	✓
K	\u041c\u0435\u0434\u0438\u0430\u043d\u044b 1	55s	✓
L	\u041c\u0435\u0434\u0438\u0430\u043d\u044b 2	58s	✓
M	\u0422\u0443\u0440\u043d\u0438\u0440 \u043f\u043e\u043a\u0435\u043c\u043e\u043d\u043e\u0432	53s	✓

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864C - Кофебол

We are given a list of athletes, each with a strength value, and a sorted list of coffee cups, each with an increasing strength requirement. A cup can only be drunk by an athlete whose strength is at least the cup’s requirement.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864M - Турнир покемонов

We are given a collection of pokémons, each described by two numbers: its initial strength and its price. We are allowed to pick exactly one pokémon as our champion before the tournament starts.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864L - Медианы 2

We are given two arrays of the same odd length, and every value appearing in either array is unique globally. Because of this uniqueness, sorting each array produces a well-defined ordering with no ties, and the median is simply the element at position $(n+1)/2$.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864J - Роботы в пещере

We are given a one-dimensional cave split into n vertical columns. Each column has a ceiling height h[i]. Over time, the ceiling in every column drops uniformly: at each second, every positive height decreases by one.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864I - Воронежини животнини

We are given a permutation of numbers from 1 to n, but it is hidden. Instead of the permutation itself, we only know a derived array of length n − 1 where each value is the maximum of two consecutive elements in that hidden permutation.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864H - Черепашка

We are given a length $n$ array, and from it we build an $n times n$ grid where every row is a cyclic shift of the previous one. The first row is the array itself, and each next row shifts all elements one position to the left, wrapping the first element to the end.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864G - Лисица на древе

We are given a tree, meaning a connected graph with no cycles. Two special vertices are marked, a starting point $s$ and a target $t$. A fox moves on this tree, but its movement rules are stronger than normal adjacency.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864E - Длинный остров

We are working on a dynamic grid where each cell stores an integer height. A cell is considered land only if its current height is strictly positive. Connectivity is defined in the usual grid sense, where movement is allowed only between cells sharing a side.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

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

We are given a very large grid that is never explicitly revealed. Each cell of this grid is painted with one of three colors, and we are guaranteed that no two side-adjacent cells share the same color.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864A - Кроссворд

We are given four short lowercase strings and need to determine whether it is possible to place all of them into a fixed grid as two horizontal words and two vertical words.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864K - Медианы 1

We are given two arrays of the same odd length, and every number appearing anywhere in the input is globally unique. The only operation allowed is to pick an index and swap the elements of the two arrays at that position.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864F - Хеширование

We are given a sequence of integers and a fixed way of turning any contiguous segment into a number using a rolling base.

Practice › Codeforces Solutions › Командный турнир для школьников по программированию ›

CF 105864B - Поход в магазин

We are given a line of $n$ people, each holding some number of identical items. The total number of items is divisible by $n$, so there is a well-defined target value: everyone must end up with exactly $s/n$ items. Initially, the distribution is $a1, a2, dots, an$.