随笔分类 - Codeforces
摘要：E. Expected Power You are given an array of $n$ integers $a_1,a_2,\ldots,a_n$. You are also given an array $p_1, p_2, \ldots, p_n$. Let $S$ denote the
阅读全文
摘要：C2. Adjust The Presentation (Hard Version) This is the hard version of the problem. In the two versions, the constraints on $q$ and the time limit are
阅读全文
摘要：G2. Yunli's Subarray Queries (hard version) This is the hard version of the problem. In this version, it is guaranteed that $r \geq l+k-1$ for all que
阅读全文
摘要：H. Sakurako's Test Sakurako will soon take a test. The test can be described as an array of integers $n$ and a task on it: Given an integer $x$, Sakur
阅读全文
摘要：D2. Turtle and a MEX Problem (Hard Version) The two versions are different problems. In this version of the problem, you can't choose the same integer
阅读全文
摘要：E. Not a Nim Problem Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with the $i$-th pile initially containing $a_i$ st
阅读全文
摘要：H. Ksyusha and the Loaded Set Ksyusha decided to start a game development company. To stand out among competitors and achieve success, she decided to
阅读全文
摘要：D. Med-imize Given two positive integers $n$ and $k$, and another array $a$ of $n$ integers. In one operation, you can select any subarray of size $k$
阅读全文
摘要：E. Level Up Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight $n$ monsters, in order from $1$ to $n$. The
阅读全文
摘要：G. Penacony On Penacony, The Land of the Dreams, there exists $n$ houses and $n$ roads. There exists a road between house $i$ and $i+1$ for all $1 \le
阅读全文
摘要：E. Wooden Game You are given a forest of $k$ rooted trees$^{\text{∗}}$. Lumberjack Timofey wants to cut down the entire forest by applying the followi
阅读全文
摘要：D. The Omnipotent Monster Killer You, the monster killer, want to kill a group of monsters. The monsters are on a tree with $n$ vertices. On vertex wi
阅读全文
摘要：G2. Permutation Problem (Hard Version) This is the hard version of the problem. The only difference is that in this version $n \leq 5 \cdot 10^5$ and
阅读全文
摘要：C2. Magnitude (Hard Version) The two versions of the problem are different. You may want to read both versions. You can make hacks only if both versio
阅读全文
摘要：G. Yasya and the Mysterious Tree Yasya was walking in the forest and accidentally found a tree with $n$ vertices. A tree is a connected undirected gra
阅读全文
摘要：D. Invertible Bracket Sequences A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inser
阅读全文
摘要：D. XORificator You are given a binary (consisting only of 0s and 1s) $n \times m$ matrix. You are also given a XORificator, using which you can invert
阅读全文
摘要：E. Chain Queries You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices are colored white or black. You are asked to p
阅读全文
摘要：F. Cutting Game Alice and Bob were playing a game again. They have a grid of size $a \times b$ ($1 \le a, b \le 10^9$), on which there are $n$ chips,
阅读全文
摘要：E. Unique Array You are given an integer array $a$ of length $n$. A subarray of $a$ is one of its contiguous subsequences (i. e. an array $[a_l, a_{l+
阅读全文
浙公网安备 33010602011771号