随笔分类 - Codeforces
摘要：E. Klever Permutation You are given two integers $n$ and $k$ ($k \le n$), where $k$ is even. A permutation of length $n$ is an array consisting of $n$
阅读全文
摘要：G. Paint Charges A horizontal grid strip of $n$ cells is given. In the $i$-th cell, there is a paint charge of size $a_i$. This charge can be: either
阅读全文
摘要：C. Did We Get Everything Covered? You are given two integers $n$ and $k$ along with a string $s$. Your task is to check whether all possible strings o
阅读全文
摘要：D. Good Trip There are $n$ children in a class, $m$ pairs among them are friends. The $i$-th pair who are friends have a friendship value of $f_i$. Th
阅读全文
摘要：D. Blocking Elements You are given an array of numbers $a_1, a_2, \ldots, a_n$. Your task is to block some elements of the array in order to minimize
阅读全文
摘要：G. Mischievous Shooter Once the mischievous and wayward shooter named Shel found himself on a rectangular field of size $n \times m$, divided into uni
阅读全文
摘要：F1. Smooth Sailing (Easy Version) The only difference between the two versions of this problem is the constraint on $q$. You can make hacks only if bo
阅读全文
摘要：D. Array Repetition Jayden has an array $a$ which is initially empty. There are $n$ operations of two types he must perform in the given order. Jayden
阅读全文
摘要：F. Sum of Progression You are given an array $a$ of $n$ numbers. There are also $q$ queries of the form $s, d, k$. For each query $q$, find the sum of
阅读全文
摘要：E. Happy Life in University Egor and his friend Arseniy are finishing school this year and will soon enter university. And since they are very respons
阅读全文
摘要：G. Bicycles All of Slavic's friends are planning to travel from the place where they live to a party using their bikes. And they all have a bike excep
阅读全文
摘要：E2. Game with Marbles (Hard Version) The easy and hard versions of this problem differ only in the constraints on the number of test cases and $n$. In
阅读全文
摘要：C. Heavy Intervals You have $n$ intervals $[l_1, r_1], [l_2, r_2], \dots, [l_n, r_n]$, such that $l_i < r_i$ for each $i$, and all the endpoints of th
阅读全文
摘要：D. Yet Another Inversions Problem You are given a permutation $p_0, p_1, \ldots, p_{n-1}$ of odd integers from $1$ to $2n-1$ and a permutation $q_0, q
阅读全文
摘要：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$^\
阅读全文
摘要：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
阅读全文
浙公网安备 33010602011771号