2023-2024 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 23, Саратовский отборочный этап)
13 problems from 2023-2024 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 23, Саратовский…
2023-2024 Всероссийская командная олимпиада школьников по программированию, региональный этап Саратовской области (ВКОШП 23, Саратовский отборочный этап)
Special | 13 problems | 13/13 verified | Difficulty - | 11m 51s
CF 104778A - Треугольник
We are given three positive integers that represent the lengths of three rigid segments. In one move, we are allowed to pick any one segment and change its length by exactly one unit, either increasing or decreasing it, as long as the segment remains positive after the change.
CF 104778L - Сжатие графа
We are given a simple undirected graph with up to 2000 vertices, represented by its adjacency matrix. From this graph, we must choose exactly k distinct vertices. After choosing them, we remove these vertices and replace them with a single new vertex V.
CF 104778M - Чередующаяся раскраска
We are given a binary string that changes over time through single-character flips. Alongside these updates, we are repeatedly asked a structural question about any substring: how many colors are needed to assign to its characters so that each color class, when read in…
CF 104778K - Еще одна точка
We are given a set of points on a number line. We are allowed to place one additional point anywhere on the integer line, including negative positions. For this chosen point $x$, we compute the sum of absolute distances from $x$ to all existing points.
CF 104778J - Твоя игра
We are given a sequence of questions, each with a nonzero value. Positive values represent questions Polycarp can answer correctly, while negative values represent questions he cannot answer correctly. The game produces a score starting from zero.
CF 104778I - Ничья
We are given a football season consisting of $n$ matches. Each match ends in exactly one of three outcomes: a win, a draw, or a loss. A win gives $k$ points, a draw gives 1 point, and a loss gives 0 points.
CF 104778H - Удаление букв
We are given a string made of lowercase letters. The string can be thought of as a sequence of maximal consecutive blocks, where each block consists of identical characters. For example, in aabbbbccc, the blocks are aa, bbbb, and ccc.
CF 104778G - Одинаковые части
We are given a string of lowercase letters. We must remove exactly k positions, but with a strict rule: no two removed positions can be adjacent in the original string.
CF 104778F - Ящики
We start with a row of n initial stacks of boxes. Each stack i contains ai boxes. Between every adjacent pair of initial stacks, we insert a new empty stack, so the layout becomes an alternating sequence of original and new stacks: original, new, original, new, and so on.
CF 104778D - Конструктив с инверсиями
We are asked to construct a permutation of length $n$, meaning an arrangement of numbers from $1$ to $n$ with no repetitions, such that exactly $k$ elements are involved in at least one inversion.
CF 104778E - Волшебная книга
We are given a very large book with pages numbered from 1 to n. We choose a starting page x and then read every page from x through n inclusive. Each page has a number, and we only care about the last digit of that number.
CF 104778B - Баскетбол
We are given a sequence of distances for successful basketball shots. Each shot contributes points depending on a threshold value d that we choose. If a shot distance is strictly less than d, that shot is worth 2 points.
CF 104778C - Две последовательности
We are given two arrays of integers of equal length. Each position i defines a “constraint interval”, but the interval is unordered: the valid range for a candidate integer x at index i is simply the segment between ai and bi, regardless of which one is larger.