Codeforces - 随笔分类(第4页) - onlyblues

摘要：C. Heavy Intervals You have

n

$n$ intervals

[l_{1}, r_{1}], [l_{2}, r_{2}], \dots, [l_{n}, r_{n}]

$[l_1, r_1], [l_2, r_2], \dots, [l_n, r_n]$ , such that

l_{i} < r_{i}

$l_i < r_i$ for each

i

$i$ , and all the endpoints of th 阅读全文

posted @ 2023-12-27 22:38 onlyblues 阅读(64) 评论(0) 推荐(0) 编辑

D. Yet Another Inversions Problem

摘要：D. Yet Another Inversions Problem You are given a permutation

p_{0}, p_{1}, \dots, p_{n - 1}

$p_0, p_1, \ldots, p_{n-1}$ of odd integers from

1

$1$ to

2 n - 1

$2n-1$ and a permutation $q_0, q 阅读全文

posted @ 2023-12-26 23:23 onlyblues 阅读(59) 评论(0) 推荐(0) 编辑

G2. Light Bulbs (Hard Version)

摘要：G2. Light Bulbs (Hard Version) The easy and hard versions of this problem differ only in the constraints on

n

$n$ . In the hard version, the sum of value 阅读全文

posted @ 2023-12-24 21:30 onlyblues 阅读(111) 评论(0) 推荐(0) 编辑

E. Physical Education Lessons

摘要：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 阅读全文

posted @ 2023-12-22 17:02 onlyblues 阅读(11) 评论(0) 推荐(0) 编辑

D. Array Collapse

摘要：D. Array Collapse You are given an array

[p_{1}, p_{2}, \dots, p_{n}]

$[p_1, p_2, \dots, p_n]$ , where all elements are distinct. You can perform several (possibly zero) operations 阅读全文

posted @ 2023-12-19 20:20 onlyblues 阅读(139) 评论(0) 推荐(0) 编辑

D. Cyclic MEX

摘要：D. Cyclic MEX For an array

a

$a$ , define its cost as

\sum_{i = 1}^{n} {mex}^{†} ([a_{1}, a_{2}, \dots, a_{i}])

$\sum_{i=1}^{n} \operatorname{mex} ^\dagger ([a_1,a_2,\ldots,a_i])$ . You are given a permutation$^\ 阅读全文

posted @ 2023-12-18 19:58 onlyblues 阅读(89) 评论(0) 推荐(2) 编辑

G. Lights

摘要：G. Lights In the end of the day, Anna needs to turn off the lights in the office. There are

n

$n$ lights and

n

$n$ light switches, but their operation sch 阅读全文

posted @ 2023-12-08 15:37 onlyblues 阅读(69) 评论(0) 推荐(1) 编辑

E. Good Triples

摘要：E. Good Triples Given a non-negative integer number

n

$n$ (

n \geq 0

$n \ge 0$ ). Let's say a triple of non-negative integers

(a, b, c)

$(a, b, c)$ is good if $a + b + c = n 阅读全文

posted @ 2023-12-07 18:49 onlyblues 阅读(85) 评论(0) 推荐(0) 编辑

D. Robot Queries

摘要：D. Robot Queries There is an infinite

2

$2$ -dimensional grid. Initially, a robot stands in the point

(0, 0)

$(0, 0)$ . The robot can execute four commands: U — 阅读全文

posted @ 2023-12-04 20:56 onlyblues 阅读(112) 评论(0) 推荐(0) 编辑

E. Permutation Sorting

摘要：E. Permutation Sorting You are given a permutation

^{†}

$^\dagger$

a

$a$ of size

n

$n$ . We call an index

i

$i$ good if

a_{i} = i

$a_i=i$ is satisfied. After each second, we 阅读全文

posted @ 2023-12-01 18:00 onlyblues 阅读(11) 评论(0) 推荐(0) 编辑

D2. Xor-Subsequence (hard version)

摘要：D2. Xor-Subsequence (hard version) It is the hard version of the problem. The only difference is that in this version

a_{i} \leq 10^{9}

$a_i \le 10^9$ . You are given an 阅读全文

posted @ 2023-11-29 17:40 onlyblues 阅读(12) 评论(0) 推荐(0) 编辑

D1. Xor-Subsequence (easy version)

摘要：D1. Xor-Subsequence (easy version) It is the easy version of the problem. The only difference is that in this version

a_{i} \leq 200

$a_i \le 200$ . You are given an 阅读全文

posted @ 2023-11-29 16:21 onlyblues 阅读(13) 评论(0) 推荐(0) 编辑

D. Small GCD

摘要：D. Small GCD Let

a

$a$ ,

b

$b$ , and

c

$c$ be integers. We define function

f (a, b, c)

$f(a, b, c)$ as follows: Order the numbers

a

$a$ ,

b

$b$ ,

c

$c$ in such a way that $a \le 阅读全文

posted @ 2023-11-27 18:30 onlyblues 阅读(211) 评论(1) 推荐(1) 编辑

D. Ones and Twos

摘要：D. Ones and Twos You are given a

1

$1$ -indexed array

a

$a$ of length

n

$n$ where each element is

1

$1$ or

2

$2$ . Process

q

$q$ queries of the following two types: 阅读全文

posted @ 2023-11-26 21:17 onlyblues 阅读(33) 评论(0) 推荐(0) 编辑

D. Letter Picking

摘要：D. Letter Picking Alice and Bob are playing a game. Initially, they are given a non-empty string

s

$s$ , consisting of lowercase Latin letters. The lengt 阅读全文

posted @ 2023-11-25 14:19 onlyblues 阅读(6) 评论(0) 推荐(0) 编辑

F. A Growing Tree

摘要：F. A Growing Tree You are given a rooted tree with the root at vertex

1

$1$ , initially consisting of a single vertex. Each vertex has a numerical value, 阅读全文

posted @ 2023-11-22 15:04 onlyblues 阅读(31) 评论(0) 推荐(1) 编辑

D. Absolute Beauty

摘要：D. Absolute Beauty Kirill has two integer arrays

a_{1}, a_{2}, \dots, a_{n}

$a_1,a_2,\ldots,a_n$ and

b_{1}, b_{2}, \dots, b_{n}

$b_1,b_2,\ldots,b_n$ of length

n

$n$ . He defines the absolute beauty of the ar 阅读全文

posted @ 2023-11-21 18:27 onlyblues 阅读(27) 评论(0) 推荐(0) 编辑

G. Unusual Entertainment

摘要：G. Unusual Entertainment A tree is a connected graph without cycles. A permutation is an array consisting of

n

$n$ distinct integers from

1

$1$ to

n

$n$ in 阅读全文

posted @ 2023-11-21 09:55 onlyblues 阅读(45) 评论(1) 推荐(1) 编辑

D. Score of a Tree

摘要：D. Score of a Tree You are given a tree of

n

$n$ nodes, rooted at

1

$1$ . Every node has a value of either

0

$0$ or

1

$1$ at time

t = 0

$t=0$ . At any integer time $t 阅读全文

posted @ 2023-11-14 16:35 onlyblues 阅读(13) 评论(0) 推荐(0) 编辑

D. Counting Factorizations

摘要：D. Counting Factorizations The prime factorization of a positive integer

m

$m$ is the unique way to write it as $\displaystyle m=p_1^{e_1}\cdot p_2^{e_2 阅读全文

posted @ 2023-11-13 20:04 onlyblues 阅读(11) 评论(0) 推荐(0) 编辑

onlyblues

随笔分类 - Codeforces

公告

搜索

常用链接

随笔分类

随笔档案

阅读排行榜

推荐排行榜

最新评论