- 博客(15)
- 收藏
- 关注
RSS订阅原创 The 2019 ICPC Asia Shanghai Regional Contest
文章目录The 2019 ICPC Asia Shanghai Regional ContestB.Prefix CodeD.Spanning Tree RemovalE.Cave EscapeF.A Simple Problem On A TreeG.Play the game SETH.Tree PartitionK.Color GraphM.Blood Pressure GameThe 2019 ICPC Asia Shanghai Regional ContestB.Prefix Code题意
2020-11-28 16:58:17
1197
原创 Codeforces Round #686 (Div. 3)
文章目录Codeforces Round #686 (Div. 3)A. Special PermutationB. Special PermutationC. Sequence TransformationD. Number into SequenceE. Number of Simple PathsF. Array PartitionCodeforces Round #686 (Div. 3)A. Special Permutation题意： 找到一个排列第i位置不等于i题解： 那么输出i+1，
2020-11-28 16:14:17
128
原创 Codeforces Round #685 (Div. 2)
文章目录Codeforces Round #685 (Div. 2)A.Subtract or DivideB.Non-Substring SubsequenceC.String EqualityD.Circle GameE.Bitwise QueriesF.Nullify The MatrixCodeforces Round #685 (Div. 2)A.Subtract or Divide题意： 给的一个数字n，有2种操作，第一种操作就是n–；第二种操作就是n变为它的某个约数，问一个数字n经过最少
2020-11-28 14:46:05
102
原创 Codeforces Round #684 (Div. 2)
文章目录Codeforces Round #684 (Div. 2)A.Buy the StringB.Sum of MediansC1/C2.Binary TableD.Graph Subset ProblemE.Greedy ShoppingCodeforces Round #684 (Div. 2)A.Buy the String题意： 给定每个0的花费，给定每个1的花费，给定0和1互换的花费，问字符串变的花费题解： 一共3的情况，不变、全0、全1，取个min即可代码：#include &
2020-11-24 00:11:24
123
原创 Codeforces Round #683 (Div. 2, by Meet IT)
文章目录Codeforces Round #683 (Div. 2, by Meet IT)A. Add CandiesB. Numbers BoxC. KnapsackD. Catching CheatersE. Xor TreeF1/F2. Frequency Problem (Hard Version)Codeforces Round #683 (Div. 2, by Meet IT)A. Add Candies题意： 水题题解：代码：#include <bits/stdc++.h&
2020-11-20 11:33:13
104
原创 Codeforces Round #682 (Div. 2)
文章目录Codeforces Round #682 (Div. 2)A. Specific Tastes of AndreB. Valerii Against EveryoneC. Engineer ArtemD. Powerful KseniaE. Yurii Can Do EverythingF. Olha and IgorCodeforces Round #682 (Div. 2)A. Specific Tastes of Andre题意： 要求构造一个长度为n的perfect数组题解： 全部
2020-11-18 09:38:55
112
原创 ICPC2016大连
文章目录ICPC2016大连A.Wrestling MatchC.Game of Taking StonesD.A Simple Math ProblemE - Aninteresting gameF.DetachmentH.To begin or not to beginI.ConvexJ.Find Small AICPC2016大连A.Wrestling Match题意： 给定n个人，这些人可能是好人也可能是坏人，要求好人和坏人才能连边，问是否能够把每个人标记为好人或者坏人题解： 本题是二分图染
2020-11-16 23:32:53
111
原创 Codeforces Round #678 (Div. 2)
文章目录Codeforces Round #678 (Div. 2)A. ReorderB. Prime SquareC.Binary SearchD. Bandit in a CityE. Complicated ComputationsF.Sum Over SubsetsCodeforces Round #678 (Div. 2)A. Reorder题意： 给定n和m，问∑i=1n∑j=inajj\sum_{i=1}^{n}{\sum_{j=i}^{n}{\frac{a_j}{j}}}∑i=1n
2020-11-13 20:57:07
98
原创 Codeforces Round #676 (Div. 2)
文章目录Codeforces Round #676 (Div. 2)A.XORwiceB.Putting Bricks in the WallC.PalindromifierD. HexagonsE.Swedish HeroesCodeforces Round #676 (Div. 2)A.XORwice题意： 给定a和b，找到x，使得(a ^ x) + (b ^ x)最小题解： 按照样例二进制画一画发现x取的是a和b都为1的位代码：#include <bits/stdc++.h>
2020-11-13 20:54:03
100
原创 康托展开&逆康托展开
文章目录康托展开&逆康托展开1.算法分析1.1 康托展开1.2 逆康托展开2.模板3.典型例题康托展开&逆康托展开1.算法分析康托展开可以求一个序列是第几个排列，即求得[2, 1, 3]是第3个排列逆康托展开可以求得第k个排列是多少，即求得第3个排列为[2, 1, 3]基于这个性质，可以使用康托展开把一个序列做哈希，映射为一个数字。1.1 康托展开康托展开公式：当前排列的的排名为： rank=an∗(n−1)!+an−1∗(n−2)!+...+a1∗0+1rank = a_n*
2020-11-13 17:24:57
184
原创 Codeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Final)
文章目录Codeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Final)A. Kids SeatingB. Saving the CityC. The Delivery DilemmaD. Extreme SubtractionE. Long PermutationF. Identify the OperationsCodeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Fina
2020-11-13 17:23:09
140
原创 Codeforces Round #678 (Div. 2)
文章目录Codeforces Round #678 (Div. 2)A. ReorderB. Prime SquareC.Binary SearchD. Bandit in a CityE. Complicated ComputationsCodeforces Round #678 (Div. 2)A. Reorder题意： 给定n和m，问∑i=1n∑j=inajj\sum_{i=1}^{n}{\sum_{j=i}^{n}{\frac{a_j}{j}}}∑i=1n∑j=injaj是否为m题解
2020-11-12 20:54:58
82
原创 Codeforces Global Round 11
文章目录Codeforces Global Round 11A. Avoiding ZeroB. Chess CheaterC. The Hard Work of PaparazziD. Unshuffling a DeckE. XumCodeforces Global Round 11A. Avoiding Zero题意： 给定一个长度为n的数组a,问是否能够将a数组位置改变形成b数组，使得b数组的所有前缀和都不等于0.题解： 本题是构造题，如果正数的和大于负数和的绝对值，那么只需要将正数放在前面
2020-11-12 20:53:14
140
原创 2018icpc焦作
文章目录2018-2019 ACM-ICPC, Asia Jiaozuo Regional ContestA.Xu Xiake in Henan ProvinceD.Keiichi Tsuchiya the Drift KingE.Resistors in ParallelF.HoneycombI.Distance2018-2019 ACM-ICPC, Asia Jiaozuo Regional ContestA.Xu Xiake in Henan Province**题意： ** 签到题解： 签
2020-11-04 00:13:38
222
原创 ACM-ICPC North America Qualifier Contest 2018
文章目录ACM-ICPC North America Qualifier Contest 2018A. Bingo TiesB. Das BlinkenlightsG. Left and RightK. Run-Length Encoding, Run!L. SuperdokuACM-ICPC North America Qualifier Contest 2018A. Bingo Ties题意： 有一个新bing游戏，给定n个5∗55*55∗5的网格，每次玩家给定一组数列，如果这组数列包含了某2个网
2020-11-02 15:50:13
201
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人