codeforces
文章平均质量分 88
CarolusRex
这个作者很懒,什么都没留下…
展开
-
SOS DP
SOS DPdefinitionsolutionsos dplearn from blog of 海边拾贝的言definitionsos: sum over subsetstarget: F(mask)=∑i∈maskA(i)F(mask) = \sum_{i \in mask} A(i)F(mask)=∑i∈maskA(i)linked to FWT (need a complement), fellow are definition of FWTFWT orFWT\ orFWT&原创 2021-07-30 16:26:10 · 190 阅读 · 0 评论 -
Codeforces Round #726 A~F
by。原创 2021-06-20 04:00:16 · 3874 阅读 · 0 评论 -
Educational Codeforces Round 110 A~E
Educational Codeforces Round 110 A~Eby CarolusRexcontentA. Fair PlayoffB. Array ReoderingC. Unstable StringD. Playoff TournamentE. Gold TransfercodeA. Fair Playoff点点点B. Array Reodering点点点C. Unstable String题意:T(1⩽T⩽104)T\left(1\leqslant T\leqslant原创 2021-06-06 03:40:31 · 1017 阅读 · 0 评论 -
Codeforces Round #721 A~E
Codeforces Round #721 A~Eby CarolusRexcontentA. And Then There Were KB1. Palindrome Game (easy version)B2. Palindrome Game (hard version)C. Sequence Pair WeightD. MEX TreeE. Partition GamecodeA. And Then There Were K点点点B1. Palindrome Game (easy versio原创 2021-05-30 21:05:24 · 146 阅读 · 0 评论 -
Educational Codeforces Round 107 A~E
Educational Codeforces Round 107 A~Eby CarolusRexcontentA. Review SiteB. GCD LengthC. Yet Another Card DeckD. Min Cost StringE. Colorings and DominoescodeA. Review Site点点点B. GCD Length点点点C. Yet Another Card Deck点点点D. Min Cost String题意:给定字符串长度n(1原创 2021-04-29 12:09:28 · 119 阅读 · 0 评论 -
Codeforces Round #715 A~E
codeforces #715 A~Eby CarolusRexcontentA. Average HeightB. TMT DocumentC. The Sports FestivalD. Binary LiteratureE. Almost SortedcodeA. Average Height点点点B. TMT Document点点点C. The Sports Festival题意:给定n(1⩽n⩽2⋅103)n\left(1\leqslant n\leqslant 2\cdot 1原创 2021-04-28 18:49:42 · 309 阅读 · 0 评论 -
Codeforces Round #716 A~D
codeforces #716 A~Dby CarolusRexcontentA. Perfectly Imperfect ArrayB. AND 0, Sum BigC. Product 1 Modulo ND. Cut and StickcodeA. Perfectly Imperfect Array点点点B. AND 0, Sum Big点点点C. Product 1 Modulo N题意:找到{1,2,...,n−1}\{1,2,...,n-1\}{1,2,...,n−1}的最长子原创 2021-04-28 16:28:56 · 130 阅读 · 0 评论 -
Codeforces Round #717 A~D
codeforces #717 A~Dby CarolusRexcontentA. Tit for TatB. AGAGA XOOORRRC. Baby Ehab Partitions AgainD. CutcodeA. Tit for Tat点点点B. AGAGA XOOORRR点点点C. Baby Ehab Partitions Again点点点D. Cut题意:给定一组数n(1⩽n⩽105)n\left(1\leqslant n\leqslant 10^5\right)n(1⩽n原创 2021-04-28 13:54:43 · 171 阅读 · 0 评论 -
codeforces EDU Disjoint Sets Union step 3
本文以codeforces EDU Disjoint Sets Union为资料contentIntroductionMo's algorithm and DSUDynamic Connectivity Offlineproblems & solutionsB. Number of Connected Components on SegmentsC. Dynamic Connectivity OfflinecodeIntroductionMo’s algorithm and DSU莫队算法在原创 2021-02-05 21:01:02 · 313 阅读 · 0 评论 -
codeforces EDU Disjoint Sets Union step 2
本文以codeforces EDU Disjoint Sets Union为资料contentIntroductionDSU in Minimal Spanning Treeproblems & solutionsC. Restructuring CompanyD. BossesF. Dense spanning treecodeIntroductionDSU in Minimal Spanning Treekruskalproblems & solutionsC. Restru原创 2021-01-28 19:23:20 · 471 阅读 · 0 评论 -
codeforces EDU Disjoint Sets Union step 1
本文以codeforces EDU Disjoint Sets Union为资料contentintroductionDisjoint Sets UnionintroductionDisjoint Sets Union原创 2021-01-24 22:56:22 · 768 阅读 · 1 评论 -
codeforces EDU suffix array
suffix array的定义是一个字符串的所有后缀排序后得到的数组(下例中包括了最后的一个空串)example:string sss=ababbaresult: null a ababba abba ba babba bba暴力算法显然是对N个后缀直接排序,那么复杂度是不可接受的下面通过后缀数组降低时间复杂度定义数组ppp为排序后的后缀在原字符串sss中的位置那么有 6 null 5 a 0 ababba 2 abba 4 ba 1 babba 3 bba第一列即原创 2020-07-24 21:18:44 · 381 阅读 · 0 评论 -
codeforces EDU segment tree
C. Number of Inversions on Segmentinv[l,r]=inv[1,r]−inv[1,L]−[1,L]>(L,r]inv[l,r]=inv[1,r]-inv[1,L]-[1,L]>(L,r]inv[l,r]=inv[1,r]−inv[1,L]−[1,L]>(L,r]原创 2020-07-19 14:57:36 · 661 阅读 · 0 评论 -
codeforces Round #620 (Div.2) A~F
codeforces Round 620 A~FA.Two RabbitsB.Longest PalindromeC.Air ConditionerD.Shortest and Longest LISE.1-Trees and QueriesF.Animal ObservationF1.Animal Observation (easy version)F2.Animal Observation (...原创 2020-02-21 00:49:54 · 257 阅读 · 0 评论