Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"AtCoder-abc270_e\":[\"Apple Baskets on Circle\",1847,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc270\\\"\\u003eTOYOTA MOTOR CORPORATION Programming Contest 2022(AtCoder Beginner Contest 270)\\u003c/a\\u003e\"],\"CodeForces-382C\":[\"Arithmetic Progression\",8566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/382\\\"\\u003eCodeforces Round 224 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1304D\":[\"Shortest and Longest LIS\",6312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1409E\":[\"Two Platforms\",7755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1409\\\"\\u003eCodeforces Round 667 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-148E\":[\"Porcelain\",4367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1691D\":[\"Max GEQ Sum\",5594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1691\\\"\\u003eCodeCraft-22 and Codeforces Round 795 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1141F2\":[\"Same Sum Blocks (Hard)\",4214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1598D\":[\"Training Session\",8503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1598\\\"\\u003eEducational Codeforces Round 115 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1324E\":[\"Sleeping Schedule\",12998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1695C\":[\"Zero Path\",10544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1695\\\"\\u003eCodeforces Round 801 (Div. 2) and EPIC Institute of Technology Round\\u003c/a\\u003e\"],\"CodeForces-988D\":[\"Points and Powers of Two\",7273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-5C\":[\"Longest Regular Bracket Sequence\",14263,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-584C\":[\"Marina and Vasya\",6440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/584\\\"\\u003eCodeforces Round 324 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1525D\":[\"Armchairs\",9627,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1525\\\"\\u003eEducational Codeforces Round 109 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1359D\":[\"Yet Another Yet Another Task\",9183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"AtCoder-arc145_a\":[\"AB Palindrome\",2584,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc145\\\"\\u003eAtCoder Regular Contest 145\\u003c/a\\u003e\"],\"CodeForces-1379C\":[\"Choosing flowers\",5652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1379\\\"\\u003eCodeforces Round 657 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1622C\":[\"Set or Decrease\",12662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1622\\\"\\u003eEducational Codeforces Round 120 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1626D\":[\"Martial Arts Tournament\",3837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1626\\\"\\u003eEducational Codeforces Round 121 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1739D\":[\"Reset K Edges\",4934,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1739\\\"\\u003eEducational Codeforces Round 136 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1157E\":[\"Minimum Array\",8572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-337D\":[\"Book of Evil\",6426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/337\\\"\\u003eCodeforces Round 196 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1181C\":[\"Flag\",3126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-547B\":[\"Mike and Feet\",8750,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1733D2\":[\"Zero-One (Hard Version)\",4026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1733\\\"\\u003eCodeforces Round 821 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-777D\":[\"Cloud of Hashtags\",5368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-600C\":[\"Make Palindrome\",6204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-797D\":[\"Broken BST\",1810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-652D\":[\"Nested Segments\",4190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"AtCoder-arc119_c\":[\"ARC Wrecker 2\",962,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc119\\\"\\u003eAtCoder Regular Contest 119\\u003c/a\\u003e\"],\"CodeForces-1213D2\":[\"Equalizing by Division (hard version)\",11501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"AtCoder-arc111_b\":[\"Reversible Cards\",1072,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc111\\\"\\u003eAtCoder Regular Contest 111\\u003c/a\\u003e\"],\"CodeForces-1358D\":[\"The Best Vacation\",8347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1358\\\"\\u003eCodeforces Round 645 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-arc153_c\":[\"± Increasing Sequence\",547,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc153\\\"\\u003eAtCoder Regular Contest 153\\u003c/a\\u003e\"],\"CodeForces-388B\":[\"Fox and Minimal path\",2572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/388\\\"\\u003eCodeforces Round 228 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1718A2\":[\"Burenka and Traditions (hard version)\",5020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1718\\\"\\u003eCodeforces Round 814 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1661D\":[\"Progressions Covering\",4652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1661\\\"\\u003eEducational Codeforces Round 126 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156B\":[\"Ugly Pairs\",6401,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118C\":[\"Fancy Number\",2776,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-219D\":[\"Choosing Capital for Treeland\",9988,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/219\\\"\\u003eCodeforces Round 135 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1552D\":[\"Array Differentiation\",6751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-1661C\":[\"Water the Trees\",9107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1661\\\"\\u003eEducational Codeforces Round 126 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1095E\":[\"Almost Regular Bracket Sequence\",4180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1370D\":[\"Odd-Even Subsequence\",9328,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-687C\":[\"The Values You Can Make\",5410,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/687\\\"\\u003eCodeforces Round 360 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-arc148_c\":[\"Lights Out on Tree\",1017,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc148\\\"\\u003eAtCoder Regular Contest 148\\u003c/a\\u003e\"],\"CodeForces-1535C\":[\"Unstable String\",16302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1535\\\"\\u003eEducational Codeforces Round 110 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1721D\":[\"Maximum AND\",6364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1325D\":[\"Ehab the Xorcist\",11868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1325\\\"\\u003eCodeforces Round 628 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1624E\":[\"Masha-forgetful\",3989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1624\\\"\\u003eCodeforces Round 764 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-379D\":[\"New Year Letter\",1597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-1361B\":[\"Johnny and Grandmaster\",3478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1361\\\"\\u003eCodeforces Round 647 (Div. 1) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-1365F\":[\"Swaps Again\",4397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-708B\":[\"Recover the String\",3298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1179B\":[\"Tolik and His Uncle\",4361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1179\\\"\\u003eCodeforces Round 569 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1374E1\":[\"Reading Books (easy version)\",13842,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1374\\\"\\u003eCodeforces Round 653 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1442A\":[\"Extreme Subtraction\",8781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1442\\\"\\u003eCodeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1054D\":[\"Changing Array\",2316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1054\\\"\\u003eMail.Ru Cup 2018 Round 1\\u003c/a\\u003e\"],\"CodeForces-1490G\":[\"Old Floppy Drive\",5678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1272E\":[\"Nearest Opposite Parity\",6507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1272\\\"\\u003eCodeforces Round 605 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-961D\":[\"Pair Of Lines\",4547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/961\\\"\\u003eEducational Codeforces Round 41 (Rated for Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc222_f\":[\"Expensive Expense\",508,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc222\\\"\\u003eExawizards Programming Contest 2021(AtCoder Beginner Contest 222)\\u003c/a\\u003e\"],\"AtCoder-abc249_f\":[\"Ignore Operations\",632,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc249\\\"\\u003eMonoxer Programming Contest 2022(AtCoder Beginner Contest 249)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"MoYuing","updateTime":1680235147000,"title":"灵茶の试炼(自用)","dislikeCnt":0,"content":"[problem:CodeForces-379D]\n[problem:AtCoder-abc249_f]\n[problem:CodeForces-1733D2]\n[problem:CodeForces-1718A2]\n[problem:CodeForces-1739D]\n[problem:CodeForces-1370D]\n[problem:CodeForces-1358D]\n[problem:CodeForces-547B]\n[problem:CodeForces-1490G] 情况划归到\u003c\u003dmax内,对前缀和的前缀max二分查询\n[problem:CodeForces-777D]\n[problem:CodeForces-1691D] 单调栈 + 递推or数据结构维护前缀和最值\n[problem:CodeForces-1409E]\n[problem:AtCoder-abc222_f]\n[problem:CodeForces-1721D]\n[problem:CodeForces-1598D] \n[problem:CodeForces-1661D] 等差序列,逆向思考,贪心\n[problem:CodeForces-1661C] “all equal problem” ,操作替代关系分析,目标上界确定\n[problem:CodeForces-961D] 数学题 “两点定一线”,暴力另一条\n[problem:AtCoder-arc145_a] 思维构造 简单情况化归\n[problem:CodeForces-1359D] 单调栈 + 递推or数据结构维护前缀和最值(同CF1691D)\n[problem:AtCoder-abc270_e] 加速循环 暴力最后一次循环\n[problem:CodeForces-797D] bfs/dfs维护可行区间,需注意重复值\n[problem:AtCoder-arc153_c] 调整构造,对一个普通等差序列做前后缀上的调整\n[problem:AtCoder-arc148_c] 多组询问,预处理儿子数,每次询问找连通块做微调\n[problem:AtCoder-arc119_c] 基于 组合操作使得交错和不变 的结论题\n[problem:CodeForces-1695C] 由于每次变化量仅+1-1因此可行区间一定连续,dp维护minmax即可\n[problem:AtCoder-arc111_b] 结论题,建无向边,对联通分量找是否有环\n[problem:CodeForces-1442A] 转化差分意义\n[problem:CodeForces-1141F2] 按区间和分类,处理出区间,并按右端点排序,套经典贪心\n[problem:CodeForces-1361B]\n[problem:CodeForces-1324E] 01背包\n[problem:CodeForces-1374E1]01,10两两配对 or 枚举case + (前缀和or双指针)\n[problem:CodeForces-1213D2] 枚举每个数,模拟过程,得到代价,取最小\n[problem:CodeForces-1095E] 括号序列转前缀和,在折现上做调整 \n[problem:CodeForces-1272E] 返向建图,从奇偶部连接点开始bfs\n[problem:CodeForces-600C] 奇偶配对\n[problem:CodeForces-5C]\n[problem:CodeForces-584C] 分类讨论\n[problem:CodeForces-1179B] 特殊推一般,从1维的情况得到启发:只要每次跳跃到离当前点最远的那个未访问点即可\n[problem:CodeForces-708B]\n[problem:CodeForces-388B]\n[problem:CodeForces-1552D]\n[problem:CodeForces-1525D]\n[problem:CodeForces-219D]\n[problem:CodeForces-148E]\n[problem:CodeForces-337D]\n[problem:CodeForces-652D]\n[problem:CodeForces-1379C]\n[problem:CodeForces-1304D] 微调构造,对一个有序的排列根据大小约束做微调翻转构造.\n[problem:CodeForces-1156B] 分奇偶,贪心构造\n[problem:CodeForces-687C] 背包套背包搞dp\n[problem:CodeForces-1054D] 转前缀和意义考虑,贪心做均匀分配\n[problem:CodeForces-118C] 枚举case,易错点在“字典序最小”上,对于其应该遵循先顺序改大的再逆序改小的,同时最后目标值小并不一定生成的字典序最小\n[problem:CodeForces-1157E]并查集环上加速枚举 or multiset二分搞搞\n[problem:CodeForces-1325D]分类讨论构造,一次分类:按大小分,二次分类:奇偶性分类.最后对同奇偶性的讨论发现长度为3的很容易构造,而某些长度3的数组的两数还可以再次合并.(如果只考虑最低位,异或和加法是完全一样的,从这里入手才好发现要对奇偶性分类)\n[problem:CodeForces-1181C]比较经典的dp\n[problem:CodeForces-1624E]不断折半子串可证长度2,3可以构造则一定可以构造.之后预处理这些小段,跑可行性dp,最后输出方案回溯状态.\n[problem:CodeForces-1626D]贪心选取离2^k次方最近的分组方法\n[problem:CodeForces-1535C]很套路的dp\n[problem:CodeForces-1622C]贪心+枚举case.注意到要用最小值推平之后就比较显然\n[problem:CodeForces-382C]分类讨论\n[problem:CodeForces-988D]考虑到约束很强,猜测数量很有限,枚举到4时发现不行.略微反证一下结论显然,仅可以构造小于4的集合\n[problem:CodeForces-1365F]手玩样例发现只有对称的两个元素可以互换且移动一个另一个也一定会跟着移动.于是只要看a中是否有b需要的数对就可以了\n\n\n\n\n\n\n","threadId":135807,"likeCnt":3,"createTime":1674307416000,"isWorkbook":true,"viewCnt":864,"openness":2,"fav":false,"id":3422,"trustable":false}