随笔分类 -  codeforces

Unusual Matrix
摘要：Unusual Matrix You are given two binary square matrices a and b of size n×n. A matrix is called binary if each of its elements is equal to 0 or 1. You 阅读全文
posted @ 2021-01-26 19:24 肆之月 阅读(117) 评论(0) 推荐(0)
cf-Three Bags
摘要：C. Three Bags You are given three bags. Each bag contains a non-empty multiset of numbers. You can perform a number of operations on these bags. In on 阅读全文
posted @ 2021-01-09 12:19 肆之月 阅读(149) 评论(0) 推荐(0)
Ceil Divisions
摘要：D. Ceil Divisions You have an array $a_1,a_2,…,a_n$where ai=i. In one step, you can choose two indices x and y (x≠y) and set \(a_x=\lceil{\frac{a_x}{a 阅读全文
posted @ 2020-12-30 23:35 肆之月 阅读(149) 评论(0) 推荐(0)
Regular Bracket Sequence
摘要：A. Regular Bracket Sequence A bracket sequence is called regular if it is possible to obtain correct arithmetic expression by inserting characters + a 阅读全文
posted @ 2020-12-30 22:48 肆之月 阅读(376) 评论(0) 推荐(0)
Messenger Simulator
摘要：CF-E. Messenger Simulator Polycarp is a frequent user of the very popular messenger. He's chatting with his friends all the time. He has n friends, nu 阅读全文
posted @ 2020-12-19 23:07 肆之月 阅读(177) 评论(0) 推荐(0)
Domino for Young
摘要：D. Domino for Young You are given a Young diagram. Given diagram is a histogram with n columns of lengths \(a_1,a_2,…,a_n (a_1≥a_2≥…≥a_n≥1).\) Young d 阅读全文
posted @ 2020-12-19 23:05 肆之月 阅读(98) 评论(0) 推荐(0)
Cards
摘要：Team Work You have a team of N people. For a particular task, you can pick any non-empty subset of people. The cost of having x people for the task is 阅读全文
posted @ 2020-12-19 23:02 肆之月 阅读(612) 评论(0) 推荐(0)
Berry Jam
摘要：C. Berry Jam Karlsson has recently discovered a huge stock of berry jam jars in the basement of the house. More specifically, there were 2n jars of st 阅读全文
posted @ 2020-12-19 23:01 肆之月 阅读(111) 评论(0) 推荐(0)
Antenna Coverage
摘要：Antenna Coverage 给定若n个区间,每次操作可以使一个区间左右拓宽1,求最小操作次数使得区间[1,m]均被覆盖. 考虑dp: dp[i]=区间[i,m]均被覆盖的最小花费 转移: \(dp[i]=dp[i+1]\),如果$[1,i]$被原始区间覆盖. 否则,\(p=l-i,dp[i]= 阅读全文
posted @ 2020-12-19 22:57 肆之月 阅读(26) 评论(0) 推荐(0)