Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"AtCoder-arc098_d\":[\"Donation\",74,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc098\\\"\\u003eAtCoder Regular Contest 098\\u003c/a\\u003e\"],\"洛谷-P1919\":[\"高精度乘法 | A*B Problem 升级版\",17362,\"模板\"],\"HDU-4258\":[\"Covered Walkway\",456,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+University+of+Chicago+Invitational+Programming+Contest+2012\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The University of Chicago Invitational Programming Contest 2012 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-932F\":[\"Escape Through Leaf\",2739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"洛谷-P5283\":[\"异或粽子\",4724,\"十二省联考 2019\"],\"UniversalOJ-693\":[\"地铁规划\",155,\"UR #23\"],\"CodeForces-932G\":[\"Palindrome Partition\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"洛谷-P5282\":[\"快速阶乘算法\",712,\"模板\"],\"洛谷-P5281\":[\"Minimax搜索\",268,\"ZJOI2019\"],\"洛谷-P6134\":[\"最小表示\",434,\"JSOI2015\"],\"UVA-1387\":[\"Driving Directions\",6,null],\"洛谷-P4195\":[\"扩展 BSGS/exBSGS\",6884,\"模板\"],\"洛谷-P5043\":[\"树同构([BJOI2015]树的同构)\",4364,\"模板\"],\"洛谷-P7468\":[\"愤怒的小 N\",607,\"NOI Online 2021 提高组\"],\"洛谷-P4196\":[\"凸多边形 /【模板】半平面交\",4365,\"CQOI2006\"],\"洛谷-P5284\":[\"字符串问题\",1331,\"十二省联考 2019\"],\"洛谷-P6136\":[\"普通平衡树(数据加强版)\",21909,\"模板\"],\"洛谷-P9643\":[\"Pick Up\",20,\"SNCPC2019\"],\"AtCoder-abc321_g\":[\"Electric Circuit\",155,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc321\\\"\\u003eSuntoryProgrammingContest2023(AtCoder Beginner Contest 321)\\u003c/a\\u003e\"],\"CodeForces-979E\":[\"Kuro and Topological Parity\",634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/979\\\"\\u003eCodeforces Round 482 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5293\":[\"白兔之舞\",484,\"HNOI2019\"],\"洛谷-P5050\":[\"多项式多点求值\",4931,\"模板\"],\"洛谷-P5056\":[\"插头 DP\",3887,\"模板\"],\"洛谷-P5298\":[\"Minimax\",1959,\"PKUWC2018\"],\"洛谷-P5059\":[\"中国象棋\",515,null],\"洛谷-P5058\":[\"嗅探器\",5486,\"ZJOI2004\"],\"黑暗爆炸-3328\":[\"PYXFIB\",165,\"By Wcmg\"],\"洛谷-P5066\":[\"人人本着正义之名\",327,\"Ynoi2014\"],\"SPOJ-PRMQUER\":[\"Prime queries\",499,\"Own\"],\"AtCoder-abc212_h\":[\"Nim Counting\",60,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc212\\\"\\u003eAtCoder Beginner Contest 212\\u003c/a\\u003e\"],\"CodeForces-1542E2\":[\"Abnormal Permutation Pairs (hard version)\",833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1542\\\"\\u003eCodeforces Round 729 (Div. 2)\\u003c/a\\u003e\"],\"POJ-2887\":[\"Big String\",1330,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.07.30\\\"\\u003ePOJ Monthly--2006.07.30\\u003c/a\\u003e, zhucheng\\u003c/div\\u003e\"],\"UVA-12594\":[\"Naming Babies\",129,null],\"CodeForces-67C\":[\"Sequence of Balls\",696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"洛谷-P1707\":[\"刷题比赛\",1095,null],\"CodeForces-1034E\":[\"Little C Loves 3 III\",638,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1034\\\"\\u003eCodeforces Round 511 (Div. 1)\\u003c/a\\u003e\"],\"UniversalOJ-207\":[\"共价大爷游长沙\",679,null],\"CodeForces-1010F\":[\"Tree\",224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1010\\\"\\u003eCodeforces Round 499 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-711D\":[\"Directed Roads\",4563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/711\\\"\\u003eCodeforces Round 369 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5074\":[\"Eat the Trees\",1285,null],\"CodeForces-868F\":[\"Yet Another Minimization Problem\",3768,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"AtCoder-agc038_e\":[\"Gachapon\",89,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc038\\\"\\u003eAtCoder Grand Contest 038\\u003c/a\\u003e\"],\"洛谷-P9674\":[\"Set of Intervals\",6,\"ICPC2022 Jinan R\"],\"SPOJ-MSKYCODE\":[\"Sky Code\",719,\"Southeastern European 2008\"],\"洛谷-P1713\":[\"麦当劳叔叔的难题\",3053,null],\"AtCoder-arc096_c\":[\"Everything on It\",132,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc096\\\"\\u003eAtCoder Regular Contest 096\\u003c/a\\u003e\"],\"CodeForces-1320E\":[\"Treeland and Viruses\",651,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1320\\\"\\u003eCodeforces Round 625 (Div. 1, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1320C\":[\"World of Darkraft: Battle for Azathoth\",2895,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1320\\\"\\u003eCodeforces Round 625 (Div. 1, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"洛谷-P6177\":[\"Count on a tree II/【模板】树分块\",1270,null],\"黑暗爆炸-4671\":[\"异或图\",191,\"\"],\"CodeForces-490F\":[\"Treeland Tour\",1723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/490\\\"\\u003eCodeforces Round 279 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc323_g\":[\"Inversion of Tree\",20,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc323\\\"\\u003eUNIQUE VISION Programming Contest 2023 Autumn(AtCoder Beginner Contest 323)\\u003c/a\\u003e\"],\"HDU-4069\":[\"Squiggly Sudoku\",522,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Fuzhou+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1967\":[\"货车运输\",29583,\"NOIP2013 提高组\"],\"CodeForces-1234F\":[\"Yet Another Substring Reverse\",2605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1234\\\"\\u003eCodeforces Round 590 (Div. 3)\\u003c/a\\u003e\"],\"UniversalOJ-424\":[\"count\",440,\"集训队作业2018\"],\"CodeForces-1670F\":[\"Jee, You See?\",933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1670\\\"\\u003eCodeforces Round 788 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-802H\":[\"Fake News (medium)\",451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"AtCoder-agc058_c\":[\"Planar Tree\",67,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc058\\\"\\u003eAtCoder Grand Contest 058\\u003c/a\\u003e\"],\"洛谷-P9216\":[\"写大作业 (Hard Version)\",146,\"入门赛 #11\"],\"黑暗爆炸-4665\":[\"小w的喜糖\",57,\"\"],\"AtCoder-agc058_e\":[\"Nearer Permutation\",6,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc058\\\"\\u003eAtCoder Grand Contest 058\\u003c/a\\u003e\"],\"CodeForces-802O\":[\"April Fools\\u0027 Problem (hard)\",841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-802N\":[\"April Fools\\u0027 Problem (medium)\",1137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"洛谷-P2824\":[\"排序\",7981,\"HEOI2016/TJOI2016\"],\"CodeForces-1342F\":[\"Make It Ascending\",748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1342\\\"\\u003eEducational Codeforces Round 86 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1584F\":[\"Strange LCS\",865,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1584\\\"\\u003eTechnocup 2022 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1100F\":[\"Ivan and Burgers\",2241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1499F\":[\"Diameter Cuts\",1293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-BALNUM\":[\"Balanced Numbers\",1449,\"Cuban Olympiad in Informatics 2012 - Day 2 Problem A\"],\"洛谷-P6192\":[\"最小斯坦纳树\",3186,\"模板\"],\"洛谷-P3920\":[\"紫荆花之恋\",3155,\"WC2014\"],\"洛谷-P1742\":[\"最小圆覆盖\",3742,null],\"CodeForces-739E\":[\"Gosha is hunting\",2275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-580E\":[\"Kefa and Watch\",2150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2600\":[\"瞭望塔\",960,\"ZJOI2008\"],\"CodeForces-917D\":[\"Stranger Trees\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/917\\\"\\u003eCodeforces Round 459 (Div. 1)\\u003c/a\\u003e\"],\"黑暗爆炸-3944\":[\"Sum\",212,\"\"],\"洛谷-P9248\":[\"完美的集合\",47,\"集训队互测 2018\"],\"CSES-1685\":[\"New Flight Routes\",214,\"Additional Problems\"],\"洛谷-P2617\":[\"Dynamic Rankings\",11570,null],\"洛谷-P1527\":[\"矩阵乘法\",3879,\"国家集训队\"],\"洛谷-P2619\":[\"Tree I\",5229,\"国家集训队\"],\"黑暗爆炸-2839\":[\"集合计数\",624,\"\"],\"CodeForces-915E\":[\"Physical Education Lessons\",4334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8164\":[\"沙堡 2 (Sandcastle 2)\",80,\"JOI 2022 Final\"],\"洛谷-P9495\":[\"进行一个魔的除\",89,\"SFCOI-3\"],\"HackerRank-guardians-lunatics-ioi14\":[\"[IOI] Guardians of the Lunatics\",225,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/ioi-2014-practice-contest-2\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eioi-2014-practice-contest-2\\u003c/a\\u003e\"],\"AtCoder-agc056_b\":[\"Range Argmax\",44,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc056\\\"\\u003eAtCoder Grand Contest 056\\u003c/a\\u003e\"],\"OpenJ_Bailian-3463\":[\"How I Mathematician Wonder What You Are!\",17,\"Japan 2006\"],\"洛谷-P2622\":[\"关灯问题II\",6412,null],\"CodeForces-1738G\":[\"Anti-Increasing Addicts\",374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1738\\\"\\u003eCodeforces Global Round 22\\u003c/a\\u003e\"],\"OpenJ_Bailian-2131\":[\"Key Insertion\",5,\"Northeastern Europe 2003, Northern Subregion\"],\"洛谷-P2624\":[\"明明的烦恼\",1003,\"HNOI2008\"],\"HDU-6057\":[\"Kanade\\u0027s convolution\",190,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017+Multi-University+Training+Contest+-+Team+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017 Multi-University Training Contest - Team 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3959\":[\"宝藏\",14219,\"NOIP2017 提高组\"],\"AtCoder-abc314_h\":[\"Disk and Segments\",33,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc314\\\"\\u003eAtCoder Beginner Contest 314\\u003c/a\\u003e\"],\"CodeForces-914G\":[\"Sum the Fibonacci\",974,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"AtCoder-abc216_h\":[\"Random Robots\",20,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc216\\\"\\u003eAtCoder Beginner Contest 216\\u003c/a\\u003e\"],\"CodeForces-938G\":[\"Shortest Path Queries\",920,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/938\\\"\\u003eEducational Codeforces Round 38 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1051G\":[\"Distinctification\",413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1051\\\"\\u003eEducational Codeforces Round 51 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeChef-CUREK\":[\"Curing Kingdom\",38,\"lg5293\"],\"ZOJ-3494\":[\"BCD Code\",1334,null],\"洛谷-P3960\":[\"列队\",7975,\"NOIP2017 提高组\"],\"CodeForces-383E\":[\"Vowels\",2978,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/383\\\"\\u003eCodeforces Round 225 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1784\":[\"数独\",17808,null],\"CodeForces-165E\":[\"Compatible Numbers\",6999,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5904\":[\"HOT-Hotels 加强版\",1913,\"POI2014\"],\"洛谷-P3968\":[\"电源插排\",350,\"TJOI2014\"],\"洛谷-P3723\":[\"礼物\",3291,\"AH2017/HNOI2017\"],\"洛谷-P3729\":[\"曼哈顿计划EX\",172,null],\"OpenJ_Bailian-1039\":[\"Pipe\",108,\"Central Europe 1995\"],\"CodeForces-1098E\":[\"Fedya the Potter\",212,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1098\\\"\\u003eCodeforces Round 530 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-GCDMAT\":[\"GCD OF MATRIX\",266,\"own\"],\"洛谷-P7098\":[\"凉凉\",295,\"yLOI2020\"],\"洛谷-P7091\":[\"数上的树\",134,null],\"LibreOJ-2845\":[\"Innophone\",116,\"ROI 2018 Day 1\"],\"洛谷-P1792\":[\"种树\",3825,\"国家集训队\"],\"洛谷-P3974\":[\"组合数学\",1071,\"TJOI2015\"],\"OpenJ_Bailian-1066\":[\"Treasure Hunt\",52,\"East Central North America 1999\"],\"洛谷-P1552\":[\"派遣\",4748,\"APIO2012\"],\"洛谷-P3733\":[\"八纵八横\",1027,\"HAOI2017\"],\"洛谷-P4822\":[\"冻结\",5387,\"BJWC2012\"],\"CodeForces-451E\":[\"Devu and Flowers\",3908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/451\\\"\\u003eCodeforces Round 258 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3973\":[\"线性代数\",1264,\"TJOI2015\"],\"OpenJ_Bailian-2151\":[\"Check the difficulty of problems\",53,\"POJ Monthly,鲁小石\"],\"洛谷-P2403\":[\"所驼门王的宝藏\",2479,\"SDOI2010\"],\"CodeChef-REBXOR\":[\"Nikitosh and xor\",1192,\"rebryk\"],\"黑暗爆炸-4833\":[\"最小公倍佩尔数\",29,\"Lydsy1704月赛\"],\"CodeForces-1806C\":[\"Sequence Master\",7211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1806\\\"\\u003eCodeforces Round 858 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-475F\":[\"Meta-universe\",240,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/475\\\"\\u003eBayan 2015 Contest Warm Up\\u003c/a\\u003e\"],\"洛谷-P3980\":[\"志愿者招募\",3861,\"NOI2008\"],\"洛谷-P3987\":[\"我永远喜欢珂朵莉~\",2529,null],\"UVA-11921\":[\"Save the Princess\",39,null],\"洛谷-P9054\":[\"心跳排列图\",2,\"集训队互测 2022\"],\"黑暗爆炸-3971\":[\"Матрёшка\",29,\"WF2013\"],\"洛谷-P3750\":[\"分手是祝愿\",2990,\"六省联考 2017\"],\"洛谷-P2662\":[\"牛场围栏\",1295,null],\"洛谷-P4843\":[\"清理雪道\",1523,null],\"OpenJ_Bailian-2177\":[\"Ghost Busters\",1,\"Northeastern Europe 2002\"],\"洛谷-P3755\":[\"老C的任务\",1758,\"CQOI2017\"],\"洛谷-P4602\":[\"混合果汁\",2431,\"CTSC2018\"],\"OpenJ_Bailian-1083\":[\"Moving Tables\",321,\"Taejon 2001\"],\"洛谷-P1337\":[\"平衡点 / 吊打XXX\",14194,\"JSOI2004\"],\"洛谷-P4605\":[\"物理实验\",376,\"SDOI2018\"],\"洛谷-P4847\":[\"银河英雄传说V2\",688,null],\"AtCoder-abc271_h\":[\"General General\",49,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc271\\\"\\u003eKYOCERA Programming Contest 2022(AtCoder Beginner Contest 271)\\u003c/a\\u003e\"],\"洛谷-P1578\":[\"奶牛浴场\",1821,null],\"洛谷-P3759\":[\"不勤劳的图书管理员\",1243,\"TJOI2017\"],\"洛谷-P4606\":[\"战略游戏\",2327,\"SDOI2018\"],\"洛谷-P3515\":[\"Lightning Conductor\",3478,\"POI2011\"],\"洛谷-P3757\":[\"老C的键盘\",622,\"CQOI2017\"],\"CodeForces-1181E2\":[\"A Story of One Country (Hard)\",305,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc218_h\":[\"Red and Blue Lamps\",67,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc218\\\"\\u003eAtCoder Beginner Contest 218\\u003c/a\\u003e\"],\"Gym-101550I\":[\"Interception\",12,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101550\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2016)\\u003c/a\\u003e\"],\"OpenJ_Bailian-2165\":[\"Gunman\",8,\"Northeastern Europe 2004\"],\"洛谷-P3521\":[\"ROT-Tree Rotations\",3610,\"POI2011\"],\"洛谷-P1587\":[\"循环之美\",4792,\"NOI2016\"],\"洛谷-P3527\":[\"MET-Meteors\",4100,\"POI2011\"],\"洛谷-P4859\":[\"已经没有什么好害怕的了\",2217,null],\"Gym-103860I\":[\"Reverse LIS\",37,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103860\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 7th China Collegiate Programming Contest, Finals (CCPC Finals 2021)\\u003c/a\\u003e\"],\"AtCoder-abc260_g\":[\"Scalene Triangle Area\",203,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc260\\\"\\u003eAtCoder Beginner Contest 260\\u003c/a\\u003e\"],\"CodeChef-CHEFAOR\":[\"Chef and Bitwise OR Operation\",929,\"furko_adm\"],\"CodeForces-1187E\":[\"Tree Painting\",7891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1187C\":[\"Vasya And Array\",6287,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc305_h\":[\"Shojin\",10,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc305\\\"\\u003eKYOCERA Programming Contest 2023(AtCoder Beginner Contest 305)\\u003c/a\\u003e\"],\"黑暗爆炸-3512\":[\"DZY Loves Math IV\",184,\"\"],\"AtCoder-abc207_e\":[\"Mod i\",639,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc207\\\"\\u003eAtCoder Beginner Contest 207\\u003c/a\\u003e\"],\"洛谷-P1355\":[\"神秘大三角\",2533,null],\"洛谷-P6802\":[\"道路\",16,\"CEOI2020\"],\"HDU-2993\":[\"MAX Average Problem\",1012,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+19+-+Host+by+BNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 19 - Host by BNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-NUMOFPAL\":[\"Number of Palindromes\",1551,\"Udit Agarwal\"],\"CodeForces-576D\":[\"Flights for Regular Customers\",1378,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/576\\\"\\u003eCodeforces Round 319 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-576E\":[\"Painting Edges\",1150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/576\\\"\\u003eCodeforces Round 319 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3780\":[\"苹果树\",594,\"SDOI2017\"],\"洛谷-P4630\":[\"铁人两项\",3071,\"APIO2018\"],\"洛谷-P1361\":[\"小M的作物\",4450,null],\"洛谷-P3781\":[\"切树游戏\",387,\"SDOI2017\"],\"洛谷-P2210\":[\"Haywire\",3471,null],\"洛谷-P3545\":[\"HUR-Warehouse Store\",2154,\"POI2012\"],\"洛谷-P3301\":[\"方程\",618,\"SDOI2013\"],\"洛谷-P4632\":[\"新家\",678,\"APIO2018\"],\"CodeForces-333E\":[\"Summer Earnings\",1170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/333\\\"\\u003eCodeforces Round 194 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-115E\":[\"Linear Kingdom Races\",1511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/115\\\"\\u003eCodeforces Beta Round 87 (Div. 1 Only)\\u003c/a\\u003e\"],\"洛谷-P3306\":[\"随机数生成器\",2473,\"SDOI2013\"],\"UVA-10514\":[\"River Crossing\",300,null],\"洛谷-P3309\":[\"向量集\",667,\"SDOI2014\"],\"洛谷-P4884\":[\"多少个 1?\",2457,null],\"洛谷-P2221\":[\"高速公路\",2386,\"HAOI2012\"],\"UVA-1606\":[\"Amphiphilic Carbon Molecules\",759,null],\"洛谷-P4649\":[\"training 训练路径\",323,\"IOI2007\"],\"洛谷-P5979\":[\"Druzyny\",328,\"PA2014\"],\"洛谷-P3317\":[\"重建\",2196,\"SDOI2014\"],\"ZOJ-3537\":[\"Cake\",1577,null],\"洛谷-P2470\":[\"压缩\",2279,\"SCOI2007\"],\"洛谷-P2473\":[\"奖励关\",4659,\"SCOI2008\"],\"CodeForces-1559E\":[\"Mocha and Stars\",2253,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1559\\\"\\u003eCodeforces Round 738 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1387\":[\"最大正方形\",36993,null],\"洛谷-P4899\":[\"werewolf 狼人\",1568,\"IOI2018\"],\"洛谷-P6834\":[\"梦原\",404,\"Cnoi2020\"],\"AtCoder-arc100_c\":[\"Or Plus Max\",363,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc100\\\"\\u003eAtCoder Regular Contest 100\\u003c/a\\u003e\"],\"洛谷-P4655\":[\"Building Bridges\",2696,\"CEOI2017\"],\"洛谷-P3329\":[\"最小割\",1149,\"ZJOI2011\"],\"CodeForces-1208F\":[\"Bits And Pieces\",2241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1208\\\"\\u003eManthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-958E2\":[\"Guard Duty (medium)\",958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"洛谷-P5505\":[\"分特产\",1897,\"JSOI2011\"],\"CodeForces-573D\":[\"Bear and Cavalry\",506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/573\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-573E\":[\"Bear and Bowling\",1429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/573\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3332\":[\"K大数查询\",6003,\"ZJOI2013\"],\"洛谷-P1155\":[\"双栈排序\",5538,\"NOIP2008 提高组\"],\"洛谷-P1397\":[\"矩阵游戏\",2035,\"NOI2013\"],\"LibreOJ-3539\":[\"猫或狗\",78,\"JOI Open 2018\"],\"洛谷-P2485\":[\"计算器\",5569,\"SDOI2011\"],\"HDU-4979\":[\"A simple math problem.\",205,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Multi-University+Training+Contest+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2245\":[\"星际导航\",2679,null],\"洛谷-P4426\":[\"毒瘤\",811,\"HNOI/AHOI2018\"],\"HDU-4734\":[\"F(x)\",4113,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3338\":[\"力\",4629,\"ZJOI2014\"],\"OpenJ_Bailian-1584\":[\"A Round Peg in a Ground Hole\",12,\"Mid-Atlantic 2003\"],\"CodeForces-1821F\":[\"Timber\",712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1821\\\"\\u003eEducational Codeforces Round 147 (Rated for Div. 2)\\u003c/a\\u003e\"],\"OpenJ_Bailian-3520\":[\"Coin Toss\",11,\"Rocky Mountain 2007\"],\"CodeForces-1097G\":[\"Vladislav and a Great Legend\",704,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"CodeForces-798D\":[\"Mike and distribution\",2219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1182F\":[\"Maximum Sine\",342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-750E\":[\"New Year and Old Subsequence\",1582,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/750\\\"\\u003eGood Bye 2016\\u003c/a\\u003e\"],\"洛谷-P2495\":[\"消耗战\",9217,\"SDOI2011\"],\"洛谷-P3343\":[\"地震后的幻想乡\",1143,\"ZJOI2015\"],\"洛谷-P4433\":[\"ALADIN\",337,\"COCI2009-2010#1\"],\"洛谷-P3348\":[\"大森林\",1430,\"ZJOI2016\"],\"洛谷-P1169\":[\"棋盘制作\",8537,\"ZJOI2007\"],\"洛谷-P3588\":[\"PUS\",1053,\"POI2015\"],\"HDU-4507\":[\"吉哥系列故事——恨7不成妻\",2422,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%D2%BB%B3%A1%A3%A83%D4%C221%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第一场(3月21日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3652\":[\"B-number\",5513,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Chengdu+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Chengdu Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2477\":[\"Magic Cube\",518,null],\"CodeForces-1290F\":[\"Making Shapes\",374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1290\\\"\\u003eCodeforces Round 616 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-jag2018summer_day2_d\":[\"Knapsack And Queries\",12,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/jag2018summer-day2\\\"\\u003eJapan Alumni Group Summer Camp 2018 Day 2\\u003c/a\\u003e\"],\"洛谷-P3592\":[\"MYJ\",1154,\"POI2015\"],\"洛谷-P3354\":[\"Riv 河流\",2074,\"IOI2005\"],\"洛谷-P3355\":[\"骑士共存问题\",6120,null],\"洛谷-P3597\":[\"WYC\",409,\"POI2015\"],\"洛谷-P5774\":[\"病毒感染\",335,\"JSOI2016\"],\"HDU-3669\":[\"Cross the Wall\",480,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Harbin\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Harbin \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P4205\":[\"智慧珠游戏\",743,\"NOI2005\"],\"洛谷-P3117\":[\"Cow Rectangles G\",130,\"USACO15JAN\"],\"CodeForces-1734F\":[\"Zeros and Ones\",781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1734\\\"\\u003eCodeforces Round 822 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P6624\":[\"作业题\",1252,\"省选联考 2020 A 卷\"],\"HDU-4757\":[\"Tree\",943,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Nanjing+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Nanjing Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3357\":[\"最长k可重线段集问题\",1154,null],\"洛谷-P5776\":[\"Quare\",151,\"SNOI2013\"],\"洛谷-P7712\":[\"hlcpq\",149,\"Ynoi2077\"],\"洛谷-P3119\":[\"Grass Cownoisseur G\",4360,\"USACO15JAN\"],\"洛谷-P4208\":[\"最小生成树计数\",3207,\"JSOI2008\"],\"黑暗爆炸-2958\":[\"序列染色\",14,\"\"],\"洛谷-P3120\":[\"Cow Hopscotch G\",1133,\"USACO15FEB\"],\"CodeForces-772E\":[\"Verifying Kingdom\",123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/772\\\"\\u003eVK Cup 2017 - Round 2\\u003c/a\\u003e\"],\"CodeForces-772D\":[\"Varying Kibibits\",574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/772\\\"\\u003eVK Cup 2017 - Round 2\\u003c/a\\u003e\"],\"洛谷-P4212\":[\"外太空旅行\",1119,null],\"洛谷-P4454\":[\"破解D-H协议\",1464,\"CQOI2018\"],\"洛谷-P5544\":[\"炸弹攻击1\",2748,\"JSOI2016\"],\"洛谷-P6631\":[\"序列\",506,\"ZJOI2020\"],\"洛谷-P3364\":[\"Cool loves touli\",273,null],\"洛谷-P4214\":[\"Juice Junctions\",471,\"CERC2015\"],\"洛谷-P5787\":[\"二分图 /【模板】线段树分治\",5347,null],\"CodeForces-311E\":[\"Biologist\",1106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P7966\":[\"Hiperkocka\",46,\"COCI2021-2022#2\"],\"洛谷-P5308\":[\"Akvizna\",977,\"COCI2018-2019#4\"],\"HDU-2102\":[\"A计划\",7237,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-6+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-6 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-1113\":[\"Wall\",166,\"Northeastern Europe 2001\"],\"HDU-5852\":[\"Intersection is not allowed!\",242,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+Multi-University+Training+Contest+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-577B\":[\"Modulo Sum\",12599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/577\\\"\\u003eCodeforces Round 319 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4220\":[\"通道\",1192,\"WC2018\"],\"洛谷-P8820\":[\"数据传输\",1663,\"CSP-S 2022\"],\"洛谷-P2042\":[\"维护数列\",8734,\"NOI2005\"],\"洛谷-P5555\":[\"秩序魔咒\",888,null],\"洛谷-P3377\":[\"左偏树/可并堆\",16457,\"模板\"],\"洛谷-P2046\":[\"海拔\",1606,\"NOI2010\"],\"洛谷-P4221\":[\"州区划分\",1086,\"WC2018\"],\"洛谷-P4463\":[\"calc\",1180,\"集训队互测 2012\"],\"洛谷-P5795\":[\"异或运算\",719,\"THUSC2015\"],\"洛谷-P2287\":[\"最佳包裹\",395,\"HNOI2004\"],\"洛谷-P2048\":[\"超级钢琴\",7409,\"NOI2010\"],\"洛谷-P2289\":[\"邮递员\",1393,\"HNOI2004\"],\"AtCoder-agc060_e\":[\"Number of Cycles\",21,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc060\\\"\\u003eAtCoder Grand Contest 060\\u003c/a\\u003e\"],\"CodeForces-1009F\":[\"Dominant Indices\",5517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4229\":[\"某位歌姬的故事\",625,null],\"CodeForces-1312G\":[\"Autocompletion\",764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1578L\":[\"Labyrinth\",1107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1578\\\"\\u003eICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"HDU-6953\":[\"Another thief in a Shop\",71,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2021%A1%B0MINIEYE%B1%AD%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2021“MINIEYE杯”中国大学生算法设计超级联赛(1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3380\":[\"树套树\",10775,\"模板\"],\"洛谷-P2290\":[\"树的计数\",2373,\"HNOI2004\"],\"洛谷-P2051\":[\"中国象棋\",8386,\"AHOI2009\"],\"洛谷-P6893\":[\"Buffed Buffet\",91,\"ICPC2014 WF\"],\"CodeForces-730I\":[\"Olympiad in Programming and Sports\",2052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"洛谷-P4475\":[\"巧克力王国\",1026,null],\"洛谷-P4238\":[\"多项式乘法逆\",18466,\"模板\"],\"洛谷-P5328\":[\"浙江省选\",197,\"ZJOI2019\"],\"洛谷-P3147\":[\"262144 P\",7140,\"USACO16OPEN\"],\"洛谷-P5326\":[\"开关\",587,\"ZJOI2019\"],\"洛谷-P6657\":[\"LGV 引理\",1283,\"模板\"],\"UVA-10111\":[\"Find the Winning Move\",740,null],\"洛谷-P6419\":[\"Kamp\",2006,\"COCI2014-2015#1\"],\"CodeForces-1311F\":[\"Moving Points\",4103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-17E\":[\"Palisection\",1739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-1117F\":[\"Crisp String\",554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-4787\":[\"GRE Words Revenge\",427,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Chengdu+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"AtCoder-agc018_c\":[\"Coins\",201,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc018\\\"\\u003eAtCoder Grand Contest 018\\u003c/a\\u003e\"],\"CodeForces-995C\":[\"Leaving the Bar\",1747,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/995\\\"\\u003eCodeforces Round 492 (Div. 1) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"洛谷-P2061\":[\"City Horizon S\",2439,\"USACO07OPEN\"],\"洛谷-P4242\":[\"树上的毒瘤\",172,null],\"CodeForces-995F\":[\"Cowmpany Cowmpensation\",1228,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/995\\\"\\u003eCodeforces Round 492 (Div. 1) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"洛谷-P4482\":[\"Border 的四种求法\",789,\"BJWC2018\"],\"洛谷-P8844\":[\"小卡与落叶\",457,\"传智杯 #4 初赛\"],\"洛谷-P4245\":[\"任意模数多项式乘法\",8532,\"模板\"],\"洛谷-P5577\":[\"算力训练\",71,\"CmdOI2019\"],\"洛谷-P5576\":[\"口头禅\",345,\"CmdOI2019\"],\"洛谷-P6665\":[\"Alice 和 Bob 又在玩游戏\",308,\"清华集训2016\"],\"洛谷-P6663\":[\"Układ scalony\",219,\"POI 2019\"],\"洛谷-P5336\":[\"成绩单\",1706,\"THUSC2016\"],\"洛谷-P4009\":[\"汽车加油行驶问题\",3093,null],\"CodeForces-401D\":[\"Roman and Numbers\",4470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1770F\":[\"Koxia and Sequence\",637,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"CodeForces-449D\":[\"Jzzhu and Numbers\",4376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/449\\\"\\u003eCodeforces Round 257 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1334F\":[\"Strange Function\",1140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-558E\":[\"A Simple Task\",6145,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3160\":[\"局部极小值\",1092,\"CQOI2012\"],\"洛谷-P4491\":[\"染色\",1824,\"HAOI2018\"],\"CodeForces-1770G\":[\"Koxia and Bracket\",150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"洛谷-P4011\":[\"孤岛营救问题\",3630,null],\"洛谷-P4250\":[\"小凸想跑步\",570,\"SCOI2015\"],\"洛谷-P5104\":[\"红包发红包\",2955,null],\"洛谷-P5345\":[\"快乐肥宅\",164,\"XR-1\"],\"洛谷-P4012\":[\"深海机器人问题\",2060,null],\"洛谷-P4254\":[\"Blue Mary 开公司\",3962,\"JSOI2008\"],\"洛谷-P5586\":[\"序列 (加强版)\",530,\"P5350\"],\"HDU-1059\":[\"Dividing\",6921,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central European Regional Contest 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1442D\":[\"Sum\",2132,\"\\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\"],\"洛谷-P3170\":[\"标识设计\",575,\"CQOI2015\"],\"洛谷-P5591\":[\"小猪佩奇学数学\",691,null],\"洛谷-P2081\":[\"迷失游乐园\",1627,\"NOI2012\"],\"洛谷-P6442\":[\"KOŠARE\",596,\"COCI2011-2012#6\"],\"洛谷-P3175\":[\"按位或\",2566,\"HAOI2015\"],\"洛谷-P4262\":[\"白金元首与莫斯科\",413,\"Code+#3\"],\"洛谷-P5350\":[\"序列\",1296,null],\"洛谷-P8866\":[\"喵了个喵\",1650,\"NOIP2022\"],\"洛谷-P5356\":[\"由乃打扑克\",3069,\"Ynoi2017\"],\"洛谷-P3176\":[\"数字串拆分\",409,\"HAOI2015\"],\"LibreOJ-6627\":[\"等比数列三角形\",77,\"XXOI 2019\"],\"洛谷-P4027\":[\"货币兑换\",2768,\"NOI2007\"],\"洛谷-P4028\":[\"New Product\",409,null],\"OpenJ_Bailian-1739\":[\"Tony\\u0027s Tour\",33,\"LouTiancheng@POJ\"],\"洛谷-P5360\":[\"世界地图\",298,\"SDOI2019\"],\"洛谷-P6453\":[\"PERIODNI\",622,\"COCI2008-2009#4\"],\"CodeForces-710F\":[\"String Set Queries\",1821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"洛谷-P4278\":[\"带插入区间K小值\",1097,null],\"洛谷-P3187\":[\"最小矩形覆盖\",1749,\"HNOI2007\"],\"洛谷-P5366\":[\"遗失的答案\",449,\"SNOI2017\"],\"洛谷-P3188\":[\"梦幻岛宝珠\",2086,\"HNOI2007\"],\"洛谷-P6216\":[\"回文匹配\",1438,null],\"HDU-6761\":[\"Minimum Index\",320,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2020+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2020 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1775D\":[\"Friendly Spiders\",5852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1775\\\"\\u003eCodeforces Round 843 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3190\":[\"神奇游乐园\",1417,\"HNOI2007\"],\"CodeForces-600E\":[\"Lomsat gelral\",14322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"洛谷-P4043\":[\"支线剧情\",2133,\"AHOI2014/JSOI2014\"],\"洛谷-P5373\":[\"多项式复合函数\",489,\"模板\"],\"洛谷-P4284\":[\"概率充电器\",2987,\"SHOI2014\"],\"UVA-11475\":[\"Extend to Palindrome\",5689,null],\"OpenJ_Bailian-1765\":[\"November Rain\",6,\"Central Europe 2003\"],\"UVA-12327\":[\"Xavier is Learning to Count\",62,null],\"UVA-1409\":[\"Go to Class\",6,null],\"洛谷-P7560\":[\"フードコート\",341,\"JOISC 2021 Day1\"],\"CodeForces-865D\":[\"Buy Low Sell High\",5029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/865\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 2 (onsite finalists)\\u003c/a\\u003e\"],\"洛谷-P4294\":[\"游览计划\",1524,\"WC2008\"],\"洛谷-P4053\":[\"建筑抢修\",7822,\"JSOI2007\"],\"洛谷-P5383\":[\"普通多项式转下降幂多项式\",370,null],\"洛谷-P6478\":[\"游戏\",1465,\"NOI Online #2 提高组\"],\"洛谷-P4298\":[\"祭祀\",954,\"CTSC2008\"],\"AtCoder-arc164_e\":[\"Segment-Tree Optimization\",116,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc164\\\"\\u003eAtCoder Regular Contest 164\\u003c/a\\u003e\"],\"洛谷-P5387\":[\"人形演舞\",304,\"Cnoi2019\"],\"LibreOJ-3346\":[\"交换城市\",237,\"APIO2020\"],\"CodeForces-1228E\":[\"Another Filling the Grid\",2691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1228\\\"\\u003eCodeforces Round 589 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SUBWAYPL\":[\"Subway planning\",41,\"I maratón interuniversitaria del circuito Redis - Acis. Sedes: Politécnico - Javeriana\"],\"CodeForces-997E\":[\"Good Subsegments\",1123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/997\\\"\\u003eCodeforces Round 493 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5393\":[\"下降幂多项式转普通多项式\",306,null],\"洛谷-P6240\":[\"好吃的题目\",967,null],\"HDU-2181\":[\"哈密顿绕行世界问题\",5726,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Summer+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Summer Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-997C\":[\"Sky Full of Stars\",1836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/997\\\"\\u003eCodeforces Round 493 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5394\":[\"下降幂多项式乘法\",616,\"模板\"],\"洛谷-P4069\":[\"游戏\",1847,\"SDOI2016\"],\"洛谷-P5158\":[\"多项式快速插值\",1628,\"模板\"],\"洛谷-P6246\":[\"邮局 加强版\",1028,\"IOI2000\"],\"洛谷-P8421\":[\"rsraogps\",882,\"THUPC2022 决赛\"],\"HDU-3045\":[\"Picnic Cows\",921,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+14+-+Host+by+ZJNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 14 - Host by ZJNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1267G\":[\"Game Relics\",747,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1267\\\"\\u003e2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-835F\":[\"Roads in the Kingdom\",1101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4073\":[\"平面图\",258,\"WC2013\"],\"洛谷-P5163\":[\"WD与地图\",663,null],\"CodeChef-PANIC\":[\"Panic! at the Disco\",43,\"sjshohag\"],\"洛谷-P1801\":[\"黑匣子\",15572,null],\"LibreOJ-6274\":[\"数字\",281,null],\"HDU-4389\":[\"X mod f(x)\",1211,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-2069\":[\"Super Star\",43,\"Japan 2001\"],\"LibreOJ-115\":[\"无源汇有上下界可行流\",2588,null],\"LibreOJ-117\":[\"有源汇有上下界最小流\",2251,null],\"LibreOJ-116\":[\"有源汇有上下界最大流\",2907,null],\"洛谷-P5172\":[\"Sum\",452,null],\"洛谷-P5171\":[\"Earthquake\",813,null],\"AtCoder-abc200_d\":[\"Happy Birthday! 2\",1850,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc200\\\"\\u003eKYOCERA Programming Contest 2021(AtCoder Beginner Contest 200)\\u003c/a\\u003e\"],\"洛谷-P5170\":[\"类欧几里得算法\",2272,\"模板\"],\"洛谷-P7356\":[\"游戏\",117,\"PMOI-1\"],\"洛谷-P7116\":[\"微信步数\",1239,\"NOIP2020\"],\"洛谷-P6021\":[\"洪水\",686,null],\"洛谷-P7359\":[\"旅行\",132,\"JZOI-1\"],\"CodeForces-280D\":[\"k-Maximum Subsequence Sum\",1264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5179\":[\"Fraction\",894,null],\"POJ-2758\":[\"Checking the Text\",639,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"LibreOJ-6485\":[\"LJJ 学二项式定理\",658,null],\"CodeForces-1023G\":[\"Pisces\",114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1023\\\"\\u003eCodeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1156F\":[\"Card Bag\",1430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156E\":[\"Special Segments of Permutation\",2956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UniversalOJ-553\":[\"己酸集合\",232,\"UNR #4\"],\"洛谷-P4091\":[\"求和\",1840,\"HEOI2016/TJOI2016\"],\"CodeForces-833B\":[\"The Bakery\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1483F\":[\"Exam\",15,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1483\\\"\\u003eCodeforces Round 709 (Div. 1, based on Technocup 2021 Final Round)\\u003c/a\\u003e\"],\"洛谷-P4095\":[\"Eden 的新背包问题\",2257,\"HEOI2013\"],\"UniversalOJ-552\":[\"同构判定鸭\",147,\"UNR #4\"],\"洛谷-P6271\":[\"一个人的数论\",421,\"湖北省队互测2014\"],\"洛谷-P4093\":[\"序列\",2200,\"HEOI2016/TJOI2016\"],\"洛谷-P4098\":[\"ALO\",1461,\"HEOI2013\"],\"洛谷-P4099\":[\"SAO\",1577,\"HEOI2013\"],\"黑暗爆炸-1023\":[\"cactus仙人掌图\",132,\"SHOI2008\"],\"洛谷-P4097\":[\"李超线段树 / [HEOI2013] Segment\",6925,\"模板\"],\"AtCoder-arc162_f\":[\"Montage\",44,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc162\\\"\\u003eAtCoder Regular Contest 162\\u003c/a\\u003e\"],\"黑暗爆炸-3681\":[\"Arietta\",53,\"Shinrein祭 #1\"],\"CodeForces-55D\":[\"Beautiful numbers\",6034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"洛谷-P5192\":[\"Zoj3229 Shoot the Bullet|东方文花帖|【模板】有源汇上下界最大流\",2336,null],\"POJ-3429\":[\"Geometry with a ruler\",248,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2006\\\"\\u003eNortheastern Europe 2006\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"CodeForces-900D\":[\"Unusual Sequences\",3273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"HDU-3085\":[\"Nightmare Ⅱ\",1653,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2nd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2nd “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1464\":[\"Traffic Real Time Query System\",357,null],\"黑暗爆炸-4316\":[\"小C的独立集\",170,\"\"],\"AtCoder-abc300_h\":[\"Fibonacci: Revisited\",29,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc300\\\"\\u003eUNIQUE VISION Programming Contest 2023 Spring(AtCoder Beginner Contest 300)\\u003c/a\\u003e\"],\"洛谷-P2939\":[\"Revamping Trails G\",6688,\"USACO09FEB\"],\"洛谷-P7390\":[\"造树\",119,\"EZEC-6\"],\"洛谷-P6061\":[\"疫情调查\",314,\"加油武汉\"],\"黑暗爆炸-2125\":[\"最短路\",140,\"\"],\"洛谷-P8006\":[\"String Rearrangement in Phantom\",33,null],\"洛谷-P9575\":[\"喵了个喵 Ⅳ\",301,\"TAOI-2\"],\"洛谷-P9335\":[\"雪に咲く花\",342,\"Ynoi2001\"],\"洛谷-P1850\":[\"换教室\",14281,\"NOIP2016 提高组\"],\"UVA-1489\":[\"Math teacher\\u0027s homework\",58,null],\"CodeForces-1245D\":[\"Shichikuji and Power Grid\",7432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2949\":[\"Work Scheduling G\",7285,\"USACO09OPEN\"],\"QOJ-4815\":[\"Flower\\u0027s Land\",117,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1010\\\"\\u003ePetrozavodsk Summer 2022. Day 3. Qingyu, flower and their friends’ Contest\\u003c/a\\u003e\"],\"CodeForces-838C\":[\"Future Failure\",317,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/838\\\"\\u003eIndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)\\u003c/a\\u003e\"],\"洛谷-P7163\":[\"Svjetlo\",237,\"COCI2020-2021#2\"],\"CodeForces-704E\":[\"Iron Man\",306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/704\\\"\\u003eCodeforces Round 366 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P8253\":[\"如何正确地排序\",921,\"NOI Online 2022 提高组\"],\"CodeForces-1681F\":[\"Unique Occurrences\",1553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1681\\\"\\u003eEducational Codeforces Round 129 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-922F\":[\"Divisibility\",643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-agc002_d\":[\"Stamp Rally\",364,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc002\\\"\\u003eAtCoder Grand Contest 002\\u003c/a\\u003e\"],\"洛谷-P3803\":[\"多项式乘法(FFT)\",55739,\"模板\"],\"洛谷-P2713\":[\"罗马游戏\",3369,null],\"CodeForces-1486E\":[\"Paired Payment\",2858,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1111E\":[\"Tree\",903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P6086\":[\"Prufer 序列\",2273,\"模板\"],\"AtCoder-agc059_f\":[\"LIDS\",2,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc059\\\"\\u003eAtCoder Grand Contest 059\\u003c/a\\u003e\"],\"AtCoder-agc059_e\":[\"Grid 3-coloring\",12,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc059\\\"\\u003eAtCoder Grand Contest 059\\u003c/a\\u003e\"],\"UVA-1497\":[\"A Letter to Programmers\",11,null],\"洛谷-P9591\":[\"PFL 变换\",156,\"PFLOI R1\"],\"AtCoder-agc059_a\":[\"My Last ABC Problem\",338,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc059\\\"\\u003eAtCoder Grand Contest 059\\u003c/a\\u003e\"],\"洛谷-P6088\":[\"字符串树\",644,\"JSOI2015\"],\"AtCoder-agc013_e\":[\"Placing Squares\",148,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc013\\\"\\u003eAtCoder Grand Contest 013\\u003c/a\\u003e\"],\"AtCoder-abc313_g\":[\"Redistribution of Piles\",165,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc313\\\"\\u003eAtCoder Beginner Contest 313\\u003c/a\\u003e\"],\"OpenJ_Bailian-1385\":[\"Lifting the Stone\",17,\"Central Europe 1999\"],\"POJ-3227\":[\"Mountains\",377,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouth+Central+China+2007+hosted+by+NUDT\\\"\\u003eSouth Central China 2007 hosted by NUDT\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-156D\":[\"Clues\",1553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/156\\\"\\u003eCodeforces Round 110 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-241B\":[\"Friends\",796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/241\\\"\\u003eBayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)\\u003c/a\\u003e\"],\"黑暗爆炸-4916\":[\"神犇和蒟蒻\",128,\"\"],\"UniversalOJ-179\":[\"线性规划\",59,null],\"黑暗爆炸-1402\":[\"Ticket to Ride\",22,\"\"],\"洛谷-P6097\":[\"子集卷积\",2778,\"模板\"],\"HDU-6152\":[\"Friend-Graph\",1473,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC+-+%CD%F8%C2%E7%D1%A1%B0%CE%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017中国大学生程序设计竞赛 - 网络选拔赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-6394\":[\"Tree\",242,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2018+Multi-University+Training+Contest+7\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2018 Multi-University Training Contest 7 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"AtCoder-agc022_e\":[\"Median Replace\",129,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc022\\\"\\u003eAtCoder Grand Contest 022\\u003c/a\\u003e\"],\"AtCoder-abc302_h\":[\"Ball Collector\",139,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc302\\\"\\u003eTOYOTA MOTOR CORPORATION Programming Contest 2023#2 (AtCoder Beginner Contest 302)\\u003c/a\\u003e\"],\"CodeForces-1618G\":[\"Trader Problem\",1545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1618\\\"\\u003eCodeforces Round 760 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P1646\":[\"happiness\",2491,\"国家集训队\"],\"洛谷-P3829\":[\"信用卡凸包\",2916,\"SHOI2012\"],\"OpenJ_Bailian-3799\":[\"Rotating Scoreboard\",21,\"Tehran 2006 Preliminary\"],\"OpenJ_Bailian-3795\":[\"Football\",7,\"Stanford Local 2006\"],\"UniversalOJ-87\":[\"mx的仙人掌\",246,null],\"HDU-6166\":[\"Senior Pan\",566,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017+Multi-University+Training+Contest+-+Team+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017 Multi-University Training Contest - Team 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UniversalOJ-189\":[\"火车司机出秦川\",55,\"集训队互测2016\"],\"AtCoder-agc033_d\":[\"Complexity\",163,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc033\\\"\\u003eAtCoder Grand Contest 033\\u003c/a\\u003e\"],\"CodeForces-590E\":[\"Birthday\",774,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/590\\\"\\u003eCodeforces Round 327 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2742\":[\"圈奶牛Fencing the Cows /【模板】二维凸包\",15514,\"USACO5.1\"],\"洛谷-P3830\":[\"随机树\",1543,\"SHOI2012\"],\"洛谷-P2503\":[\"均分数据\",4561,\"HAOI2006\"],\"洛谷-P2986\":[\"Great Cow Gathering G\",8764,\"USACO10MAR\"],\"洛谷-P4929\":[\"舞蹈链(DLX)\",3702,\"模板\"],\"OpenJ_Bailian-2018\":[\"Best Cow Fences\",90,\"USACO 2003 March Green\"],\"UniversalOJ-158\":[\"静态仙人掌\",125,\"清华集训2015\"],\"CodeForces-817F\":[\"MEX Queries\",2587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"洛谷-P8290\":[\"填树\",893,\"省选联考 2022\"],\"洛谷-P9140\":[\"背包\",449,\"THUPC 2023 初赛\"],\"UVA-751\":[\"Triangle War\",206,null],\"洛谷-P3600\":[\"随机数生成器\",848,null],\"洛谷-P3846\":[\"可爱的质数/【模板】BSGS\",10583,\"TJOI2007\"],\"洛谷-P2757\":[\"等差子序列\",2458,\"国家集训队\"],\"洛谷-P3603\":[\"雪辉\",490,null],\"洛谷-P3607\":[\"Subsequence Reversal P\",596,\"USACO17JAN\"],\"CodeForces-708C\":[\"Centroids\",3172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-agc057_f\":[\"Reflection\",3,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc057\\\"\\u003eAtCoder Grand Contest 057\\u003c/a\\u003e\"],\"AtCoder-agc011_f\":[\"Train Service Planning\",26,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc011\\\"\\u003eAtCoder Grand Contest 011\\u003c/a\\u003e\"],\"洛谷-P2761\":[\"软件补丁问题\",2838,null],\"SPOJ-LARMY\":[\"Lannister Army\",400,\"Code Rush 2017, IIT (ISM), Dhanbad\"],\"洛谷-P2762\":[\"太空飞行计划问题\",5528,null],\"OpenJ_Bailian-2031\":[\"Building a Space Station\",105,\"Japan 2003 Domestic\"],\"洛谷-P4703\":[\"偷上网\",1392,null],\"CodeForces-1045A\":[\"Last chance\",351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"洛谷-P4707\":[\"重返现世\",1479,null],\"CodeForces-1178G\":[\"The Awesomest Vertex\",416,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"CodeForces-909F\":[\"AND-permutations\",555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"UVA-1060\":[\"Collecting Luggage\",60,null],\"CodeForces-1709E\":[\"XOR Tree\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"AtCoder-agc020_e\":[\"Encoding Subsets\",153,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc020\\\"\\u003eAtCoder Grand Contest 020\\u003c/a\\u003e\"],\"CodeForces-487E\":[\"Tourists\",2333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/487\\\"\\u003eCodeforces Round 278 (Div. 1)\\u003c/a\\u003e\"],\"UniversalOJ-37\":[\"主旋律\",795,\"清华集训2014\"],\"洛谷-P3620\":[\"数据备份\",4922,\"APIO/CTSC2007\"],\"洛谷-P2533\":[\"信号塔\",1270,\"AHOI2012\"],\"洛谷-P4719\":[\"\\\"动态 DP\\\"\\u0026动态树分治\",6834,\"模板\"],\"洛谷-P4717\":[\"快速莫比乌斯/沃尔什变换 (FMT/FWT)\",6690,\"模板\"],\"AtCoder-abc304_g\":[\"Max of Medians\",23,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc304\\\"\\u003eTokio Marine \\u0026amp; Nichido Fire Insurance Programming Contest 2023(AtCoder Beginner Contest 304)\\u003c/a\\u003e\"],\"CodeForces-1286D\":[\"LCC\",608,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1286\\\"\\u003eCodeforces Round 612 (Div. 1)\\u003c/a\\u003e\"],\"UniversalOJ-46\":[\"玄学\",507,\"清华集训2014\"],\"洛谷-P1692\":[\"部落卫队\",4636,null],\"洛谷-P1452\":[\"旋转卡壳 | [USACO03FALL] Beauty Contest G\",7364,\"模板\"],\"洛谷-P5811\":[\"景点划分\",356,\"IOI2019\"],\"洛谷-P1456\":[\"Monkey King\",4465,null],\"洛谷-P4721\":[\"分治 FFT\",6828,\"模板\"],\"洛谷-P2305\":[\"购票\",2258,\"NOI2014\"],\"洛谷-P4726\":[\"多项式指数函数(多项式 exp)\",11349,\"模板\"],\"洛谷-P3638\":[\"机器人\",395,\"APIO2013\"],\"洛谷-P3878\":[\"分金币\",5005,\"TJOI2010\"],\"洛谷-P4725\":[\"多项式对数函数(多项式 ln)\",8733,\"模板\"],\"CodeForces-1706E\":[\"Qpwoeirut and Vertices\",2470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6289\":[\"花朵\",354,null],\"洛谷-P3886\":[\"神秘的生物\",541,\"JLOI2009\"],\"洛谷-P3403\":[\"跳楼机\",4902,null],\"洛谷-P3642\":[\"烟火表演\",1098,\"APIO2016\"],\"OpenJ_Bailian-2043\":[\"Area of Polygons\",8,\"Japan 2003,Aizu\"],\"洛谷-P3643\":[\"划艇\",1393,\"APIO2016\"],\"AtCoder-abc283_h\":[\"Popcount Sum\",65,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc283\\\"\\u003eUNIQUE VISION Programming Contest 2022 Winter(AtCoder Beginner Contest 283)\\u003c/a\\u003e\"],\"洛谷-P4735\":[\"最大异或和\",8125,null],\"洛谷-P3647\":[\"连珠线\",1467,\"APIO2014\"],\"洛谷-P4739\":[\"Donut Drone\",292,\"CERC2017\"],\"CodeForces-906E\":[\"Reverses\",484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/906\\\"\\u003eCodeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1175E\":[\"Minimal Segment Cover\",3597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6295\":[\"无意识之外的捉迷藏\",30,null],\"OpenJ_Bailian-2046\":[\"Gap\",10,\"Japan 2003,Aizu\"],\"CodeForces-1175G\":[\"Yet Another Partiton Problem\",478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-3709\":[\"Balanced Number\",3635,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Chengdu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"QOJ-4893\":[\"Imbalance\",6,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/754\\\"\\u003e2021 集训队互测 Round 2\\u003c/a\\u003e\"],\"UniversalOJ-23\":[\"跳蚤国王下江南\",192,\"UR #1\"],\"洛谷-P4983\":[\"忘情\",1446,null],\"洛谷-P4502\":[\"保镖\",68,\"ZJOI2018\"],\"洛谷-P2567\":[\"幸运数字\",2244,\"SCOI2010\"],\"CodeForces-455E\":[\"Function\",733,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/455\\\"\\u003eCodeforces Round 260 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3899\":[\"更为厉害\",3407,\"湖南集训\"],\"HDU-1300\":[\"Pearls\",1732,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorthwestern+Europe+2002\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Northwestern Europe 2002 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-891C\":[\"Envy\",2415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/891\\\"\\u003eCodeforces Round 446 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4751\":[\"\\\"动态DP\\\"\\u0026动态树分治(加强版)\",1796,\"模板\"],\"AtCoder-agc041_f\":[\"Histogram Rooks\",17,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc041\\\"\\u003eAtCoder Grand Contest 041\\u003c/a\\u003e\"],\"洛谷-P1484\":[\"种树\",5356,null],\"洛谷-P4755\":[\"Beautiful Pair\",1323,null],\"HDU-4825\":[\"Xor Sum\",4093,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014%C4%EA%B0%D9%B6%C8%D6%AE%D0%C7%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%D7%CA%B8%F1%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014年百度之星程序设计大赛 - 资格赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1416E\":[\"Split\",274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1416\\\"\\u003eCodeforces Round 673 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P1486\":[\"郁闷的出纳员\",10635,\"NOI2004\"],\"洛谷-P6932\":[\"Money for Nothing\",336,\"ICPC2017 WF\"],\"洛谷-P4512\":[\"多项式除法\",6020,\"模板\"],\"CodeForces-321E\":[\"Ciel and Gondolas\",5088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"HDU-5917\":[\"Instability\",359,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8%B3%A4%B4%BA%A3%A9-%D6%D8%CF%D6%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016中国大学生程序设计竞赛(长春)-重现赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2337\":[\"喵星人的入侵\",1218,\"SCOI2012\"],\"SPOJ-CNTPRIME\":[\"Counting Primes\",1764,\"Own Problem\"],\"洛谷-P2339\":[\"Turning in Homework G\",923,\"USACO04OPEN\"],\"洛谷-P5608\":[\"文化课\",255,\"Ynoi2013\"],\"HDU-7095\":[\"Add or Multiply 1\",175,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2021+%C4%EA%B0%D9%B6%C8%D6%AE%D0%C7%A1%A4%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B8%B4%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2021 年百度之星·程序设计大赛 - 复赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5909\":[\"Tree Cutting\",755,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2388\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #88 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3431\":[\"AUT-The Bus\",1152,\"POI2005\"],\"洛谷-P5610\":[\"大学\",1051,\"Ynoi2013\"],\"洛谷-P1251\":[\"餐巾计划问题\",7491,null],\"洛谷-P6940\":[\"Visual Python++\",133,\"ICPC2017 WF\"],\"洛谷-P4766\":[\"Outer space invaders\",1500,\"CERC2014\"],\"洛谷-P4525\":[\"自适应辛普森法 1\",4119,\"模板\"],\"洛谷-P5612\":[\"Ynoi\",41,\"Ynoi2013\"],\"洛谷-P1257\":[\"平面上的最接近点对\",15937,null],\"洛谷-P2107\":[\"小Z的AK计划\",2998,null],\"洛谷-P4768\":[\"归程\",6828,\"NOI2018\"],\"洛谷-P3437\":[\"TET-Tetris 3D\",1382,\"POI2006\"],\"CodeForces-1548B\":[\"Integers Have Friends\",9358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1548\\\"\\u003eCodeforces Round 736 (Div. 1)\\u003c/a\\u003e\"],\"OpenJ_Bailian-3868\":[\"K-Anonymous Sequence\",17,\"\"],\"HDU-1560\":[\"DNA sequence\",2042,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-12+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-12 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1500F\":[\"Cupboards Jumps\",367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1500\\\"\\u003eCodeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"洛谷-P2351\":[\"吊灯\",448,\"SDOI2012\"],\"洛谷-P3201\":[\"梦幻布丁\",4605,\"HNOI2009\"],\"洛谷-P2596\":[\"书架\",4615,\"ZJOI2006\"],\"CodeForces-1305C\":[\"Kuroni and Impossible Calculation\",14415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1305\\\"\\u003eOzon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)\\u003c/a\\u003e\"],\"CodeForces-452F\":[\"Permutation\",1506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-343E\":[\"Pumping Stations\",755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/343\\\"\\u003eCodeforces Round 200 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-125E\":[\"MST Company\",1141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-149D\":[\"Coloring Brackets\",4951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-258B\":[\"Little Elephant and Elections\",1658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/258\\\"\\u003eCodeforces Round 157 (Div. 1)\\u003c/a\\u003e\"],\"OpenJ_Bailian-3851\":[\"Bridge Across Islands\",6,\"POJ Founder Monthly Contest – 2008.06.29, Lei Tao\"],\"Gym-102759C\":[\"Economic One-way Roads\",118,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102759\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXXI Open Cup, Grand Prix of Korea\\u003c/a\\u003e\"],\"洛谷-P4781\":[\"拉格朗日插值\",8072,\"模板\"],\"AtCoder-abc262_h\":[\"Max Limited Sequence\",35,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc262\\\"\\u003eAtCoder Beginner Contest 262\\u003c/a\\u003e\"],\"洛谷-P3212\":[\"任务调度\",367,\"HNOI2011\"],\"洛谷-P5633\":[\"最小度限制生成树\",1595,null],\"洛谷-P4309\":[\"最长上升子序列\",2194,\"TJOI2013\"],\"AtCoder-jsc2021_g\":[\"Spanning Tree\",118,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/jsc2021\\\"\\u003eJapanese Student Championship 2021\\u003c/a\\u003e\"],\"CodeForces-786B\":[\"Legacy\",5892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-568E\":[\"Longest Increasing Subsequence\",609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/568\\\"\\u003eCodeforces Round 315 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2371\":[\"墨墨的等式\",4157,\"国家集训队\"],\"洛谷-P4553\":[\"80人环游世界\",1083,null],\"洛谷-P5643\":[\"随机游走\",1142,\"PKUWC2018\"],\"洛谷-P1284\":[\"三角形牧场\",5106,null],\"洛谷-P4312\":[\"OTOCI\",1171,\"COI2009\"],\"洛谷-P5642\":[\"人造情感(emotion)\",131,null],\"洛谷-P4551\":[\"最长异或路径\",12186,null],\"洛谷-P4557\":[\"战争\",1848,\"JSOI2018\"],\"洛谷-P3224\":[\"永无乡\",9681,\"HNOI2012\"],\"洛谷-P4313\":[\"文理分科\",3688,null],\"洛谷-P5403\":[\"田野\",323,\"CTS2019\"],\"HDU-5713\":[\"K个联通块\",189,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%26quot%3B%B0%D9%B6%C8%D6%AE%D0%C7%26quot%3B+-+%B8%B4%C8%FC%A3%A8Astar+Round3%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016\\\"百度之星\\\" - 复赛(Astar Round3) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2137\":[\"Gty的妹子树\",771,null],\"洛谷-P4556\":[\"雨天的尾巴 /【模板】线段树合并\",11937,\"Vani有约会\"],\"CodeForces-1638E\":[\"Colorful Operations\",1850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1638\\\"\\u003eCodeforces Round 771 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4318\":[\"完全平方数\",2188,null],\"HDU-3533\":[\"Escape\",912,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A810%A3%A9%A1%AA%A1%AAHost+by+HEU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(10)——Host by HEU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-1696\":[\"Space Ant\",62,\"Tehran 1999\"],\"Gym-104053J\":[\"Math Exam\",35,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"Baekjoon-5498\":[\"Batch Scheduling\",95,\"\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/2\\\"\\u003eOlympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/99\\\"\\u003eInternational Olympiad in Informatics\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/562\\\"\\u003eIOI 2002\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/2643\\\"\\u003eDay 2\\u003c/a\\u003e\\u0026nbsp;4번\"],\"洛谷-P3233\":[\"世界树\",2490,\"HNOI2014\"],\"洛谷-P4564\":[\"假面\",415,\"CTSC2018\"],\"洛谷-P5896\":[\"aliens\",360,\"IOI2016\"],\"洛谷-P4323\":[\"独特的树叶\",1081,\"JSOI2016\"],\"洛谷-P4565\":[\"暴力写挂\",894,\"CTSC2018\"],\"洛谷-P4320\":[\"道路相遇\",1670,null],\"洛谷-P2144\":[\"轮状病毒\",2427,\"FJOI2007\"],\"洛谷-P3474\":[\"KUP-Plot purchase\",327,\"POI2008\"],\"CodeForces-1613D\":[\"MEX Sequences\",4504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1613\\\"\\u003eEducational Codeforces Round 118 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2147\":[\"洞穴勘测\",5798,\"SDOI2008\"],\"洛谷-P4568\":[\"飞行路线\",16634,\"JLOI2011\"],\"洛谷-P4569\":[\"禁忌\",408,\"BJWC2011\"],\"CodeForces-1613F\":[\"Tree Coloring\",674,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1613\\\"\\u003eEducational Codeforces Round 118 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4324\":[\"扭动的回文串\",621,\"JSOI2016\"],\"洛谷-P3478\":[\"STA-Station\",10817,\"POI2008\"],\"LibreOJ-2760\":[\"裁剪线\",108,\"JOI 2014 Final\"],\"Baekjoon-7695\":[\"Brackets\",20,\"\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/5\\\"\\u003eUniversity\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/219\\\"\\u003eStanford Local ACM Programming Contest\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/926\\\"\\u003eSLPC 2004\\u003c/a\\u003e\\u0026nbsp;5번\"],\"洛谷-P3239\":[\"亚瑟王\",2173,\"HNOI2015\"],\"CodeForces-348D\":[\"Turtles\",1689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/348\\\"\\u003eCodeforces Round 202 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-542A\":[\"Place Your Ad Here\",553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/542\\\"\\u003eVK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"洛谷-P7842\":[\"探险者笔记 III\",69,\"C.E.L.U-03\"],\"洛谷-P4576\":[\"棋盘游戏\",558,\"CQOI2013\"],\"洛谷-P3242\":[\"接水果\",1420,\"HNOI2015\"],\"洛谷-P4331\":[\"Sequence 数字序列\",2130,\"BalticOI 2004\"],\"UniversalOJ-191\":[\"Unknown\",135,\"集训队互测2016\"],\"洛谷-P3248\":[\"树\",759,\"HNOI2016\"],\"洛谷-P3249\":[\"矿区\",411,\"HNOI2016\"],\"洛谷-P4577\":[\"领导集团问题\",1278,\"FJOI2018\"],\"洛谷-P3247\":[\"最小公倍数\",1130,\"HNOI2016\"],\"HDU-3555\":[\"Bomb\",8226,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A812%A3%A9%A1%AA%A1%AAHost+by+WHU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(12)——Host by WHU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3469\":[\"Food Delivery\",2195,null],\"洛谷-P2163\":[\"园丁的烦恼\",4339,\"SHOI2007\"],\"洛谷-P3250\":[\"网络\",1613,\"HNOI2016\"],\"洛谷-P3497\":[\"KOL-Railway\",118,\"POI2010\"],\"洛谷-P3256\":[\"赛车\",1108,\"JLOI2013\"],\"洛谷-P4103\":[\"大工程\",2930,\"HEOI2014\"],\"洛谷-P5432\":[\"A/B Problem(高精度除法)\",521,null],\"洛谷-P3254\":[\"圆桌问题\",6295,null],\"AtCoder-arc156_d\":[\"Xor Sum 5\",153,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc156\\\"\\u003eAtCoder Regular Contest 156\\u003c/a\\u003e\"],\"黑暗爆炸-4350\":[\"括号序列再战猪猪侠\",47,\"\"],\"洛谷-P5437\":[\"约定\",278,\"XR-2\"],\"UVA-1301\":[\"Fishnet\",78,null],\"洛谷-P5439\":[\"永恒\",214,\"XR-2\"],\"CodeForces-1215F\":[\"Radio Stations\",971,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1106F\":[\"Lunar New Year and a Recursive Sequence\",1007,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1106\\\"\\u003eCodeforces Round 536 (Div. 2)\\u003c/a\\u003e\"],\"CodeChef-SELEDGE\":[\"Selecting Edges\",43,\"ratingoverflow\"],\"HDU-3567\":[\"Eight II\",1182,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A813%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(13)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1324F\":[\"Maximum White Subtree\",9406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"HDU-3565\":[\"Bi-peak Number\",282,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A813%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(13)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-1819\":[\"Disks\",2,\"Romania OI 2002\"],\"洛谷-P4590\":[\"游园会\",1449,\"TJOI2018\"],\"洛谷-P1081\":[\"开车旅行\",10126,\"NOIP2012 提高组\"],\"洛谷-P3262\":[\"战争调度\",694,\"JLOI2015\"],\"AtCoder-abc253_h\":[\"We Love Forest\",67,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc253\\\"\\u003eNOMURA Programming Contest 2022(AtCoder Beginner Contest 253)\\u003c/a\\u003e\"],\"CodeForces-960F\":[\"Pathwalks\",2850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"洛谷-P3261\":[\"城池攻占\",3062,\"JLOI2015\"],\"洛谷-P4592\":[\"异或\",1979,\"TJOI2018\"],\"洛谷-P5680\":[\"共享单车\",242,\"GZOI2017\"],\"洛谷-P3266\":[\"骗我呢\",1143,\"JLOI2015\"],\"洛谷-P4597\":[\"序列 sequence\",2650,null],\"洛谷-P5445\":[\"路灯\",1074,\"APIO2019\"],\"洛谷-P3264\":[\"管道连接\",1130,\"JLOI2015\"],\"洛谷-P4111\":[\"小 Z 的房间\",2294,\"HEOI2015\"],\"洛谷-P5443\":[\"桥梁\",1140,\"APIO2019\"],\"洛谷-P5685\":[\"快乐的 JYY\",702,\"JSOI2013\"],\"洛谷-P4359\":[\"伪光滑数\",484,\"CQOI2016\"],\"洛谷-P5206\":[\"数树\",504,\"WC2019\"],\"洛谷-P4357\":[\"K 远点对\",2035,\"CQOI2016\"],\"洛谷-P5205\":[\"多项式开根\",6732,\"模板\"],\"洛谷-P5446\":[\"绿绿和串串\",1864,\"THUPC2018\"],\"CodeForces-1105C\":[\"Ayoub and Lost Array\",11043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1105\\\"\\u003eCodeforces Round 533 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-414C\":[\"Mashmokh and Reverse Operation\",2260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/414\\\"\\u003eCodeforces Round 240 (Div. 1)\\u003c/a\\u003e\"],\"HDU-3335\":[\"Divisibility\",765,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-329C\":[\"Graph Reconstruction\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/329\\\"\\u003eCodeforces Round 192 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3273\":[\"棘手的操作\",1202,\"SCOI2011\"],\"CodeForces-741D\":[\"Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths\",2768,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5693\":[\"EI 的第六分块\",508,null],\"洛谷-P3272\":[\"地板\",769,\"SCOI2011\"],\"CodeForces-4D\":[\"Mysterious Present\",10534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"黑暗爆炸-2164\":[\"采矿\",37,\"\"],\"洛谷-P5214\":[\"神奇化合物\",256,\"SHOI2014\"],\"洛谷-P5454\":[\"城市地铁规划\",345,\"THUPC2018\"],\"黑暗爆炸-2162\":[\"男生女生\",13,\"\"],\"洛谷-P4123\":[\"不同的最小割\",1294,\"CQOI2016\"],\"洛谷-P4365\":[\"秘密袭击 coat\",1140,\"九省联考 2018\"],\"洛谷-P5211\":[\"字符串\",197,\"ZJOI2017\"],\"洛谷-P5218\":[\"无聊的水题 II\",265,null],\"AtCoder-agc061_c\":[\"First Come First Serve\",155,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc061\\\"\\u003eAtCoder Grand Contest 061\\u003c/a\\u003e\"],\"洛谷-P5217\":[\"贫穷\",287,null],\"洛谷-P5459\":[\"回转寿司\",3121,\"BJOI2016\"],\"洛谷-P4127\":[\"同类分布\",4787,\"AHOI2009\"],\"CodeForces-1019E\":[\"Raining season\",354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1019\\\"\\u003eCodeforces Round 503 (by SIS, Div. 1)\\u003c/a\\u003e\"],\"HDU-5521\":[\"Meeting\",1762,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015ACM%2FICPC%D1%C7%D6%DE%C7%F8%C9%F2%D1%F4%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5762\":[\"Teacher Bo\",1140,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-26C\":[\"Parquet\",930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"LightOJ-1422\":[\"Halloween Costumes\",3116,null],\"洛谷-P4132\":[\"算不出的等式\",958,\"BJOI2012\"],\"洛谷-P6792\":[\"区间和\",636,\"SNOI2020\"],\"黑暗爆炸-4361\":[\"isn\",141,\"\"],\"洛谷-P5469\":[\"机器人\",571,\"NOI2019\"],\"CodeForces-436E\":[\"Cardboard Box\",1295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/436\\\"\\u003eZepto Code Rush 2014\\u003c/a\\u003e\"],\"CodeForces-109D\":[\"Lucky Sorting\",671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/109\\\"\\u003eCodeforces Beta Round 84 (Div. 1 Only)\\u003c/a\\u003e\"],\"HDU-5536\":[\"Chip Factory\",2928,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015ACM%2FICPC%D1%C7%D6%DE%C7%F8%B3%A4%B4%BA%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%CA%A6%B4%F3%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1454E\":[\"Number of Simple Paths\",5702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P5470\":[\"序列\",1235,\"NOI2019\"],\"CodeForces-678F\":[\"Lena and Queries\",898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-896C\":[\"Willem, Chtholly and Seniorious\",3293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/896\\\"\\u003eCodeforces Round 449 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3290\":[\"围棋\",444,\"SCOI2016\"],\"AtCoder-abc266_f\":[\"Well-defined Path Queries on a Namori\",1200,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc266\\\"\\u003eAtCoder Beginner Contest 266\\u003c/a\\u003e\"],\"洛谷-P5472\":[\"斗主地\",557,\"NOI2019\"],\"洛谷-P7413\":[\"Stone Game G\",199,\"USACO21FEB\"],\"洛谷-P3052\":[\"Cows in a Skyscraper G\",7496,\"USACO12MAR\"],\"洛谷-P4383\":[\"林克卡特树\",2203,\"八省联考 2018\"],\"洛谷-P8987\":[\"简单数据结构\",79,\"北大集训 2021\"],\"洛谷-P4146\":[\"序列终结者\",3152,null],\"洛谷-P5236\":[\"静态仙人掌\",2369,\"模板\"],\"洛谷-P3297\":[\"逃考\",460,\"SDOI2013\"],\"洛谷-P3298\":[\"泉\",550,\"SDOI2013\"],\"洛谷-P6326\":[\"Shopping\",474,null],\"CodeForces-1679E\":[\"Typical Party in Dorm\",1108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1679\\\"\\u003eCodeforces Round 791 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8747\":[\"双向排序\",299,\"蓝桥杯 2021 省 B\"],\"TopCoder-11705\":[\"MagicMolecule\",23,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d15491\\u0026amp;pm\\u003d11705\\\"\\u003eSingle Round Match 571 Round 1 - Division I, Level Two\\u003c/a\\u003e\"],\"洛谷-P8990\":[\"小明的树\",192,\"北大集训 2021\"],\"CodeForces-613D\":[\"Kingdom and its Cities\",2913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/613\\\"\\u003eCodeforces Round 339 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P6570\":[\"优秀子序列\",1144,\"NOI Online #3 提高组\"],\"洛谷-P6573\":[\"Toll\",302,\"BalticOI 2017\"],\"洛谷-P8512\":[\"TEST_152\",353,\"Ynoi Easy Round 2021\"],\"SPOJ-GSS3\":[\"Can you answer these queries III\",13015,\"own problem\"],\"洛谷-P6335\":[\"STAZA\",108,\"COCI2007-2008#1\"],\"洛谷-P6577\":[\"二分图最大权完美匹配\",4119,\"模板\"],\"AtCoder-arc163_e\":[\"Chmin XOR Game\",17,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc163\\\"\\u003eAtCoder Regular Contest 163\\u003c/a\\u003e\"],\"洛谷-P5245\":[\"多项式快速幂\",4706,\"模板\"],\"AtCoder-arc163_f\":[\"Many Increasing Problems\",17,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc163\\\"\\u003eAtCoder Regular Contest 163\\u003c/a\\u003e\"],\"SPOJ-GSS5\":[\"Can you answer these queries V\",3108,\"K.-Y. Chen and K.-M. Chao, On the Range Maximum-Sum Segment Query Problem, 2007.\"],\"洛谷-P4156\":[\"论战捆竹竿\",859,\"WC2016\"],\"洛谷-P5249\":[\"加特林轮盘赌\",534,\"LnOI2019\"],\"SPOJ-GSS1\":[\"Can you answer these queries I\",15360,\"\"],\"CodeForces-1327F\":[\"AND Segments\",1703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6515\":[\"贪玩蓝月\",497,\"雅礼集训 2018 Day10\"],\"AtCoder-arc089_d\":[\"ColoringBalls\",27,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc089\\\"\\u003eAtCoder Regular Contest 089\\u003c/a\\u003e\"],\"UVA-11368\":[\"Nested Dolls\",879,null],\"洛谷-P5494\":[\"线段树分裂\",4622,\"模板\"],\"洛谷-P5251\":[\"第二代图灵机\",492,\"LnOI2019\"],\"洛谷-P6109\":[\"rprmq1\",604,\"Ynoi2009\"],\"洛谷-P5018\":[\"对称二叉树\",21512,\"NOIP2018 普及组\"],\"洛谷-P6106\":[\"Self Adjusting Top Tree\",58,\"Ynoi2010\"],\"AtCoder-tdpc_string\":[\"文字列\",19,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/tdpc\\\"\\u003eTypical DP Contest\\u003c/a\\u003e\"],\"UVA-11594\":[\"All Pairs Maximum Flow\",297,null],\"HDU-2295\":[\"Radar\",971,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+4th+Baidu+Cup+final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 4th Baidu Cup final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2297\":[\"Run\",302,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+4th+Baidu+Cup+final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 4th Baidu Cup final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-526F\":[\"Pudding Monsters\",2468,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"洛谷-P4175\":[\"网络管理\",2042,\"CTSC2008\"],\"洛谷-P7205\":[\"Drvca\",16,\"COCI2019-2020#3\"],\"洛谷-P6116\":[\"たのしいたのしいたのしい家庭菜園\",290,\"JOI 2019 Final\"],\"黑暗爆炸-4176\":[\"Lucas的数论\",184,\"\"],\"洛谷-P5025\":[\"炸弹\",2686,\"SNOI2017\"],\"洛谷-P5024\":[\"保卫王国\",4810,\"NOIP2018 提高组\"],\"洛谷-P5273\":[\"多项式幂函数(加强版)\",2137,\"模板\"],\"洛谷-P5279\":[\"麻将\",766,\"ZJOI2019\"],\"LibreOJ-6727\":[\"henry_y 的数列\",5,\"hyOI2020\"],\"LibreOJ-6728\":[\"U 群把妹王\",46,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"bluebayou","updateTime":1709687103000,"title":"bluebayou的练习题单","dislikeCnt":0,"content":"\u003cfont size\u003d5\u003e说明:\u003c/font\u003e\n本题单为罗勇军《算法竞赛》题单(https://vjudge.net/article/3284 )(以下简称原题单)的补充。本人目前在备战省选2024及NOI2024,一直使用罗老师的书。\u003cfont color\u003d\"##0000dd\"\u003e本题单对原题单中的“请读者自行扩展部分“以及(对本人来说)原题单给出的题目数量不足以学会该算法或思想的部分进行了补充,并对原题单第八章几何部分进行了补充。\u003c/font\u003e\u003cbr /\u003e P.S. NOI2024联合省选失败,已退役,江湖再见。\n\n\u003cfont size\u003d5\u003e第二章 基本算法\u003c/font\u003e\n不带删的尺取(baka\u0027s trick?又称双栈法?)(参考洛谷日报2022#377)\n[problem:CodeForces-1548B]\n[problem:LibreOJ-6515]参考答案:https://www.cnblogs.com/Idtwtei/p/17690274.html\n[problem:UniversalOJ-693]\n[problem:AtCoder-jag2018summer_day2_d]参考答案:https://www.luogu.com.cn/blog/37014/post-acm\n累积和算法(cumulative sum tricks/imos method(日本叫法?))\n[problem:OpenJ_Bailian-1083]POJ-1083\n[problem:AtCoder-abc260_g]\n[problem:AtCoder-arc162_f]使用cumulative sum tricks优化\n反悔贪心(参考题单:https://www.luogu.com.cn/training/8793 )\n[problem:洛谷-P2949]\n[problem:洛谷-P4053]反悔堆(贪心堆)套路。\n[problem:洛谷-P2107]\n[problem:CodeForces-865D]\n[problem:洛谷-P3545]\n[problem:洛谷-P1484]反悔状态机(反悔自动机)套路。亦可动规,wqs优化\n[problem:洛谷-P1792]\n[problem:CodeForces-730I]\n[problem:AtCoder-agc018_c]\n[problem:洛谷-P3620]亦可动规,wqs优化\n[problem:CodeForces-802N]\n[problem:CodeForces-802O]\n[problem:CodeForces-436E]\n[problem:CodeForces-280D]\n[problem:洛谷-P5470](d1t3)模拟费用流或反悔贪心\n随机化贪心(骗分或瞎搞参看题单 https://www.luogu.com.cn/training/20006#information “随机化贪心”部分)\n[problem:洛谷-P2210]\n[problem:洛谷-P3973]\n[problem:洛谷-P1692]\n[problem:CodeForces-995C]\n[problem:洛谷-P1284]\n[problem:洛谷-P4212]\n[problem:CodeForces-329C]\n[problem:CodeForces-798D]\n[problem:洛谷-P3212]\n[problem:洛谷-P4703]\n[problem:洛谷-P4220](t1)此题可不使用边分树虚树等数据结构,有随机化贪心的解法。\n贪心进阶练习题单:\nhttps://www.luogu.com.cn/training/140652#problems (easy)\nhttps://www.luogu.com.cn/training/145463#problems (medium)\nhttps://www.luogu.com.cn/training/110962#problems (hard)\nCDQ分治进阶练习题单:\nhttps://www.luogu.com.cn/training/9435#problems\n\n\u003cfont size\u003d5\u003e 第三章 搜索\u003c/font\u003e\n对抗搜索与Alpha-Beta剪枝(参考洛谷日报2020#249)\n[problem:洛谷-P4576]\n[problem:UVA-10111]\n[problem:UVA-751]\n舞蹈链(DLX)(参考洛谷日报2020#259)\n[problem:洛谷-P4929]\n[problem:洛谷-P1784]\n[problem:洛谷-P4205]\n[problem:HDU-2295]可重复覆盖\n[problem:HDU-4069]\n[problem:HDU-3335]\n[problem:HDU-4979]\n搜索进阶(补充,主要参考Kuangbin带你飞题单)\n[problem:HDU-3567]\n[problem:HDU-2181]\n[problem:HDU-3533]\n[problem:HDU-1560]\n[problem:ZOJ-2477]\n[problem:HDU-3085]\n[problem:OpenJ_Bailian-2046]POJ-2046\n[problem:HDU-2102]\n\n\u003cfont size\u003d5\u003e 第四章 高级数据结构\u003c/font\u003e\nLCT(原题单未列入)\n[problem:洛谷-P2147]\n[problem:洛谷-P4312]\n并查集\n[problem:洛谷-P5610]时限缩小之后平衡树可能过不了了,正解并查集\n可持久化并查集(也称可撤销并查集/回滚并查集)\n[problem:AtCoder-abc302_h]\n[problem:CodeForces-891C]\n[problem:CodeForces-1681F]\n[problem:洛谷-P3247]\n[problem:洛谷-P5443]上题双倍经验?\n动态开点线段树\n[problem:洛谷-P5459]\n[problem:洛谷-P3960]\n[problem:CodeForces-915E]\n[problem:CodeForces-817F]\n线段树合并\n[problem:洛谷-P4556]\n[problem:洛谷-P3224]\n[problem:CodeForces-600E]\n[problem:洛谷-P3521]权值线段树合并\n[problem:CodeForces-490F]O($n^2$logn)可过,但建议考虑O(nlogn)算法\n[problem:CodeForces-414C]\n[problem:洛谷-P3899]\n[problem:CodeForces-1051G]\n[problem:洛谷-P5608]\n线段树分裂(参考洛谷日报2021#359)\n[problem:洛谷-P5494]\n[problem:洛谷-P2824]\n[problem:CodeForces-558E]\n[problem:洛谷-P5612]\n线段树分治(时间线段树?)(参考洛谷日报2019#209)\n[problem:洛谷-P5787]\n[problem:CodeForces-938G]\n[problem:CodeForces-576E]\n[problem:洛谷-P3733]\n[problem:洛谷-P5214]\n[problem:CodeForces-678F]\n[problem:洛谷-P4632]t1\n树哈希\n[problem:洛谷-P5018]\n[problem:洛谷-P5043]\n[problem:洛谷-P4323]\n可并堆(左偏树和配对堆)\n[problem:洛谷-P3377]\n[problem:洛谷-P4331]堆维护中位数的套路,这里需要可并堆\n[problem:洛谷-P1552]t1\n[problem:洛谷-P3261]左偏树+标记下传\n[problem:洛谷-P2713]\n[problem:洛谷-P1456]\n[problem:洛谷-P3273]\n[problem:洛谷-P4359]dp+可持久化左偏树\n[problem:洛谷-P3642](t2)dp+凸优化+可并堆\n树套树\n[problem:洛谷-P3380]\n[problem:洛谷-P3759]\n[problem:洛谷-P3248]\n[problem:洛谷-P5445]t3\n[problem:洛谷-P3437]\nKinetic Tournament Tree(KTT)(参考资料: https://codeforces.com/topic/82628/en3 \nhttps://zhuanlan.zhihu.com/p/646644617 )\n[problem:CodeForces-1178G]\n[problem:CodeForces-573E]\n[problem:LibreOJ-2845]对应洛谷-P9288\n[problem:洛谷-P5693]\n[problem:洛谷-P6792]\n[problem:LibreOJ-6727]https://loj.ac/d/2642\n启发式合并/分裂\n[problem:洛谷-P9216]\n[problem:CodeForces-1618G]\n[problem:洛谷-P3201]\n[problem:CodeForces-1709E]\n[problem:CodeForces-741D]\n[problem:CodeForces-475F]\n[problem:洛谷-P4755]\n[problem:CodeForces-1181E2]\n[problem:CodeForces-1156E]\n块状链表\n[problem:POJ-2887]\n[problem:OpenJ_Bailian-2131]参看山西师大附中 苏煜 论文《对块状链表的一点研究》\n[problem:洛谷-P2042]参看山西师大附中 苏煜 论文《对块状链表的一点研究》\n[problem:洛谷-P4278]块状链表+值域分块\nFHQ-Treap参考练习(参考洛谷日报2020#289)\n[problem:洛谷-P6136]\n[problem:洛谷-P2596]\n[problem:洛谷-P4309]\n[problem:洛谷-P4847]\n[problem:洛谷-P4146]\n[problem:洛谷-P5217]\n[problem:洛谷-P5350]\n[problem:洛谷-P5586]\n[problem:洛谷-P3987]\n[problem:洛谷-P3201]\n[problem:洛谷-P3968]\n[problem:洛谷-P5066]\n替罪羊树(参考洛谷日报2020#306)(https://www.cnblogs.com/tlx-blog/p/12900730.html)\n[problem:洛谷-P1801]\n[problem:洛谷-P1486]\n[problem:洛谷-P3920]动态点分治 + treap + 替罪羊树\n树分块\n[problem:洛谷-P6177]树上撒点\n[problem:洛谷-P3603]树上撒点\n[problem:洛谷-P5356]\n[problem:洛谷-P2137]注意树分块可能被菊花图卡掉\n[problem:HDU-6394]树分块+倍增\n虚树(参考洛谷日报2019#185)\n[problem:洛谷-P3233]\n[problem:洛谷-P4103]\n[problem:洛谷-P2495]\n[problem:洛谷-P4242]\n[problem:洛谷-P5680]\n[problem:CodeForces-613D]\n[problem:CodeForces-1320E]\n[problem:CodeForces-1111E]\n[problem:洛谷-P4426]\n[problem:洛谷-P5439]\n[problem:CodeForces-772E]虚树+点分治\nKruskal 重构树(树上的笛卡尔树??)(参考洛谷日报2022#417)\n[problem:洛谷-P1967]\n[problem:CodeForces-1578L]\n[problem:洛谷-P2245]\n[problem:CodeForces-1706E]\n[problem:洛谷-P4768]d1t1\n[problem:LibreOJ-3346](t2)对应洛谷-P6765,由于洛谷对数据包大小的限制,建议在LOJ提交\n[problem:AtCoder-agc002_d]\n[problem:AtCoder-arc098_d]\n[problem:洛谷-P4899]建最小最大两个点 Kruskal 重构树后转化成二维偏序\n[problem:洛谷-P5360](r2d1t3) kruskal重构树+虚树\n李超线段树(参考洛谷日报2020#266)\n[problem:洛谷-P4254]\n[problem:洛谷-P4097]\n[problem:洛谷-P4069]\n[problem:CodeForces-932F]李超线段树合并优化dp\n[problem:CodeForces-1175G]单调栈 + 可持久化李超树 + 凸包启发式合并\n[problem:洛谷-P8987]\n猫树及猫树分治(参考洛谷日报2019#149)\n[problem:SPOJ-GSS1]猫树:最大子段和\n[problem:SPOJ-GSS5]猫树:带限制最大子段和\n[problem:洛谷-P6240]猫树分治\n[problem:CodeForces-1100F]参考题解:https://www.luogu.com.cn/blog/xiaoziyaoxzy/solution-cf1100f\n[problem:洛谷-P2048]此题在倍增法与ST算法题单里出现过,但据说猫树比st表快\n[problem:洛谷-P5576]需要SAM技巧\n[problem:洛谷-P6109]需要线段树技巧\n珂朵莉树(ODT)(使用珂朵莉树骗分或瞎搞可参考洛谷题单:https://www.luogu.com.cn/training/269907#problems )\n[problem:CodeForces-915E]珂朵莉树板子\n[problem:SPOJ-CNTPRIME]珂朵莉树板子 + 素数筛\n[problem:SPOJ-PRMQUER]同上\n[problem:CodeForces-896C]起源 + 珂朵莉树板子 + 快速幂\n[problem:CodeForces-1638E]珂朵莉树板子 + 线段树板子 / 树状数组板子\n[problem:洛谷-P5251]珂朵莉树板子 + 线段树板子\n[problem:洛谷-P8512]珂朵莉树板子 + 树状数组板子\n整体二分(参考洛谷日报2022#407)(完全摘自题单:https://www.luogu.com.cn/training/5035 )\n[problem:洛谷-P3527]\n[problem:洛谷-P4602]\n[problem:洛谷-P1527]\n[problem:洛谷-P4175]带修整体二分\n[problem:洛谷-P3250]\n[problem:洛谷-P2617]\n[problem:洛谷-P3332]可整体二分,也可树套树\n[problem:洛谷-P5163]\n二进制分组(在线算法)\n[problem:CodeForces-710F]\n[problem:洛谷-P3188]二进制分组优化01背包\n[problem:HDU-1059]\n[problem:HDU-6166]二进制分组+多源多汇最短路\n[problem:HDU-4787]\n[problem:洛谷-P3309]\n[problem:UniversalOJ-46]\n[problem:UniversalOJ-191]\n边分治和边分树\n[problem:CodeForces-1019E]\n[problem:洛谷-P4565]\n数据结构进阶练习题单:\nhttps://www.luogu.com.cn/training/5297#problems\nhttps://www.luogu.com.cn/training/2971#problems\nhttps://www.luogu.com.cn/training/232599#problems\n线段树合并进阶题单:\nhttps://www.luogu.com.cn/training/3858#problems\n树链剖分进阶练习题单:\nhttps://www.luogu.com.cn/training/1654#problems\n点分树进阶练习题单:\nhttps://www.luogu.com.cn/training/78277#problems\n动态树进阶练习题单:\nhttps://www.luogu.com.cn/training/8308#problems\n树形数据结构进阶练习题单:\nhttps://www.luogu.com.cn/training/1176#problems\n根号数据结构进阶练习题单:\nhttps://www.luogu.com.cn/training/3238#problems\n\n\u003cfont size\u003d5\u003e 第五章 动态规划\u003c/font\u003e\n数位DP(补充,主要参考Kuangbin带你飞题单)\n[problem:CodeForces-55D]\n[problem:HDU-3555]\n[problem:HDU-3709]\n[problem:HDU-3652]\n[problem:HDU-4734]\n[problem:ZOJ-3494]\n[problem:HDU-4507]\n[problem:SPOJ-BALNUM]\n[problem:CodeForces-401D]\n[problem:HDU-4389]\n[problem:UVA-1489]\n[problem:HDU-3565]\n[problem:CodeForces-258B]\n带进位的数位DP(Digit DP with carries)\n[problem:CodeForces-1670F]\n[problem:CodeForces-1734F]\n[problem:AtCoder-arc156_d]\n[problem:CodeForces-1290F]\n[problem:HDU-6953]\n[problem:AtCoder-abc271_h]亦可不使用DP with carries\n[problem:AtCoder-abc300_h]\n[problem:洛谷-P7468]\n区间DP(Kuangbin带你飞)\n[problem:ZOJ-3537]\n[problem:LightOJ-1422]\n[problem:Baekjoon-7695]对应POJ-2955\n[problem:CodeForces-149D]\n[problem:ZOJ-3469]\nDP优化部分建议学习参考博客:https://www.cnblogs.com/alex-wei/p/DP_Involution.html\nhttps://www.cnblogs.com/alex-wei/p/DP_optimization_method_II.html\n一般优化(补充,主要为线段树/树状数组/树剖/虚树/单调队列等数据结构优化dp)\n[problem:CodeForces-1009F]树剖\n[problem:CodeForces-1499F]树剖\n[problem:CodeForces-1312G]树剖\n[problem:洛谷-P5904] dp+长链剖分优化\n[problem:CodeForces-1097G]虚树\n[problem:CodeForces-115E]线段树优化\n[problem:CodeForces-833B]\n[problem:AtCoder-agc011_f]线段树优化+思维\n[problem:CodeForces-960F]动态开点线段树优化dp\n[problem:CodeForces-1334F]\n[problem:CodeForces-1023G]\n[problem:洛谷-P4229] 解法有多种,也可以不用线段树优化\n[problem:AtCoder-abc262_h] P4229的加强版\n[problem:洛谷-P4577]线段树合并维护DP(即所谓的“整体DP“)\n[problem:洛谷-P5298]线段树合并优化dp(这题的标记处理比较特殊)\nDP套DP(https://www.cnblogs.com/dead-X/p/14274671.html )\n[problem:洛谷-P4590] \n[problem:CodeForces-979E]可使用DP套DP,亦有其它算法\n[problem:洛谷-P5279] d1t1\n倍增优化\n[problem:CodeForces-1175E]\n[problem:洛谷-P1081]\n[problem:洛谷-P4739]\n同余优化及相关\n[problem:AtCoder-abc207_e]利用同余性质前缀和优化\n[problem:CodeForces-1105C]同余DP\n[problem:CodeForces-577B]同余DP\n[problem:洛谷-P3403]以下同余最短路\n[problem:洛谷-P2662]\n[problem:洛谷-P2371]\n[problem:洛谷-P9140]\n矩阵快速幂优化(主要参考Alex-Wei博客)\n[problem:洛谷-P3176]\n[problem:CodeForces-576D]\n[problem:洛谷-P1707]\n[problem:洛谷-P4569]\n[problem:洛谷-P5059]\n[problem:洛谷-P1397]d2t1\n[problem:洛谷-P3597]P6772(NOI2020 d1t1)的阉割版\n[problem:AtCoder-agc013_e]\n斜率优化/凸壳优化(Kuangbin带你飞)\n[problem:HDU-4258] \n[problem:HDU-1300]\n[problem:HDU-2993]该题严重卡常,需要超级快读(fread快读)\n[problem:HDU-3669]\n[problem:HDU-3045]\n[problem:Baekjoon-5498]对应POJ-1180\n[problem:OpenJ_Bailian-2018]对应POJ-2018\n[problem:OpenJ_Bailian-3868]POJ-3709\n[problem:UVA-12594]\n[problem:洛谷-P6893]\n[problem:CodeForces-455E]\n[problem:洛谷-P2305]d2t3\n四边形不等式优化(补充)\n[problem:洛谷-P3515]\n[problem:CodeForces-321E]\n[problem:SPOJ-LARMY]\n[problem:CodeChef-CHEFAOR]\n[problem:HackerRank-guardians-lunatics-ioi14]\n[problem:洛谷-P6932] \n带权二分(wqs二分)及wqs优化DP(Alien DP)(参考洛谷日报2021#354)\n[problem:AtCoder-abc305_h]\n[problem:AtCoder-abc218_h]\n[problem:AtCoder-arc164_e] 使用四边形不等式优化至O($n^2$)可过;使用Alien DP,可实现N≤2×$10^5$的数据范围\n[problem:洛谷-P2619]\n[problem:洛谷-P5633]\n[problem:洛谷-P6246]wqs二分+决策单调性优化\n[problem:洛谷-P3354]\n[problem:CodeForces-739E]wqs二分模板题\n[problem:CodeForces-958E2]也可反悔贪心\n[problem:CodeForces-125E]\n[problem:洛谷-P4383]\n[problem:洛谷-P4983]\n[problem:洛谷-P5308]\n[problem:洛谷-P5896]Alien DP起源\n分治(包括CDQ分治)优化\n[problem:洛谷-P4095]线段树分治+背包\n[problem:洛谷-P3120]类cdq分治\n[problem:洛谷-P4093]CDQ 分治 + 数据结构\n[problem:洛谷-P4027]斜率优化+cdq分治维护凸包\n[problem:洛谷-P4655]cdq+斜率优化,亦可李超线段树优化\n[problem:洛谷-P3431]\n[problem:洛谷-P6834]\n[problem:洛谷-P7842]\n[problem:洛谷-P3364]\n[problem:CodeForces-4D]\n[problem:CodeForces-868F]\n[problem:CodeForces-1442D]\n[problem:CodeForces-568E]CDQ优化DP\n[problem:洛谷-P5979]CDQ优化DP\n动态DP(DDP)(Dynamic Dynamic Programming)\n[problem:洛谷-P4719]动态树上最大权独立集问题\n[problem:洛谷-P4751]\n[problem:CodeForces-750E]\n[problem:SPOJ-GSS3]序列动态 DP 模板\n[problem:洛谷-P6021]树上动态 DP 题,可以用树链剖分维护矩阵转移\n[problem:洛谷-P5024](D2T3)动态树上最小权覆盖集问题\n[problem:洛谷-P8820]t4\n[problem:洛谷-P6573]\n[problem:洛谷-P7359]\n[problem:LibreOJ-3539]洛谷P9597\n[problem:CodeForces-1286D]\n[problem:CodeForces-573D]\n[problem:洛谷-P5281]d1t3\n状压DP及插头DP(参考zhoukangyang题单https://www.luogu.com.cn/training/3121 并去重)\n[problem:洛谷-P3052]1-4题为状压DP\n[problem:洛谷-P2622]\n[problem:洛谷-P7098]\n[problem:洛谷-P3959]d2t2\n[problem:洛谷-P3272]插头dp入门题,以下为插头DP\n[problem:洛谷-P3190]也是插头dp入门题\n[problem:洛谷-P5074]\n[problem:洛谷-P5056]哈密尔顿回路,比较困难的插头dp\n[problem:洛谷-P2289]\n[problem:OpenJ_Bailian-1739]POJ-1739\n[problem:洛谷-P1713]\n[problem:洛谷-P3886]\n[problem:洛谷-P3170]\n[problem:洛谷-P4262]带有技巧性的插头/轮廓线dp\n[problem:洛谷-P2337]复杂的插头dp\n[problem:洛谷-P3290]\n高维前缀和( SOSDP)及子集卷积(Subset Convolution) \n建议学习参考博客:https://www.cnblogs.com/alex-wei/p/set_power_series.html \nhttps://codeforces.com/blog/entry/45223 (英文版)https://www.cnblogs.com/cyl06/p/SOSDP.html (中文版)\n[problem:CodeForces-165E]以下为SOSDP\n[problem:CodeForces-449D]\n[problem:洛谷-P6442]\n[problem:CodeForces-383E]\n[problem:CodeForces-772D]\n[problem:CodeForces-1208F]\n[problem:AtCoder-arc100_c]\n[problem:CodeForces-1234F]\n[problem:CodeForces-1117F]\n[problem:CodeForces-1679E]\n[problem:洛谷-P6097]以下为子集卷积题目\n[problem:CodeForces-1034E]\n[problem:AtCoder-abc212_h]\n[problem:洛谷-P4221]t2\n[problem:HDU-5909]P3781的不带修版\n[problem:洛谷-P3781](R2d1t3) 动态DP+FWT\n[problem:HDU-6057]\n[problem:CodeForces-914G]\n[problem:CodeForces-838C]O($nklog^2n$)可过, O($nlog^2nlogk$) 算法需FWT\n[problem:洛谷-P6570]\n[problem:洛谷-P5387]SG函数+FWT\n[problem:AtCoder-abc321_g]bit DP+子集卷积(Atcoder上所谓的bit DP可能就是状压DP)\nDP优化小技巧:树上依赖性背包\u0026值域定义域互换(参考: https://www.cnblogs.com/alex-wei/p/dp_tricks.html )\n[problem:洛谷-P6326]树上依赖性背包\n[problem:洛谷-P3780](R2d1t2) 树上依赖性背包\n[problem:CodeForces-1342F]值域定义域互换\n[problem:AtCoder-agc033_d]值域定义域互换\n换根DP(二次扫描法)(参考洛谷日报2020#278)\n[problem:洛谷-P3478]换根dp模板题\n[problem:洛谷-P2986]换根dp模板题\n[problem:CodeForces-1324F]\n[problem:CodeForces-708C]换根dp好题\n[problem:CodeForces-1187E]\n[problem:洛谷-P6419]分类讨论较麻烦的换根dp\n[problem:洛谷-P3647](t3)比较困难的换根dp\n[problem:洛谷-P5642]\n拉格朗日插值优化DP(这种因为某一个东西范围很大的,多半用插值多项式来解决。)\n[problem:CodeForces-995F]\n[problem:洛谷-P3643]t1\n[problem:洛谷-P8290]d1t2\n[problem:洛谷-P7116]t4\n[problem:洛谷-P4463]\n[problem:洛谷-P5469]d1t2\n[problem:洛谷-P4365](d1t3)生成函数+拉格朗日插值+整体DP(即线段树合并维护 DP)\n阶梯格路计数和反射容斥\n参考博客:https://www.cnblogs.com/Zeardoe/p/17003282.html\nhttps://www.cnblogs.com/alex-wei/p/Polynomial___Lagrange_Interpolation_and_Fast_Fourier_Transform.html\n[problem:洛谷-P3266]\n[problem:Gym-104053J]\n[problem:CodeForces-1821F]\n[problem:CodeForces-1770G]先卷积处理后阶梯格路计数\n[problem:UniversalOJ-424]\n[problem:洛谷-P4597]arc163_f的前置知识\n[problem:AtCoder-arc163_f]\nbitset优化\n[problem:洛谷-P6134]\n[problem:CodeForces-333E]\n动态规划综合练习(主要参考Alex-Wei、huahua相关资料)\n[problem:洛谷-P7091]\n[problem:CodeForces-1156F]\n[problem:CodeForces-1542E2]\n[problem:AtCoder-tdpc_string]\n[problem:AtCoder-agc020_e]\n[problem:洛谷-P2470]\n[problem:CodeForces-67C]\n[problem:洛谷-P4127]\n[problem:洛谷-P4649]\n[problem:黑暗爆炸-2164]\n[problem:洛谷-P3262]\n[problem:洛谷-P6453]\n[problem:洛谷-P3757]\n[problem:洛谷-P4099]\n[problem:CodeForces-1327F]\n[problem:洛谷-P2051]\n[problem:洛谷-P3147]\n[problem:洛谷-P5336]\n[problem:洛谷-P2339]\n[problem:黑暗爆炸-4350]\n[problem:洛谷-P3607]\n[problem:洛谷-P4766]\n[problem:洛谷-P3592]\n[problem:洛谷-P5774]\n[problem:黑暗爆炸-3971]\n[problem:洛谷-P7163]\n[problem:洛谷-P6116]LOJ#3012可全部数据评测\n[problem:CodeForces-1584F]\n[problem:AtCoder-arc089_d]\n[problem:CodeForces-1613D]\n[problem:黑暗爆炸-1402]\n[problem:Gym-103860I]https://vj.csgrandeur.cn/7856979a1165474ac7ddb8ec924ba850?v\u003d1695470585\n[problem:LibreOJ-6274]https://www.cnblogs.com/chasedeath/p/12743841.html\n[problem:AtCoder-agc022_e]\n[problem:QOJ-4815]https://qoj.ac/download.php?type\u003dattachments\u0026id\u003d1010\u0026r\u003d1\n[problem:CodeForces-1416E]\n[problem:CodeForces-1500F]\n[problem:CodeForces-1010F]\n[problem:LibreOJ-6289]https://loj.ac/d/2866\nAtCoder DP Contest(综合测试:共26题,测试时间5h,难度从普及-到NOI-)\nhttps://www.luogu.com.cn/training/244301#problems\nCodeforces DP细化分类专题:\nhttps://vjudge.net/article/2605\n树形DP进阶练习题单(包括换根dp,基环树dp):\nhttps://www.luogu.com.cn/training/11363#information\n动态规划进阶练习题单:\nhttps://www.luogu.com.cn/training/3045#problems\nhttps://www.luogu.com.cn/training/177093#problems\nhttps://www.luogu.com.cn/training/4133#problems\n\n\u003cfont size\u003d5\u003e 第六章 数论和线性代数\u003c/font\u003e\n多项式\n[problem:洛谷-P3803]\n[problem:洛谷-P1919]\n[problem:洛谷-P4238]\n[problem:洛谷-P4245]\n[problem:洛谷-P4512]\n[problem:洛谷-P4717]\n[problem:洛谷-P4721]\n[problem:洛谷-P4725]\n[problem:洛谷-P4726]\n[problem:洛谷-P4781]\n[problem:洛谷-P5050]\n[problem:洛谷-P5158]\n[problem:洛谷-P5205]\n[problem:洛谷-P5245]\n[problem:洛谷-P5273]\n[problem:洛谷-P5282]\n[problem:洛谷-P5373]\n[problem:洛谷-P5383]\n[problem:洛谷-P5393]\n[problem:洛谷-P5394]\n[problem:洛谷-P3338]d1t2\n[problem:洛谷-P3723]d1t3\n[problem:洛谷-P5437]\n[problem:洛谷-P5293]d2t2\n[problem:洛谷-P5432]\n[problem:洛谷-P5472]d2t2\n[problem:洛谷-P5577]\n[problem:洛谷-P4525]\n概率问题\n[problem:洛谷-P5104]\n[problem:洛谷-P1850]\n[problem:洛谷-P3830]\n[problem:洛谷-P4564]\n[problem:洛谷-P2473]\n[problem:洛谷-P2221]\n[problem:洛谷-P3239]\n[problem:洛谷-P3750]\n[problem:洛谷-P4284]\n[problem:洛谷-P5249]\n[problem:洛谷-P2081]d1t3\n[problem:洛谷-P3343]\n[problem:洛谷-P3600]\n[problem:洛谷-P5326]\n[problem:OpenJ_Bailian-2151]POJ-2151\n[problem:OpenJ_Bailian-3795]POJ-3071\n[problem:OpenJ_Bailian-3520]POJ-3440\n矩阵树定理(基尔霍夫积分定理(Kirchhoff\u0027s theorem))(参考洛谷日报2020#272)\n[problem:洛谷-P4111]\n[problem:洛谷-P6624]d2t3\n[problem:洛谷-P2144]\n[problem:洛谷-P3317]\n[problem:洛谷-P4208]\n[problem:CodeForces-917D]\n[problem:AtCoder-jsc2021_g]\n[problem:AtCoder-abc253_h]\n[problem:AtCoder-abc323_g]需线性代数行列式特征值的知识\n悬线法(参考洛谷日报2021#323)\n[problem:洛谷-P1387]\n[problem:洛谷-P1169]\n[problem:洛谷-P1578]\n[problem:洛谷-P3474]\n[problem:洛谷-P3117]\nBSGS(baby-step giant-step)\n[problem:洛谷-P3846]\n[problem:洛谷-P2485]\n[problem:洛谷-P4884]\n[problem:洛谷-P3306]\n[problem:洛谷-P4195]\n[problem:洛谷-P5345]\n[problem:洛谷-P4454]\n[problem:CodeForces-1106F]\n[problem:洛谷-P4028]\n单纯形法(线性规划)\n[problem:UniversalOJ-179]\n[problem:洛谷-P3980]可线性规划(单纯形法),亦可网络流解\n[problem:LibreOJ-6295]https://www.cnblogs.com/Tiw-Air-OAO/p/13329306.html\n[problem:洛谷-P6631]\n类欧几里得算法(参考洛谷日报2023#444)\n[problem:AtCoder-abc313_g]floor sum\n[problem:AtCoder-abc283_h]floor sum\n[problem:洛谷-P4132]\n[problem:洛谷-P5170]\n[problem:洛谷-P5171]\n[problem:CodeForces-1098E]\n[problem:CodeForces-1182F]\n[problem:洛谷-P5172]\n[problem:洛谷-P5179]\n[problem:洛谷-P4433]\n杜教筛(参考资料:https://www.cnblogs.com/TSHugh/p/8361040.html \nhttps://blog.csdn.net/skywalkert/article/details/50500009\nhttps://www.luogu.com.cn/blog/lx-2003/dujiao-sieve \nhttps://www.cnblogs.com/zhugezy/p/11312301.html )\n[problem:黑暗爆炸-3944]裸的杜教筛\n[problem:黑暗爆炸-4916]按照筛phi的方式稍微推一下就好\n[problem:黑暗爆炸-3512]杜教筛+记忆化搜索\n[problem:黑暗爆炸-4176]\n[problem:洛谷-P1587]d1t3\n推式子练习:(推荐学习博客:https://www.luogu.com.cn/blog/ternaryTree/shuo-xue-shuo-lun-xiang-guan )\nhttps://www.luogu.com.cn/training/200296#problems\n数论进阶练习题:\nhttps://www.luogu.com.cn/training/85467#problems\nhttps://www.luogu.com.cn/training/87630#problems\n线性基进阶练习题:\nhttps://www.luogu.com.cn/training/11251#problems\n多项式进阶练习题单:\nhttps://www.luogu.com.cn/training/1008#problems\nhttps://www.luogu.com.cn/training/7063#problems\n概率期望进阶练习题单:\nhttps://www.luogu.com.cn/training/4922#problems\n\n\u003cfont size\u003d5\u003e第七章 组合数学\u003c/font\u003e\n二维偏序\n[problem:洛谷-P2163]\n[problem:洛谷-P3755]\n[problem:洛谷-P8844]\n[problem:CodeForces-1320C]\n[problem:CodeForces-1311F]\n[problem:洛谷-P8253]\nDilworth 定理(参考洛谷日报2022#403)\n[problem:UVA-11368]用 Dilworth 定理转化为 LIS,或用贪心\n[problem:洛谷-P3974]\n[problem:洛谷-P4298]\n[problem:CodeForces-1483F]本题仅作为590E题的铺垫题,与Dilworth 定理似乎没多大关系\n[problem:CodeForces-590E]\n[problem:CodeForces-1738G]\nPrüfer 序列\n[problem:洛谷-P6086]\n[problem:洛谷-P2290]\n[problem:洛谷-P2624]\n[problem:洛谷-P5454]\n[problem:CodeForces-156D]\n[problem:洛谷-P5218]\n容斥原理(包括广义容斥\u0026min-max 容斥等)\n参考:https://www.cnblogs.com/alex-wei/p/Combinatorial_Mathematics.html\nhttps://www.cnblogs.com/alex-wei/p/Dirichlet.html\nhttps://blog.csdn.net/werkeytom_ftd/article/details/74701513\nhttps://www.cnblogs.com/do-while-true/p/15179782.html\nhttps://www.cnblogs.com/lsq147/p/13621250.html\n[problem:洛谷-P8990]树上点边容斥 https://www.cnblogs.com/impyl/p/16787032.html\n[problem:洛谷-P9248]树上点边容斥\n[problem:CodeForces-1613F]容斥+分治NTT\n[problem:洛谷-P2567]\n[problem:黑暗爆炸-4361]\n[problem:黑暗爆炸-2958]参考答案:https://blog.csdn.net/Ab_Ever/article/details/78301969\n[problem:CodeForces-451E]\n[problem:CodeForces-997C]\n[problem:洛谷-P3301]扩展卢卡斯+容斥\n[problem:洛谷-P3160]\n[problem:HDU-5713]\n[problem:CodeForces-1770F]实现简单,但思维方法牛\n[problem:UVA-12327]本题最有价值的地方不是生成函数板子,也不是多项式板子,而在于求容斥的方法。\n[problem:AtCoder-arc096_c]ARC096E\n[problem:AtCoder-agc061_c]\n[problem:CodeForces-1559E]以下莫比乌斯反演\n[problem:SPOJ-MSKYCODE]\n[problem:SPOJ-GCDMAT]\n[problem:CodeForces-900D]\n[problem:洛谷-P4318]\n[problem:洛谷-P6271]莫比乌斯反演+拉格朗日插值/高斯消元\n[problem:LibreOJ-6627]莫比乌斯反演+高维前缀和/差分。题解: https://loj.ac/d/1679\n[problem:黑暗爆炸-4671]以下斯特林反演。题解:https://www.cnblogs.com/renamoe/p/14700127.html\n[problem:HDU-7095]参考题解:https://www.cnblogs.com/do-while-true/p/15179782.html\n[problem:洛谷-P4091]参考题解同上,或参考洛谷题解。\n[problem:LibreOJ-6728]题解:https://loj.ac/d/2652\n[problem:黑暗爆炸-3328]以下单位根反演\n[problem:LibreOJ-6485]https://www.luogu.com.cn/blog/ShadowassIIXVIIIIV/loj6485-ljj-xue-er-xiang-shi-ding-li\n[problem:洛谷-P5591]\n[problem:洛谷-P5505]以下二项式反演\n[problem:洛谷-P4859]\n[problem:洛谷-P4491]\n[problem:洛谷-P6478]\n[problem:CodeForces-1228E]\n[problem:黑暗爆炸-2839]\n[problem:黑暗爆炸-4665]\n[problem:黑暗爆炸-2162]\n[problem:洛谷-P3298]\n[problem:洛谷-P3175]以下min-max 容斥 (本题为min-max 容斥与 FWT 结合)\n[problem:洛谷-P5643]与 FWT + DP 结合\n[problem:洛谷-P4707]与 DP 结合\n[problem:AtCoder-agc038_e]\n[problem:黑暗爆炸-4833]\n[problem:洛谷-P5366]以下为子集反演\n[problem:UniversalOJ-37](参考:https://shanlunjiajian.github.io/2021/10/18/subset-inversion/ )\n[problem:AtCoder-agc041_f]https://www.cnblogs.com/y-dove/p/14851602.html\n[problem:洛谷-P5206]t1\n鸽笼原理及Ramsey定理\n[problem:AtCoder-abc200_d]\n[problem:CodeForces-1305C]\n[problem:HDU-5762]\n[problem:HDU-5917]\n[problem:HDU-6152]\n组合数学进阶练习题:\nhttps://www.luogu.com.cn/training/106266#problems\nhttps://www.luogu.com.cn/training/2019#problems\n生成函数进阶练习题:\nhttps://www.luogu.com.cn/training/3295#problems\nhttps://www.luogu.com.cn/training/65708#problems\n博弈论进阶练习题:\nhttps://www.luogu.com.cn/training/4203#problems\n\n\u003cfont size\u003d5\u003e第八章 计算几何\u003c/font\u003e\n例题\n[problem:洛谷-P1355]\n[problem:OpenJ_Bailian-1385]POJ-1385\n[problem:洛谷-P2742]\n[problem:洛谷-P1257]暴力可过?\n[problem:洛谷-P1452]\n[problem:HDU-2297]\n[problem:洛谷-P1742]随机增量法。模拟退火亦可。\n[problem:OpenJ_Bailian-2069]\tPOJ-2069\n[problem:OpenJ_Bailian-2177]\tPOJ-2177\n[problem:UVA-1497]\n习题\n(1)线段相交的判定、点到线段的距离\n[problem:OpenJ_Bailian-2031]POJ-2031\n[problem:OpenJ_Bailian-1039]POJ-1039\n(2)多边形\n[problem:UVA-1301]POJ-1408\n[problem:OpenJ_Bailian-1584]POJ-1584\n(3)凸包(已去除重复及与例题重复的题目)\n[problem:OpenJ_Bailian-1696]POJ-1696\n[problem:OpenJ_Bailian-1113]POJ-1113\n[problem:洛谷-P2287]\n[problem:洛谷-P3829]\n[problem:洛谷-P4557]\n[problem:洛谷-P5403]\n(4)旋转卡壳(已去除重复及与例题重复的题目并补充两道题目)\n[problem:洛谷-P3187]求最小矩形覆盖\n[problem:OpenJ_Bailian-3851]POJ3608(补充题:求凸多边形最短距离)\n[problem:洛谷-P4357]补充题:做KDT的题时发现非正解,旋转卡壳是正解。参考题解区FZzzz题解。\n(5)半平面交\n[problem:洛谷-P3256]\n[problem:洛谷-P2600]\n[problem:洛谷-P4196]\n[problem:洛谷-P3297]\n[problem:洛谷-P4250]\n[problem:洛谷-P5328]\n[problem:OpenJ_Bailian-3463]\tPOJ-3130\n[problem:OpenJ_Bailian-3799]POJ-3335\n(6)扫描线算法(已去除与原题单线段树、树状数组部分重合的题目并补充部分题目)\n[problem:OpenJ_Bailian-1765]POJ-1765\n[problem:洛谷-P2061]POJ-3277\n[problem:UVA-1606]POJ-2280\n[problem:SPOJ-SUBWAYPL]POJ-3004\n[problem:洛谷-P3242] 以下为补充题目\n[problem:洛谷-P4605]不交线段扫描线\n[problem:CodeForces-704E]不交线段扫描线\n[problem:洛谷-P6106]不交线段扫描线\n[problem:洛谷-P9335]\n[problem:洛谷-P7712]\n[problem:CodeForces-526F]\n[problem:CodeForces-997E]CF526F的加强版\n[problem:洛谷-P4502]\n[problem:LibreOJ-2760]参考答案:https://www.cnblogs.com/Go7338395/p/15722382.html\n[problem:洛谷-P6802]\n[problem:洛谷-P7560]LOJ#3489饮食区\n[problem:洛谷-P8164]\n[problem:洛谷-P6940]\n[problem:洛谷-P8421]\n[problem:UniversalOJ-553]点分块(参考正解:https://peehs-moorhsum.blog.uoj.ac/blog/6375 )\n[problem:洛谷-P4475]做KDT的题时发现非正解,点分块+旋转扫描线是正解(参考正解:https://www.luogu.com.cn/discuss/186834 )\n(7)综合应用\n[problem:OpenJ_Bailian-1819]POJ-1819\n[problem:OpenJ_Bailian-1066]POJ-1066\n[problem:OpenJ_Bailian-2043]POJ-2043\n[problem:POJ-3227]\n[problem:OpenJ_Bailian-2165]POJ-2165\n[problem:POJ-3429]\n(补充1)运动规划(参考刘汝佳训练指南)\n[problem:UVA-11921]运动规划;圆形障碍\n[problem:UVA-1060]运动规划;二分法\n[problem:UVA-10514]运动规划\n[problem:UVA-1409]运动规划,注意时间效率\n[problem:UVA-1387]运动规划;圆形障碍\n\n\u003cfont size\u003d5\u003e第九章 字符串\u003c/font\u003e\n01Trie\n[problem:AtCoder-abc304_g]01Trie+贪心+扩展Hall定理+二分\n[problem:洛谷-P4551]\n[problem:HDU-4825]\n[problem:HDU-5536]\n[problem:CodeChef-REBXOR]\n可持久化Trie\n[problem:洛谷-P6088]\n[problem:洛谷-P4735]\n[problem:HDU-4757]\n[problem:洛谷-P4592]\n[problem:洛谷-P5283]\n[problem:CodeForces-241B]异或粽子加强版\n[problem:洛谷-P4098]\n[problem:洛谷-P5795]\n[problem:洛谷-P6665]Trie 的全局异或标记,Trie 树合并\n进制哈希(补充)\n[problem:洛谷-P2757]线段树+哈希\n[problem:CodeForces-452F]线段树+哈希,上题的双倍经验\n[problem:CodeForces-580E]哈希判断循环节\n[problem:POJ-2758]哈希判断最长公共前缀\n[problem:SPOJ-NUMOFPAL]哈希判断回文串\nManacher算法(补充)\n[problem:UVA-11475]\n[problem:洛谷-P6216]\n[problem:洛谷-P5446]\n[problem:洛谷-P4324]\n回文自动机(补充)\n[problem:洛谷-P5555]\n[problem:洛谷-P5685]上题的双倍经验\n[problem:CodeForces-17E]\n[problem:CodeForces-906E]\n[problem:CodeForces-932G]\n区间 Border\n[problem:洛谷-P8006]\n[problem:洛谷-P4482]\n[problem:洛谷-P4156]字符串+同余最短路\nLyndon 分解\n[problem:HDU-6761]\n[problem:洛谷-P5211]\n后缀系列进阶练习题单:\nhttps://www.luogu.com.cn/training/5322#problems\nAC自动机进阶练习题单:\nhttps://www.luogu.com.cn/training/60465#problems\n字符串其他系列进阶练习题单:\nhttps://www.luogu.com.cn/training/53971#problems\n\n\u003cfont size\u003d5\u003e第十章 图论\u003c/font\u003e\n基环树补充题(参考洛谷日报2019#128)\n[problem:CodeForces-711D]\n[problem:AtCoder-abc266_f]\n[problem:CodeForces-835F]\n[problem:CodeForces-1454E]\n广义圆方树(参考博客: https://immortalco.blog.uoj.ac/blog/1955 )\n[problem:洛谷-P5236]\n[problem:洛谷-P5058]\n[problem:CodeForces-487E]\n[problem:洛谷-P4320]P4606的铺垫题\n[problem:洛谷-P4606]\n[problem:洛谷-P4630]t3\n[problem:洛谷-P6335]\n[problem:UVA-1464]\n[problem:黑暗爆炸-2125]以下题目参考immortalCO\n[problem:黑暗爆炸-4316]\n[problem:黑暗爆炸-1023]\n[problem:UniversalOJ-87]虚仙人掌\n[problem:UniversalOJ-189]虚仙人掌\n[problem:UniversalOJ-23]点分治\n[problem:UniversalOJ-158]链剖分\n分层图\n[problem:洛谷-P4822]\n[problem:洛谷-P4568]\n[problem:洛谷-P2939]\n[problem:洛谷-P3119]\n斯坦纳树(参考洛谷日报2020#275)\n[problem:洛谷-P6192]\n[problem:洛谷-P4294]带点权的斯坦纳树问题\n[problem:洛谷-P3264]\n[problem:洛谷-P3638]t1\nLGV引理( Lindström-Gessel-Viennot 引理,用于求解 DAG 不相交路径问题)\n[problem:洛谷-P6657]\n[problem:CodeForces-348D]\n[problem:HDU-5852]\n[problem:AtCoder-abc216_h]\n[problem:QOJ-4893]参考答案:https://qoj.ac/download.php?type\u003dsolution\u0026id\u003d4893\n优化建图\n[problem:CodeForces-786B]1-4为线段树优化建图\n[problem:洛谷-P3588]\n[problem:洛谷-P5025]\n[problem:CodeForces-1045A]\n[problem:黑暗爆炸-3681]主席树优化建图\n[problem:CodeForces-1215F]线段树优化建边太慢,考虑前缀和优化建图\n[problem:洛谷-P5284](d1t2)后缀树优化建图\n虚点/虚边\n[problem:HDU-5521]\n[problem:CodeForces-1245D]虚点+最小生成树\n[problem:CodeForces-1775D]\n[problem:洛谷-P2403]虚点+Tarjan缩点+记搜\n[problem:洛谷-P1155]下一道题的前置\n[problem:洛谷-P3497]二分图染色+虚边优化\n[problem:CodeForces-1486E]\n[problem:洛谷-P3348]LCT+虚点+树上差分(此题在原题单LCT部分已出现过)\nKM算法((Kuhn-Munkres Algorithm)二分图带权匹配)\n[problem:洛谷-P6577]匈牙利dfs写法+扩大相等子图卡,需用bfs写法\n[problem:洛谷-P6061]带权二分图匹配,KM算法优于费用流\n上下界网络流(参考:https://zybuluo.com/xiaoziyao/note/1694237 )\n[problem:LibreOJ-115]\n[problem:LibreOJ-116]\n[problem:LibreOJ-117]\n[problem:洛谷-P5192]板子题,有源汇上下界最大流\n[problem:洛谷-P4843]有源汇上下界最小流,可以用费用流实现\n[problem:洛谷-P4043]有源汇上下界最小费用可行流\n[problem:洛谷-P4553]\n网络流与线性规划 24 题(已去除与原题单重复的题目以及一道无正解的题目P2775)\n[problem:洛谷-P1251]\n[problem:洛谷-P2761]\n[problem:洛谷-P2762]最大权闭合子图经典题\n[problem:洛谷-P3254]\n[problem:洛谷-P3355]\n[problem:洛谷-P3357]\n[problem:洛谷-P4009]\n[problem:洛谷-P4011]\n[problem:洛谷-P4012]\n最大权闭合子图\n[problem:洛谷-P1361]\n[problem:洛谷-P4313]\n[problem:洛谷-P1646]\n[problem:CodeForces-311E]\n平面图转对偶图\n[problem:洛谷-P3249]\n[problem:洛谷-P4073]\n[problem:洛谷-P2046]\n最小割树(Gomory-Hu Tree)(参考题单:https://www.luogu.com.cn/training/4771 )\n[problem:洛谷-P4123]\n[problem:洛谷-P3329]\n[problem:UVA-11594]\n[problem:洛谷-P4214]\n[problem:CodeForces-343E]\n[problem:洛谷-P3729]\n耳分解与双极定向\n[problem:洛谷-P5776]参考洛谷题解区ix35题解\n[problem:Gym-102759C]参考题解:https://www.cnblogs.com/crashed/p/15143366.html\n[problem:CodeChef-CUREK]参考题解:https://zx2003.blog.uoj.ac/blog/7299\n[problem:洛谷-P5811]同上\n2-SAT进阶练习题单:\nhttps://www.luogu.com.cn/training/20236#problems\n二分图进阶练习题单:\nhttps://www.luogu.com.cn/training/79728#problems\nhttps://www.luogu.com.cn/training/6686#problems\n最大流进阶练习题单:\nhttps://www.luogu.com.cn/training/3346#problems\n网络流进阶练习题单:\nhttps://www.luogu.com.cn/training/1230#problems\n费用流进阶练习题单:\nhttps://www.luogu.com.cn/training/4874#problems\n上下界网络流进阶练习题单:\nhttps://www.luogu.com.cn/training/8462#problems\n\u003cfont size\u003d5\u003e其它杂项\u003c/font\u003e\n随机化算法(学习资料:https://oi-wiki.org/misc/rand-technique/ )\n[problem:CodeChef-SELEDGE]用随机集合覆盖目标元素\n[problem:Gym-101550I]用随机元素命中目标集合\n[problem:CSES-1685]用随机元素命中目标集合\n[problem:TopCoder-11705]用随机化获得随机数据的性质,随机增量法\n[problem:洛谷-P2533]随机增量法\n[problem:UniversalOJ-207]随机化用于哈希\n[problem:CodeChef-PANIC]随机化用于哈希\n[problem:UniversalOJ-552]随机化用于哈希\n[problem:CodeForces-1267G]耦合的技巧\n[problem:洛谷-P1337]爬山算法,亦可模拟退火\n[problem:洛谷-P5544]模拟退火\n[problem:洛谷-P2503]模拟退火\n[problem:AtCoder-abc314_h]模拟退火。比赛时碰到了,然鹅当时并不会。随机增量法是否亦可行?\n[problem:洛谷-P3878]模拟退火\n随机化算法练习题单:https://www.luogu.com.cn/training/20006#information\nhttps://www.luogu.com.cn/training/39093#problems\n\n思维/构造的题目\n[problem:CodeForces-1187C]\n[problem:CodeForces-922F]\n[problem:CodeForces-909F]\n[problem:CodeForces-802H]\n[problem:CodeForces-26C]\n[problem:CodeForces-109D]\n[problem:洛谷-P6663]\nAd-hoc的题目(洛谷搜索Ad-hoc标签的题目并去重)\n[problem:洛谷-P7205]\n[problem:洛谷-P7966]\n[problem:洛谷-P8866]\n[problem:CodeForces-542A]\n[problem:AtCoder-arc163_e]\n[problem:AtCoder-agc058_c]\n[problem:AtCoder-agc059_a]\n[problem:CodeForces-1806C]\n[problem:AtCoder-agc058_e]\n[problem:AtCoder-agc059_e]\n[problem:AtCoder-agc060_e]\n[problem:AtCoder-agc059_f]\n[problem:AtCoder-agc056_b]\n[problem:AtCoder-agc057_f]\n[problem:洛谷-P8747]\n[problem:洛谷-P2351]\n[problem:洛谷-P9674]\n[problem:洛谷-P7413]\n[problem:洛谷-P9643]\n[problem:洛谷-P9495]\n[problem:洛谷-P7356]\n[problem:洛谷-P7390]\n[problem:洛谷-P9575]\n[problem:洛谷-P9591]\n[problem:洛谷-P9054]\n思维/构造题单:\nhttps://www.luogu.com.cn/training/4865#problems\nhttps://www.luogu.com.cn/training/14#problems\nhttps://www.luogu.com.cn/training/293571#problems","threadId":141210,"likeCnt":10,"createTime":1681090381000,"isWorkbook":true,"viewCnt":3846,"openness":2,"fav":false,"id":3567,"trustable":false}