摘要：
D2. Dances (Hard Version) This is the hard version of the problem. The only difference is that in this version $m \leq 10^9$. You are given two arrays 阅读全文
摘要：
B. Raspberries You are given an array of integers $a_1, a_2, \ldots, a_n$ and a number $k$ ($2 \leq k \leq 5$). In one operation, you can do the follo 阅读全文
摘要：
C. Medium Design The array $a_1, a_2, \ldots, a_m$ is initially filled with zeroes. You are given $n$ pairwise distinct segments $1 \le l_i \le r_i \l 阅读全文