VII Липецкая командная олимпиада школьников по программированию. Финал. 3-7 классы
7 problems from VII Липецкая командная олимпиада школьников по программированию. Финал. 3-7 классы (contest 103720), difficulty -. 4/7 solutions verified against sample I/O.
VII Липецкая командная олимпиада школьников по программированию. Финал. 3-7 классы
Special | 7 problems | 4/7 verified | Difficulty - | 5m 27s
CF 103720G - Множество с запросами
We maintain a dynamic set of positive integers. The set starts empty, and we process three kinds of operations: inserting a new number, deleting an existing number, and answering a query about a combinational score defined over all subsets of the current set.
CF 103720F - База отдыха
We are managing a line of N numbered cottages, initially all empty. Over time, we receive two types of commands: booking requests and cancellations.
CF 103720D - День рождения
We are given three piles of candies. Two of the piles are guaranteed to start with the same size, while the third may differ. Two players alternate turns.
CF 103720E - Максимизируй AND
Let $f$ be a Boolean function of variables $x1,dots,xn$ and let $g$ be obtained from $f$ by the condensation $x{k+1} leftarrow xk$. Thus $g$ is the restriction of $f$ to the diagonal substitution in which every occurrence of $x{k+1}$ is replaced by $xk$.
CF 103720C - Неправильная яблоня
We are given three sorted sequences of positive integers. Each sequence represents the heights of saplings loaded in a separate truck, and within each truck the saplings are already sorted in non-decreasing order.
CF 103720A - Диагональный прямоугольник
Let $f$ be a Boolean function of variables $x1,dots,xn$ and let $g$ be obtained from $f$ by the condensation $x{k+1} leftarrow xk$. Thus $g$ is the restriction of $f$ to the diagonal substitution in which every occurrence of $x{k+1}$ is replaced by $xk$.