摘要: A.Avoiding Zero 题目链接:https://codeforces.ml/contest/1427 题意:给出数组A1,A2,……An, 重新排列元素得出数组B,使得对于任意k,b1+b2+……+bk不等于0 题解:很傻逼的题目,不知道为什么当时没想出来QAQ 先求和,sum=0输出NO 阅读全文
posted @ 2020-10-13 00:01 璃灵 阅读(96) 评论(0) 推荐(0)
摘要: There are nn piles of stones, where the ii -th pile has aiai stones. Two people play a game, where they take alternating turns removing stones. In a m 阅读全文
posted @ 2020-07-22 23:46 璃灵 阅读(109) 评论(0) 推荐(0)
摘要: Two mages play the game. Both of them has their own set of creatures. Each creature is characterized by the integer — its strength. At the beginning o 阅读全文
posted @ 2020-07-15 23:46 璃灵 阅读(519) 评论(0) 推荐(0)
摘要: You are given a tree with nn vertices and (n−1)(n−1) edges. At the beginning its edges and vertices are not painted. You can perform the following ope 阅读全文
posted @ 2020-07-15 23:41 璃灵 阅读(400) 评论(0) 推荐(0)
摘要: There are 4 bars, possibly, having different lengths. Can they be used as the legs of the table, such that: The legs stay vertically in the vertices o 阅读全文
posted @ 2020-07-15 22:06 璃灵 阅读(231) 评论(0) 推荐(0)
摘要: —————————————————————————————————————————————————————————————————————————— 开开心心套个匈牙利板子就结束了,从今天开始我也是会用匈牙利的人了。虽然是网络流24题的题目,好像最大流dinic也能写,但是还是用了匈牙利。 阅读全文
posted @ 2020-07-14 22:06 璃灵 阅读(98) 评论(0) 推荐(0)
摘要: ———————————————————————————————————————————————————————————— 今天的签到题就是手速题,除了签到最简单就是这道的(虽然过的人不多,但是真的简单)。 emmm手推+大胆猜测得出dfs序(其实比赛的时候没有意识到是dfs序,但是不碍事),后来发现 阅读全文
posted @ 2020-07-13 23:52 璃灵 阅读(194) 评论(0) 推荐(0)
摘要: 高数题……高数还给老师了已经,开学考不知道怎么办。 最后找到了结论才过,还是队友过的……晚点补吧。 阅读全文
posted @ 2020-07-13 00:23 璃灵 阅读(178) 评论(0) 推荐(0)
摘要: 最后有个>没截全。 ———————————————————————————————————————————————————————————————————————— 签到题,全场唯一会做。思路是对的,代码码歪了。 直接补是不行的,样例3很明显了。重复两次再补足就ok了。但是码歪了。 看了一下别人的代 阅读全文
posted @ 2020-07-13 00:19 璃灵 阅读(197) 评论(0) 推荐(0)
摘要: Alice, Beto, and Carlos are playing with twine. Alice starts by pulling taut the string of twine, then she folds it and holds the string at the fold. 阅读全文
posted @ 2020-07-10 21:36 璃灵 阅读(190) 评论(0) 推荐(0)