VIII Липецкая командная олимпиада школьников по программированию. Финал
12 problems from VIII Липецкая командная олимпиада школьников по программированию. Финал (contest 104316), difficulty -. 12/12 solutions verified against sample I/O.
VIII Липецкая командная олимпиада школьников по программированию. Финал
Special | 12 problems | 12/12 verified | Difficulty - | 12m 33s
CF 104316L - Новое имя Юры
We are given a string built from only two characters, a caret and an underscore. We are allowed to insert additional characters anywhere in the string, but we are not allowed to delete or reorder existing ones.
CF 104316J - Мясник
We are given a multiset of axis-aligned rectangles with fixed orientation. Each rectangle has a height and a width, and no rotation is allowed, meaning a rectangle (a, b) is distinct from (b, a) unless both coordinates are equal.
CF 104316K - Миша и яблоки
We are given several independent scenarios. In each scenario there are n shops visited in order, and there are m possible apple types. Each shop may contain some subset of apple types.
CF 104316I - Досмотр перед вылетом
We are given an array of integers and we want to compute the maximum possible subarray sum, but with one extra freedom: before choosing the subarray, we are allowed to reverse at most one contiguous segment of the array.
CF 104316H - Дороги в Ельце
We are given an undirected multigraph with up to 2000 vertices and 2000 edges. Each edge has an identity from 1 to m. A hidden subset of these edges is “good” (repaired roads), and this subset is fixed for the entire interaction.
CF 104316G - Конструктивная задача
We are given an array of nonnegative integers. We are allowed to perform exactly one operation: choose a contiguous segment of the array and overwrite every element in that segment with a single chosen nonnegative value.
CF 104316F - Лисица и полный обход древа
We are given a tree, meaning a connected graph with no cycles. A fox starts at some vertex and can move in a single jump using an unusual rule: from a vertex v, it may jump to a vertex u either if there is an edge directly connecting them, or if there exists some intermediate…
CF 104316E - Реклама
We have two rows of points aligned above and below a single horizontal street. At each integer position $i$ from 1 to $n$, there is a café on the upper side with weight $ai$ and a café on the lower side with weight $bi$.
CF 104316D - Тяп-ляп, фигак, в релиз!
We are working with strings of fixed length n, but the real object of interest is not a single string. Instead, we maintain a dynamic set of strings over the alphabet {a, b, c, d}. Each update either inserts a string into the set or removes it.
CF 104316C - Невероятные приключения ДжоДжо
We are given a binary string and we build a square matrix whose rows are all cyclic shifts of that string. Row zero is the string itself, row one is shifted right by one position, row two is shifted right by two positions, and so on until row n minus one.
CF 104316A - Блинские перестановки...
We are given a system of $n$ positions, each initially holding a student. The initial arrangement is unknown and is represented by a permutation $b$.
CF 104316B - Очередная задача про запросы на дереве
We are given a rooted tree with root fixed at vertex 1. Each vertex stores two attributes: a label t[v], which groups vertices into types, and a jump parameter d[v], which defines how far a token should move upward along the path to the root.