随笔分类 -  Codeforces

上一页 1 2 3 4 5 6 7 8 ··· 10 下一页
摘要:C. Heavy Intervals You have n intervals [l1,r1],[l2,r2],,[ln,rn], such that li<ri for each i, and all the endpoints of th 阅读全文
posted @ 2023-12-27 22:38 onlyblues 阅读(65) 评论(0) 推荐(0) 编辑
摘要:D. Yet Another Inversions Problem You are given a permutation p0,p1,,pn1 of odd integers from 1 to 2n1 and a permutation $q_0, q 阅读全文
posted @ 2023-12-26 23:23 onlyblues 阅读(60) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2023-12-24 21:30 onlyblues 阅读(112) 评论(0) 推荐(0) 编辑
摘要: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 阅读(12) 评论(0) 推荐(0) 编辑
摘要:D. Array Collapse You are given an array [p1,p2,,pn], where all elements are distinct. You can perform several (possibly zero) operations 阅读全文
posted @ 2023-12-19 20:20 onlyblues 阅读(140) 评论(0) 推荐(0) 编辑
摘要:D. Cyclic MEX For an array a, define its cost as i=1nmex([a1,a2,,ai]). You are given a permutation$^\ 阅读全文
posted @ 2023-12-18 19:58 onlyblues 阅读(90) 评论(0) 推荐(2) 编辑
摘要: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 阅读全文
posted @ 2023-12-08 15:37 onlyblues 阅读(70) 评论(0) 推荐(1) 编辑
摘要:E. Good Triples Given a non-negative integer number n (n0). Let's say a triple of non-negative integers (a,b,c) is good if $a + b + c = n 阅读全文
posted @ 2023-12-07 18:49 onlyblues 阅读(86) 评论(0) 推荐(0) 编辑
摘要:D. Robot Queries There is an infinite 2-dimensional grid. Initially, a robot stands in the point (0,0). The robot can execute four commands: U — 阅读全文
posted @ 2023-12-04 20:56 onlyblues 阅读(113) 评论(0) 推荐(0) 编辑
摘要:E. Permutation Sorting You are given a permutation a of size n. We call an index i good if ai=i is satisfied. After each second, we 阅读全文
posted @ 2023-12-01 18:00 onlyblues 阅读(12) 评论(0) 推荐(0) 编辑
摘要:D2. Xor-Subsequence (hard version) It is the hard version of the problem. The only difference is that in this version ai109. You are given an 阅读全文
posted @ 2023-11-29 17:40 onlyblues 阅读(13) 评论(0) 推荐(0) 编辑
摘要:D1. Xor-Subsequence (easy version) It is the easy version of the problem. The only difference is that in this version ai200. You are given an 阅读全文
posted @ 2023-11-29 16:21 onlyblues 阅读(14) 评论(0) 推荐(0) 编辑
摘要:D. Small GCD Let a, b, and c be integers. We define function f(a,b,c) as follows: Order the numbers a, b, c in such a way that $a \le 阅读全文
posted @ 2023-11-27 18:30 onlyblues 阅读(211) 评论(1) 推荐(1) 编辑
摘要:D. Ones and Twos You are given a 1-indexed array a of length n where each element is 1 or 2. Process q queries of the following two types: 阅读全文
posted @ 2023-11-26 21:17 onlyblues 阅读(33) 评论(0) 推荐(0) 编辑
摘要:D. Letter Picking Alice and Bob are playing a game. Initially, they are given a non-empty string s, consisting of lowercase Latin letters. The lengt 阅读全文
posted @ 2023-11-25 14:19 onlyblues 阅读(7) 评论(0) 推荐(0) 编辑
摘要:F. A Growing Tree You are given a rooted tree with the root at vertex 1, initially consisting of a single vertex. Each vertex has a numerical value, 阅读全文
posted @ 2023-11-22 15:04 onlyblues 阅读(32) 评论(0) 推荐(1) 编辑
摘要:D. Absolute Beauty Kirill has two integer arrays a1,a2,,an and b1,b2,,bn of length n. He defines the absolute beauty of the ar 阅读全文
posted @ 2023-11-21 18:27 onlyblues 阅读(28) 评论(0) 推荐(0) 编辑
摘要:G. Unusual Entertainment A tree is a connected graph without cycles. A permutation is an array consisting of n distinct integers from 1 to n in 阅读全文
posted @ 2023-11-21 09:55 onlyblues 阅读(46) 评论(1) 推荐(1) 编辑
摘要:D. Score of a Tree You are given a tree of n nodes, rooted at 1. Every node has a value of either 0 or 1 at time t=0. At any integer time $t 阅读全文
posted @ 2023-11-14 16:35 onlyblues 阅读(14) 评论(0) 推荐(0) 编辑
摘要:D. Counting Factorizations The prime factorization of a positive integer 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 阅读(12) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 7 8 ··· 10 下一页
Web Analytics
点击右上角即可分享
微信分享提示