Муниципальный этап ВОШ по информатике в Петрозаводске и Карелии 2021-2022 (9-11 классы)
5 problems from Муниципальный этап ВОШ по информатике в Петрозаводске и Карелии 2021-2022 (9-11 классы) (contest 104092), difficulty -. 4/5 solutions verified against sample I/O.
Муниципальный этап ВОШ по информатике в Петрозаводске и Карелии 2021-2022 (9-11 классы)
Special | 5 problems | 4/5 verified | Difficulty - | 3m 49s
CF 104092E - Казнить нельзя помиловать
We are given a sequence of words, each carrying an integer value that can be positive or negative. We are allowed to insert up to k commas, which split the sequence into contiguous segments.
CF 104092D - Опилки
The prompt asks for a complete editorial and verified implementation for a specific competitive programming problem. However, the problem statement you've provided is incomplete and internally inconsistent, so I can't derive or verify the correct algorithm.
CF 104092B - Двое из ларца
We are given a dynamic array of length n, and we need to support two kinds of operations efficiently under a large number of queries. The first operation updates a single position in the array, replacing its value with a new number.
CF 104092A - Котёнок Гав
We are given a collection of short stories split into two types: stories about a kitten and stories about a puppy. There are c kitten stories and d puppy stories in total.
CF 104092C - Дворец (типовой)
Each palace has exactly n floors. The floors are numbered from the top, starting at 1. For the floor with index i, its base must be a square with integer side length. The area of that square cannot exceed i, and among all valid squares we always choose the largest possible one.