cf
天涯-沧海
acmer
展开
-
Codeforces Round #662 (Div. 2) D. Rarity and New Dress
第一二层肯定是1,然后第三场在四个位置都符合要求就是2,然后这么一直往下,第(x,y)的值就是上面四个位置的值的最小值+1(四个位置如下图)(对于最下面的绿色的d来说,红色圈的就是它的四个位置)Carousel Boutique is busy again! Rarity has decided to visit the pony ball and she surely needs a new dress, because going out in the same dress s...原创 2020-08-09 00:33:23 · 219 阅读 · 0 评论 -
cf888G 完全图上最小生成树
这题思想就是boruka具体就是我们从最高位来看,我们可以按照二进制最高位是0还是1来把数分为两块,他们内部各自进行连边形成最小生成树,然后这两个部分再连边,因为这样只会有一条最高位是1的边,如果我们让多个01对连边,那么会形成多条最高位权值是1的边,这明显会使结果更差,然后次高位及以下也如此处理。。在操作上就是我们先把每个点的权值插入到01字典树,从最高位开始分治,在0和1这两个左右子树,它们首先连边,然后再在左右子树找一个点对,他们异或值要最小,为了让异或值最小,我们在左右子树向下找的时候,每.原创 2020-07-26 22:30:54 · 547 阅读 · 0 评论 -
(优先队列)CodeForces 91B Queue
这题感觉其他博客大几十行的做法好麻烦啊,啥单调栈上二分和线段树,没必要这么麻烦这题题意就是找离第i个数最远且小于a[i]的数在哪,这直接上优先队列,把每个数和它的位置先存到优先队列里,优先队列大的在顶端,然后从后往前找,如果队列顶端的数比a[i]大,那a[i]就是和它配对的数,然后弹出队列顶,(如果这个队列顶端的数位置在i后面,那说明没有数可以和它匹配,那它的值设成-1,然后直接跳过它)重复操作指导队列顶的数小于等于a[i]#include<stdio.h>#incl...原创 2020-07-21 22:49:16 · 535 阅读 · 0 评论 -
(dp)Educational Codeforces Round 90 (Rated for Div. 2) D Maximum Sum on Even Positions
终于在cf写出了一道正经的dp题,值得庆贺( ̄▽ ̄)~*dp[i]代表以i结尾的长度为偶数的贡献最大的反转区间,贡献是奇数位的和与偶数位的差然后转移方程:奇数就是dp[i]=max(dp[i],dp[i-2]+a[i]-a[i-1]);偶数dp[i]=max(dp[i],dp[i-2]+a[i-1]-a[i]);反转区间长度必为偶数,因为如果是奇数那么相当于没反转,那这么dp为什么能保证都选的是偶数长度的区间呢?dp[0]不选,dp[1]=max(0,dp[1]-dp[0])即dp[1].原创 2020-06-26 19:01:36 · 182 阅读 · 0 评论 -
(并查集)CodeForces 1245D Shichikuji and Power Grid
先每个点连边,边值为(k[i]+k[j])*(abs(b[i].x-b[j].x)+abs(b[i].y-b[j].y)),然后设一个虚点0和每个点连边,边值为c[i],然后跑并查集就好了Shichikuji is the new resident deity of the South Black Snail Temple. Her first job is as follows:There are nnew cities located in Prefecture X. Cities..原创 2020-06-25 14:42:10 · 238 阅读 · 0 评论 -
(贪心)Codeforces Round #652 (Div. 2) E - DeadLee
这题首先每道菜如果够吃,就让吃它的人放到最后只吃这道菜,那对其他菜来说,就少了一些吃它的人,就又能有菜富裕,这样不断进行,如果每道菜都能在某个阶段富裕,那就alive,然后按照存入的顺序倒序输出,否则dead Be careful: there is 50 points penalty for submission which fails the pretests or resubmission (except failure on the first test, denial ...原创 2020-06-24 16:14:20 · 239 阅读 · 0 评论 -
(思维+暴力)CodeForces - 1244 D Paint the Tree
思路:首先可以看出,这个树只能是一条链的形式,如果有分叉,那必然染色会有冲突,所以我们只要枚举前两个点颜色,其他点就都已经确定了,纪录下最小值就好了You are given a tree consisting of nvertices. A tree is an undirected connected acyclic graph. Example of a tree.You have to paint each vertex into one of three colors. F.原创 2020-06-11 15:58:20 · 227 阅读 · 0 评论 -
(并查集)Two Fairs CodeForces - 1276B
这题我一开始想的是缩点,然后a子树去掉有b的子树后假设有x个点,b同理有y个点,x*y就是答案,但是有点难写,我记得去年这场cf打的时候我口胡过一个做法,但现在不太记得去了,就去翻了一下,发现我当时的想法真的好,再看我刚才想的算法,惭愧惭愧这就是我去年的做法,真的妙多了,删掉和ab相连的边,然后用并查集处理下联通块就好了There are n cities in Berland and some pairs of them are connected by two-way roads...原创 2020-06-02 01:22:02 · 189 阅读 · 0 评论 -
CodeForces - 1283D Christmas Trees
思路:这题就是从每个圣诞树左右进行扩展,优先近的点做法:每个点设一个坐标id,扩展方向f(+-1),扩展距离s,把每个点放到优先队列里,按照s小的在顶端,map纪录一下扩展过的点,依次从顶端取点扩展就好了There are n Christmas trees on an infinite number line. The i-th tree grows at the position xi. All xiare guaranteed to be distinct.Each intege..原创 2020-06-01 17:28:11 · 264 阅读 · 0 评论 -
Gym - 101482F Finding Lines
这题做法很简单,随机选两个不相同的点,那就有(1/p)^2的概率这两个点在这条可能的直线上,唯一要注意的是,你随机数不能用rand,会被卡,就是这个卡了我们一个多小时,用mt19937就可以了题目链接#include<bits/stdc++.h>using namespace std;#define ll long longconst int N = 1e5+10;struct Point{ ll x,y; Point(){} Point(ll _x,ll _y){.原创 2020-05-30 23:33:39 · 188 阅读 · 0 评论 -
(二分查找+前缀和)Codeforces Round #645 (Div. 2) D - The Best Vacation
这题知道是末端一定是在月末这题就没啥了,可惜这题做的时候迷迷糊糊的,这都没想到,然后就s[i]表示前缀和(要扩大一倍),查一下s[i]-x在哪个地方就可以了,You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place cal..原创 2020-05-27 23:58:16 · 183 阅读 · 0 评论 -
(二分)Educational Codeforces Round 53 (Rated for Div. 2) C - Vasya and Robot
思路:这题二分长度就好了,可惜我一开始看成了只能上下或左右互换,就写炸了做法:前缀和纪录向上和向右贡献,然后二分长度,对于长度len,枚举起点,假设起点i,终点j,j-i+1=len,那去掉区间[i,j]后计算走到了(x1,y1),然后s=abs(x1-x)+abs(y1-y)就是要修改的路程,那只要s<=len且(s-len)%2==0就可以修改完成,(s-len)%2==0的话,说明多余的字符可以来回走消耗掉Vasya has got a robot which is situate..原创 2020-05-25 01:38:33 · 116 阅读 · 0 评论 -
(简单写法) Codeforces Round #619 (Div. 2) D. Time to Run
具体走法如上图:先右,然后折回,再向下,在重复直到最后一行,最后一行先向右,然后上再折回,再左,一直重复直到走回原点这个走法模拟并不是难点,难点在与它每步最多四格,然后可以多次重复,步数不能超过3000,如果直接模拟我就看到有博客写到了一两百行,变成了一个大模拟,实际有个简单写法先模拟走一遍,用字符串存起来,这个字符串中前k个,连续相同的字符就可以压缩到一步,然后输出就可以了Bashar was practicing for the national programmi...原创 2020-05-20 01:06:46 · 181 阅读 · 0 评论 -
Educational Codeforces Round 87 (Rated for Div. 2) C2 - Not So Simple Polygon Embedding
正方形内接正多边形做法证明参考:正四边形内接正六边形参考博客具体做法见代码The statement of this problem is the same as the statement of problem C1. The only difference is that, in problem C1, n is always even, and in C2, nis always odd.You are given a regular polygon with 2⋅nve..原创 2020-05-19 00:01:59 · 196 阅读 · 0 评论 -
(三分)Codeforces Round #643 (Div. 2) E - Restorer Distance
这e题确实比c好写多了,只要会三分就能做出来,可惜c花太多时间没时间写e了。。思路:很明显是凹函数,高度只有取恰当值才能取到最小值,那就三分高度,对于某一高度h,计算出要去除的砖块x,填补的砖块y,那么mi=min(x,y),对于mi,先判断(a+r)和m的大小,前者大就用前者,后者大就用后者,对于x-mi,直接用r代价消去,因为你没地方转移了,y-mi同理,用a代价填具体做法看代码You have to restore the wall. The wall consists of N p..原创 2020-05-18 00:14:17 · 214 阅读 · 0 评论 -
Codeforces Round #641 (Div. 2) D. Orac and Medians
思路:如果数组存在k,且存在一个区间[i,i+2],至少有两个数大于等于k,那么必定有解,否则无解简略证明如下:1.如果存在这么一个区间,那么要么它都变成k,然后拓展把数组所有数都变成k,要么它都变成x,x>k,然后扩展到k旁边,在由k扩展,全部变成k,例如n=8,k=2,3 1 3 1 1 1 1 2,那么可以变成 3 3 3 3 3 3 3 2,然后变成 2 2 2 2 2 2 2 22.如果不存在,那么说明每个[i,i+2]区间最多只有一个数大于等于k,那么任何区间,大于等于k的数.原创 2020-05-14 02:11:24 · 201 阅读 · 0 评论 -
(倍增)CodeForces - 1335F Robots on a Grid
思路:可以先视为在每个格子都放了一个机器人,在让他们同时走至少n*m步,这样,就只要在最后每个格子检查一下是否有机器人,以及机器人是否来自黑格,当然,这个过程不能直接模拟,我们要进行倍增nex[j[i]表示第j号格子走2^(i-1)步到达的格子,第j个位置走2^(i-1)步可以看成第j个点走2^(i-2)到nex[j][i-1]再走2^(i-2)步,这就完成了倍增There is a rectangular grid of size n×m. Each cell of the grid is ..原创 2020-05-14 00:50:17 · 219 阅读 · 0 评论 -
(正确题意)Codeforces Round #639 (Div. 2) C Hilbert's Hotel
这题不少人是猜了一个找(i+ai)%n=(j+aj)%n水过去的,这个做法是正确的,但实际题意不是这样的,因为这样样例都没法解释正确的题意是这样的:给你一个数组ai,找两个不相等的整数k1,k2,是否存在k1+a[k1%n]=k2+a[k2%n]然后推一下就可以发现它和找(i+ai)%n=(j+aj)%n是等价的推的过程如下:假设是两个数ai和aj在变换后相等,现在找...原创 2020-05-07 02:13:10 · 209 阅读 · 0 评论 -
(贪心+优先队列)Educational Codeforces Round 86 (Rated for Div. 2) D. Multiple Testcases
题意:n个物体,每个物体重量ai,ci代表背包能装重量>=i的物体ci个,问最少要几个背包才能装完,并输出每个背包装了哪些物体思路:首先二分出最小背包数,然后从后往前遍历,重量为i的物体你要把它装到背包时,挑装的最少的背包装就好了outputstandard outputSo you decided to hold a contest on Codeforces. Y...原创 2020-04-27 03:03:21 · 579 阅读 · 0 评论 -
(dp)HDU - 1078 FatMouse and Cheese
题意:这题题意就是给你一个网格,你在(0,0)开始走,每步可以向上或向下或向左或向右走最多k步,且每次走到的位置的值都要比上次大,问走到的位置值和最大是多少思路:这题有两种做法,一种是记忆化搜索,一种是直接dp,直接dp就是把每个点排序,然后类似最长上升子序列那样dp,不过n^2的做法会超时 不要问我为什么知道会超时,得优化一下(怎么优化很简单,我就不写了 其实是懒得写,hdu讨论区有人...原创 2020-04-21 23:45:49 · 132 阅读 · 0 评论 -
(二分)Codeforces Round #635 (Div. 2) D. Xenia and Colorful Gems
D. Xenia and Colorful Gemstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputXenia is a girl being born a noble. Due to the inflexi...原创 2020-04-16 01:10:29 · 436 阅读 · 0 评论 -
(结论题)Codeforces Round #633 (Div. 2) D. Edge Weight Assignment
D. Edge Weight Assignmenttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have unweighted tree of nvertices. You have to ass...原创 2020-04-13 00:59:51 · 519 阅读 · 0 评论 -
Educational Codeforces Round 85 (Rated for Div. 2) E - Divisor Paths
You are given a positive integer D. Let's build the following graph from it:each vertex is a divisor of D(not necessarily prime, 1 and Ditself are also included); two vertices x and y (x>y...原创 2020-04-12 17:08:32 · 277 阅读 · 2 评论 -
c.Labs Codeforces Round #593 (Div. 2)
In order to do some research, n2 labs are built on different heights of a mountain. Let's enumerate them with integers from 1 to n2, such that the lab with the number 1 is at the lowest place, the lab...原创 2019-10-19 15:58:37 · 386 阅读 · 0 评论 -
B. Alice and the List of Presents Codeforces Round #593 (Div. 2)
Alice got many presents these days. So she decided to pack them into boxes and send them to her friends.There are nkinds of presents. Presents of one kind are identical (i.e. there is no way to di...原创 2019-10-19 15:55:03 · 365 阅读 · 0 评论 -
Codeforces Round #554 (Div. 2) B - Neko Performs Cat Furrier Transform
outputstandard outputCat Furrier Transform is a popular algorithm among cat programmers to create longcats. As one of the greatest cat programmers ever exist, Neko wants to utilize this algorithm ...原创 2019-04-25 00:55:43 · 132 阅读 · 0 评论 -
Codeforces Round #554 (Div. 2) A
On a random day, Neko found n treasure chests and m keys. The i-th chest has an integer ai written on it and the j-th key has an integer bjon it. Neko knows those chests contain the powerful mysteri...原创 2019-04-25 00:53:42 · 135 阅读 · 0 评论 -
Educational Codeforces Round 64 (Rated for Div. 2) A Inscribed Figures
The math faculty of Berland State University has suffered the sudden drop in the math skills of enrolling students. This year the highest grade on the entrance math test was 8. Out of 100! Thus, the d...原创 2019-05-02 15:37:30 · 152 阅读 · 0 评论 -
Educational Codeforces Round 64 (Rated for Div. 2) B Ugly Pairs
You are given a string, consisting of lowercase Latin letters.A pair of neighbouring letters in a string is considered ugly if these letters are also neighbouring in a alphabet. For example, string ...原创 2019-05-02 15:34:20 · 238 阅读 · 0 评论 -
Educational Codeforces Round 63 (Rated for Div. 2)C - Alarm Clocks Everywhere
Ivan is going to sleep now and wants to set his alarm clock. There will be many necessary events tomorrow, the i-th of them will start during the xi-th minute. Ivan doesn't want to skip any of the eve...原创 2019-04-23 01:11:18 · 184 阅读 · 0 评论 -
Educational Codeforces Round 63 (Rated for Div. 2) Game with Telephone Numbers B
A telephone number is a sequence of exactly 11digits such that its first digit is 8.Vasya and Petya are playing a game. Initially they have a string sof length n (n is odd) consisting of digits....原创 2019-04-23 01:09:07 · 139 阅读 · 0 评论 -
Educational Codeforces Round 63 (Rated for Div. 2) Reverse a Substring A
You are given a string s consisting of nlowercase Latin letters.Let's define a substring as a contiguous subsegment of a string. For example, "acab" is a substring of "abacaba" (it starts in posit...原创 2019-04-23 01:05:34 · 175 阅读 · 0 评论 -
Codeforces Round #555 (Div. 3) C2. Increasing Subsequence (hard version)
The only difference between problems C1 and C2 is that all values in input of problem C1 are distinct (this condition may be false for problem C2).You are given a sequence aconsisting of nintege...原创 2019-04-27 02:24:55 · 124 阅读 · 0 评论 -
C. Gourmet Cat
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has a cat and his cat is a real gourmet! Dependent on a day of the week he...原创 2019-04-17 20:59:47 · 252 阅读 · 2 评论 -
B. Make Them Equal
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a sequence a1,a2,…,anconsisting of nintegers.You can choose an...原创 2019-04-17 20:58:01 · 328 阅读 · 0 评论 -
Codeforces Round #556 (Div. 2) C. Prefix Sum Primes
We're giving away nice huge bags containing number tiles! A bag we want to present to you contains n tiles. Each of them has a single number written on it— either 1 or 2.However, there is one con...原创 2019-04-30 00:58:19 · 216 阅读 · 0 评论 -
Codeforces Round #556 (Div. 2) B. Tiling Challenge
outputstandard outputOne day Alice was cleaning up her basement when she noticed something very curious: an infinite set of wooden pieces! Each piece was made of five square tiles, with four tiles...原创 2019-04-30 01:01:41 · 201 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) D. Vitaly and Cycle
After Vitaly was expelled from the university, he became interested in the graph theory.Vitaly especially liked the cycles of an odd length in which each vertex occurs at most once.Vitaly was wond...原创 2019-09-20 20:46:25 · 79 阅读 · 0 评论 -
Codeforces Round #567 (Div. 2) B. Split a Number
time limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputDima worked all day and wrote down on a long paper strip his favorite number nco...原创 2019-06-16 21:08:05 · 699 阅读 · 0 评论 -
Codeforces Round #567 (Div. 2) A. Chunga-Changa
time limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputSoon after the Chunga-Changa island was discovered, it started to acquire some form...原创 2019-06-16 21:01:01 · 327 阅读 · 0 评论