onlyblues

摘要： G2. Light Bulbs (Hard Version) The easy and hard versions of this problem differ only in the constraints on $n$. In the hard version, the sum of value 阅读全文

摘要： E. Physical Education Lessons This year Alex has finished school, and now he is a first-year student of Berland State University. For him it was a tot 阅读全文

摘要： D. Array Collapse You are given an array $[p_1, p_2, \dots, p_n]$, where all elements are distinct. You can perform several (possibly zero) operations 阅读全文

摘要： D. Cyclic MEX For an array $a$, define its cost as $\sum_{i=1}^{n} \operatorname{mex} ^\dagger ([a_1,a_2,\ldots,a_i])$. You are given a permutation$^\ 阅读全文

摘要： C - Not So Consecutive Problem Statement You are given an integer $N$. An integer sequence $x=(x_1,x_2,\cdots,x_N)$ of length $N$ is called a good seq 阅读全文

摘要： F - Random Update Query Problem Statement You are given an integer sequence $A = (A_1, A_2, \ldots, A_N)$ of length $N$. We will perform the following 阅读全文

摘要： E - Lucky bag Problem Statement AtCoder Inc. sells merchandise on its online shop. There are $N$ items remaining in the company. The weight of the $i$ 阅读全文

摘要： [HNOI2009] 梦幻布丁 题目描述 $n$ 个布丁摆成一行，进行 $m$ 次操作。每次将某个颜色的布丁全部变成另一种颜色的，然后再询问当前一共有多少段颜色。 例如，颜色分别为 $1,2,2,1$ 的四个布丁一共有 $3$ 段颜色. 输入格式 第一行是两个整数，分别表示布丁个数 $n$ 和操作次 阅读全文

摘要： G. Lights In the end of the day, Anna needs to turn off the lights in the office. There are $n$ lights and $n$ light switches, but their operation sch 阅读全文

摘要： E. Good Triples Given a non-negative integer number $n$ ($n \ge 0$). Let's say a triple of non-negative integers $(a, b, c)$ is good if $a + b + c = n 阅读全文