Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P3810\":[\"三维偏序(陌上花开)\",17770,\"模板\"],\"QOJ-5246\":[\"Nawiasowe podziały [B]\",1,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1069\\\"\\u003ePotyczki Algorytmiczne 2022, Runda 5\\u003c/a\\u003e\"],\"UniversalOJ-217\":[\"奇怪的线段树\",199,\"UNR #1\"],\"UniversalOJ-216\":[\"Jakarta Skyscrapers\",245,\"UNR #1\"],\"UniversalOJ-455\":[\"雪灾与外卖\",540,\"UER #8\"],\"UniversalOJ-457\":[\"数树\",86,\"WC2019\"],\"CodeForces-835D\":[\"Palindromic characteristics\",4149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"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\"],\"洛谷-P3380\":[\"树套树\",10775,\"模板\"],\"UniversalOJ-172\":[\"论战捆竹竿\",184,\"WC2016\"],\"洛谷-P4198\":[\"楼房重建\",6813,null],\"洛谷-P5044\":[\"meetings 会议\",440,\"IOI2018\"],\"QOJ-5013\":[\"Astral Birth\",95,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1031\\\"\\u003e2022-2023 集训队互测 Round 1 (Oct 30, 2022)\\u003c/a\\u003e\"],\"AtCoder-agc003_d\":[\"Anticube\",192,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc003\\\"\\u003eAtCoder Grand Contest 003\\u003c/a\\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\"],\"LibreOJ-6714\":[\"Stupid Product\",114,null],\"CodeForces-1416E\":[\"Split\",274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1416\\\"\\u003eCodeforces Round 673 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1307G\":[\"Cow and Exercise\",515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1307\\\"\\u003eCodeforces Round 621 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1368\":[\"最小表示法\",7742,\"模板\"],\"洛谷-P5325\":[\"Min_25 筛\",4871,\"模板\"],\"洛谷-P6816\":[\"Quasi-template\",133,\"PA2009\"],\"Gym-103470E\":[\"Paimon Segment Tree\",148,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103470\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 ICPC Asia Nanjing Regional Contest (XXII Open Cup, Grand Prix of Nanjing)\\u003c/a\\u003e\"],\"UniversalOJ-748\":[\"机器人表演\",380,\"UNR #6\"],\"洛谷-P5608\":[\"文化课\",255,\"Ynoi2013\"],\"UniversalOJ-503\":[\"扫除\",47,\"JOISC2020\"],\"LibreOJ-6274\":[\"数字\",281,null],\"Gym-101620C\":[\"Cumulative Code\",54,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101620\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17)\\u003c/a\\u003e\"],\"CodeForces-1229E2\":[\"Marek and Matching (hard version)\",5,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1229\\\"\\u003eCodeforces Round 588 (Div. 1)\\u003c/a\\u003e\"],\"UniversalOJ-221\":[\"循环之美\",656,\"NOI2016\"],\"QOJ-5089\":[\"环覆盖\",43,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1046\\\"\\u003e2022-2023 集训队互测 Round 8 (Nov 17, 2022)\\u003c/a\\u003e\"],\"洛谷-P4762\":[\"Virus synthesis\",1269,\"CERC2014\"],\"洛谷-P7353\":[\"Tom \\u0026 Jerry\",120,\"2020-2021 集训队作业\"],\"UniversalOJ-181\":[\"密码锁\",305,\"UR #12\"],\"LibreOJ-3412\":[\"不讲武德\",12,\"2020-2021 集训队作业\"],\"洛谷-P4767\":[\"邮局\",4333,\"IOI2000\"],\"洛谷-P5612\":[\"Ynoi\",41,\"Ynoi2013\"],\"LibreOJ-2568\":[\"烟花表演\",254,\"APIO2016\"],\"AtCoder-arc070_c\":[\"NarrowRectangles\",31,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc070\\\"\\u003eAtCoder Regular Contest 070\\u003c/a\\u003e\"],\"SPOJ-NSUBSTR\":[\"Substrings\",2044,\"Immagination\"],\"洛谷-P5979\":[\"Druzyny\",328,\"PA2014\"],\"LibreOJ-6401\":[\"yww 与字符串\",208,null],\"CodeForces-1552H\":[\"Guess the Perimeter\",324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"AtCoder-arc093_d\":[\"Dark Horse\",135,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc093\\\"\\u003eAtCoder Regular Contest 093\\u003c/a\\u003e\"],\"UniversalOJ-712\":[\"简单数据结构\",81,\"北大集训2021\"],\"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\"],\"UniversalOJ-559\":[\"命运\",150,\"NOI2020\"],\"UniversalOJ-395\":[\"你的名字\",562,\"NOI2018\"],\"UniversalOJ-670\":[\"获奖名单\",311,\"UNR #5\"],\"CodeChef-CUREK\":[\"Curing Kingdom\",38,\"lg5293\"],\"洛谷-P8456\":[\"地地铁铁\",327,\"SWTR-8\"],\"LibreOJ-10035\":[\"Power Strings\",2702,\"一本通 2.1 练习 1\"],\"QOJ-5036\":[\"卑鄙的下毒人\",46,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1038\\\"\\u003e2022-2023 集训队互测 Round 7 (Nov 13, 2022)\\u003c/a\\u003e\"],\"CodeForces-1091G\":[\"New Year and the Factorisation Collaboration\",194,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1091\\\"\\u003eGood Bye 2018\\u003c/a\\u003e\"],\"CodeForces-671E\":[\"Organizing a Race\",414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/671\\\"\\u003eCodeforces Round 352 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-agc023_e\":[\"Inversions\",63,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc023\\\"\\u003eAtCoder Grand Contest 023\\u003c/a\\u003e\"],\"洛谷-P3688\":[\"树状数组\",759,\"ZJOI2017\"],\"洛谷-P4899\":[\"werewolf 狼人\",1568,\"IOI2018\"],\"QOJ-6504\":[\"Flower\\u0027s Land 2\",141,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1244\\\"\\u003e第八届中国大学生程序设计竞赛总决赛(CCPC Final 2022)\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1244?v\\u003d1\\\"\\u003eThe 1st Universal Cup. Stage 17: Guangzhou\\u003c/a\\u003e\"],\"LibreOJ-3387\":[\"字符串匹配\",396,\"NOIP2020\"],\"QOJ-4686\":[\"Tours\",61,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/280\\\"\\u003eACM-ICPC World Finals 2015 - Marrakesh\\u003c/a\\u003e\"],\"洛谷-P3206\":[\"城市建设\",1240,\"HNOI2010\"],\"UniversalOJ-607\":[\"跳蚤电话\",345,\"UR #20\"],\"CodeForces-1765J\":[\"Hero to Zero\",186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"SPOJ-PHRASES\":[\"Relevant Phrases of Annihilation\",1146,\"DASM Programming League 2004 (problemset 1)\"],\"CodeForces-1810H\":[\"Last Number\",131,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1810\\\"\\u003eCodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"QOJ-6508\":[\"This is not an Abnormal Team!\",103,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1244\\\"\\u003e第八届中国大学生程序设计竞赛总决赛(CCPC Final 2022)\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1244?v\\u003d1\\\"\\u003eThe 1st Universal Cup. Stage 17: Guangzhou\\u003c/a\\u003e\"],\"CodeForces-708E\":[\"Student\\u0027s Camp\",1041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1810G\":[\"The Maximum Prefix\",716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1810\\\"\\u003eCodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"洛谷-P9394\":[\"白鹭兰\",79,null],\"Gym-102331J\":[\"Jiry Matchings\",114,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102331\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2019 Summer Petrozavodsk Camp, Day 2: 300iq Contest 2 (XX Open Cup, Grand Prix of Kazan)\\u003c/a\\u003e\"],\"CodeForces-981A\":[\"Antipalindrome\",10311,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"Gym-102331H\":[\"Honorable Mention\",126,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102331\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2019 Summer Petrozavodsk Camp, Day 2: 300iq Contest 2 (XX Open Cup, Grand Prix of Kazan)\\u003c/a\\u003e\"],\"CodeForces-666E\":[\"Forensic Examination\",1459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/666\\\"\\u003eCodeforces Round 349 (Div. 1)\\u003c/a\\u003e\"],\"AtCoder-agc034_d\":[\"Manhattan Max Matching\",90,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc034\\\"\\u003eAtCoder Grand Contest 034\\u003c/a\\u003e\"],\"洛谷-P5471\":[\"弹跳\",1603,\"NOI2019\"],\"洛谷-P6164\":[\"后缀平衡树\",437,\"模板\"],\"AtCoder-agc030_d\":[\"Inversion Sum\",309,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc030\\\"\\u003eAtCoder Grand Contest 030\\u003c/a\\u003e\"],\"洛谷-P2483\":[\"k 短路 / [SDOI2010] 魔法猪学院\",3016,\"模板\"],\"QOJ-6351\":[\"Exact Subsequences\",32,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1212\\\"\\u003ePetrozavodsk Winter 2023. Day 6: Um_nik mod 998 244 353 Contest\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1212?v\\u003d1\\\"\\u003eThe 1st Universal Cup. Stage 13: Iberia\\u003c/a\\u003e\"],\"洛谷-P3337\":[\"防守战线\",565,\"ZJOI2013\"],\"LibreOJ-2304\":[\"泳池\",225,\"NOI2017\"],\"UniversalOJ-418\":[\"三角形\",290,\"集训队作业2018\"],\"SPOJ-DIVCNT3\":[\"Counting Divisors (cube)\",452,\"\"],\"CodeForces-1534G\":[\"A New Beginning\",566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1534\\\"\\u003eCodeforces LATOKEN Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-528C\":[\"Data Center Drama\",164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/528\\\"\\u003eCodeforces Round 296 (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\"],\"UniversalOJ-134\":[\"App 管理器\",404,\"UR #9\"],\"Gym-101221H\":[\"Pachinko\",55,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101221\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014 ACM-ICPC World Finals\\u003c/a\\u003e\"],\"Gym-101221I\":[\"Sensor Network\",205,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101221\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014 ACM-ICPC World Finals\\u003c/a\\u003e\"],\"CodeForces-653F\":[\"Paper task\",1028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-10059\":[\"Censoring\",623,\"一本通 2.4 练习 2\"],\"黑暗爆炸-4278\":[\"Tasowanie\",75,\"ONTAK2015\"],\"LibreOJ-141\":[\"回文子串\",154,null],\"Gym-102201C\":[\"Cactus Determinant\",56,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102201\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eMoscow Pre-Finals Workshop 2019. KAIST Contest\\u003c/a\\u003e\"],\"CodeForces-1408H\":[\"Rainbow Triples\",357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"AtCoder-arc141_f\":[\"Well-defined Abbreviation\",15,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc141\\\"\\u003eAtCoder Regular Contest 141\\u003c/a\\u003e\"],\"洛谷-P4555\":[\"最长双回文串\",6227,\"国家集训队\"],\"洛谷-P4556\":[\"雨天的尾巴 /【模板】线段树合并\",11937,\"Vani有约会\"],\"LibreOJ-2033\":[\"生成魔咒\",858,\"SDOI2016\"],\"LibreOJ-3089\":[\"奥术神杖\",513,\"BJOI2019\"],\"洛谷-P6619\":[\"冰火战士\",2547,\"省选联考 2020 A/B 卷\"],\"洛谷-P2414\":[\"阿狸的打字机\",5002,\"NOI2011\"],\"UniversalOJ-42\":[\"Sum\",146,\"清华集训2014\"],\"CodeChef-TASUFFIX\":[\"Very Long Suffix Array\",223,\"tuan_adm\"],\"洛谷-P5490\":[\"扫描线\",20452,\"模板\"],\"洛谷-P5494\":[\"线段树分裂\",4622,\"模板\"],\"LibreOJ-150\":[\"挑战多项式\",1822,null],\"CodeForces-571E\":[\"Geometric Progressions\",260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/571\\\"\\u003eCodeforces Round 317 [AimFund Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4287\":[\"双倍回文\",3820,\"SHOI2011\"],\"洛谷-P9335\":[\"雪に咲く花\",342,\"Ynoi2001\"],\"LibreOJ-2246\":[\"动物园\",634,\"NOI2014\"],\"洛谷-P6109\":[\"rprmq1\",604,\"Ynoi2009\"],\"洛谷-P5776\":[\"Quare\",151,\"SNOI2013\"],\"洛谷-P6106\":[\"Self Adjusting Top Tree\",58,\"Ynoi2010\"],\"CodeForces-364D\":[\"Ghd\",2178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/364\\\"\\u003eCodeforces Round 213 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2305\":[\"购票\",2258,\"NOI2014\"],\"洛谷-P4605\":[\"物理实验\",376,\"SDOI2018\"],\"洛谷-P7712\":[\"hlcpq\",149,\"Ynoi2077\"],\"LibreOJ-6289\":[\"花朵\",354,null],\"UniversalOJ-513\":[\"清扫银河\",206,\"UR #19\"],\"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\"],\"LibreOJ-2083\":[\"优秀的拆分\",684,\"NOI2016\"],\"LibreOJ-6041\":[\"事情的相似度\",889,\"雅礼集训 2017 Day7\"],\"CodeForces-704D\":[\"Captain America\",887,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/704\\\"\\u003eCodeforces Round 366 (Div. 1)\\u003c/a\\u003e\"],\"UniversalOJ-477\":[\"氪金手游\",52,\"CTS2019\"],\"UniversalOJ-476\":[\"重复\",51,\"CTS2019\"],\"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\"],\"CodeForces-526F\":[\"Pudding Monsters\",2468,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"黑暗爆炸-4974\":[\"字符串大师\",229,\"Lydsy1708月赛\"],\"CodeForces-611H\":[\"New Year and Forgotten Tree\",675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/611\\\"\\u003eGood Bye 2015\\u003c/a\\u003e\"],\"洛谷-P4690\":[\"镜中的昆虫\",1007,\"Ynoi2016\"],\"CodeForces-1264D2\":[\"Beautiful Bracket Sequence (hard version)\",941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1264\\\"\\u003eCodeforces Round 604 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4213\":[\"杜教筛\",11846,\"模板\"],\"UniversalOJ-191\":[\"Unknown\",135,\"集训队互测2016\"],\"QOJ-6681\":[\"Triangle City\",91,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1277\\\"\\u003eThe 1st Universal Cup. Stage 21: Shandong\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1281\\\"\\u003eThe 2019 ICPC China Shandong Provincial Programming Contest\\u003c/a\\u003e\"],\"LibreOJ-2137\":[\"诸神眷顾的幻想乡\",308,\"ZJOI2015\"],\"CodeForces-1515G\":[\"Phoenix and Odometers\",976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1515\\\"\\u003eCodeforces Global Round 14\\u003c/a\\u003e\"],\"洛谷-P5028\":[\"Annihilate\",286,null],\"洛谷-P5787\":[\"二分图 /【模板】线段树分治\",5347,null],\"LibreOJ-2133\":[\"品酒大会\",632,\"NOI2015\"],\"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\"],\"LibreOJ-2377\":[\"差异\",669,\"AHOI2013\"],\"LibreOJ-6053\":[\"简单的函数\",2282,null],\"CodeForces-1336E2\":[\"Chiori and Doll Picking (hard version)\",294,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1336\\\"\\u003eCodeforces Round 635 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1313E\":[\"Concatenation with intersection\",543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"UniversalOJ-769\":[\"二次整数规划问题\",17,\"NOI2022\"],\"Gym-104090J\":[\"Painting\",5,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104090\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Hangzhou Regional Programming Contest\\u003c/a\\u003e\"],\"CodeForces-1030G\":[\"Linear Congruential Generator\",364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1030\\\"\\u003eTechnocup 2019 - Elimination Round 1\\u003c/a\\u003e\"],\"UniversalOJ-765\":[\"移除石子\",89,\"NOI2022\"],\"LibreOJ-138\":[\"类欧几里得算法\",459,null],\"LibreOJ-537\":[\"DNA 序列\",1793,\"LibreOJ NOIP Round #1\"],\"UniversalOJ-480\":[\"序列\",187,\"NOI2019\"],\"洛谷-P6246\":[\"邮局 加强版\",1028,\"IOI2000\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"lostintianyi","updateTime":1691368144000,"title":"ZR 2023 Summer B Workbook (Unofficial)","dislikeCnt":0,"content":"# ZR 2023 Summer A / B / [C](https://vjudge.net/article/3852) / [D](https://vjudge.net/article/3910) Workbook\n## Day1\n- 专题:状压、数位、期望$^\\dag$、计数DP;数据结构优化DP;倍增优化$^\\dag$;斜率优化;决策单调性优化;四边形不等式;判定转DP$^\\ddag$;\n- 讲师:花花\n- 题目:13 道\n\n[problem:洛谷-P4767]\n[problem:洛谷-P6246]\n[problem:Gym-103860I]\n[problem:QOJ-5246]\n[problem:LibreOJ-6274]\n[problem:UniversalOJ-748]\n[problem:AtCoder-agc022_e]\n[problem:UniversalOJ-765]\n[problem:UniversalOJ-559]\n[problem:QOJ-4815]\n[problem:CodeForces-1416E]\n[problem:CodeForces-1500F]\n[problem:LibreOJ-6289]\n## Day2\n- 专题:Trie;Manacher;扩展KMP;AC自动机;PAM;SA;SAM;后缀平衡树;广义 SAM\n- 讲师:ynycoding\n- 题目:22+14\u003d36道\n\n**Basic String Algorithms:**\n[problem:黑暗爆炸-4974]\n[problem:LibreOJ-10035]\n[problem:LibreOJ-2246]\n[problem:LibreOJ-3387]注意文件IO\n[problem:LibreOJ-537]\n[problem:LibreOJ-10059]\n[problem:洛谷-P2414]\n[problem:AtCoder-arc141_f]\n[problem:洛谷-P4555]\n[problem:LibreOJ-141]回文自动机参考代码\n[problem:洛谷-P4287]\n[problem:CodeForces-835D]K-palindrome String,原题 $|s|\\le 5000$\n[problem:洛谷-P4762]\n[problem:CodeForces-932G]\n[problem:CodeForces-981A]Non-palindrome String,原题 $|s|\\le 50$\n[problem:SPOJ-PHRASES]Anti-overlap String,原题 $|s|\\le 1.5\\times 10^4$\n[problem:洛谷-P1368]最小表示\n[problem:CodeForces-653F]Brackets\n[problem:LibreOJ-3089]\n[problem:CodeForces-1313E]\n[problem:UniversalOJ-172]\n[problem:UniversalOJ-476]\n**Suffix Data Structures:**\n[problem:LibreOJ-2377]\n[problem:LibreOJ-2083]\n[problem:洛谷-P5028]\n[problem:LibreOJ-2133]\n[problem:黑暗爆炸-4278]\n[problem:CodeChef-TASUFFIX]\n[problem:SPOJ-NSUBSTR]简单题\n[problem:LibreOJ-6401]\n[problem:LibreOJ-2033]放松题\n[problem:LibreOJ-6041]\n[problem:UniversalOJ-395]\n[problem:洛谷-P6816]PA2009 sza\n[problem:洛谷-P6164]\n[problem:CodeForces-666E]\n[problem:LibreOJ-2137]\n## Day3\n- 专题:筛法;中国剩余定理(CRT, exCRT);扩展欧几里得算法;Lucas定理;逆元、欧拉定理、费马小定理;\n- 讲师:QAQAutoMaton\n- 题目:2+10\u003d12道\n[problem:AtCoder-agc003_d]\n[problem:LibreOJ-6714]\n[problem:CodeForces-364D]\n[problem:CodeForces-571E]\n[problem:SPOJ-DIVCNT3]\n[problem:CodeForces-1552H]\n[problem:UniversalOJ-216]\n[problem:CodeForces-1091G]\n[problem:CodeForces-1030G]\n[problem:UniversalOJ-221]\nISIJ的题目找不到……原版也没有\nCodePlus题「校门外的树」无法提交\n**其他提到的题与模板题**\n[problem:LibreOJ-150]\n[problem:洛谷-P4213]\n[problem:洛谷-P5325]\n[problem:LibreOJ-6053]\n[problem:LibreOJ-138]\n## Day4\n- 专题:概率期望;⼆项式定理$^\\dag$、容斥原理、卡特兰数$^\\dag$;矩阵乘法、矩阵快速幂、高斯消元、行列式、线性基\n- 讲师:QAQAutoMaton\n- 题目:1+15\u003d16道\n\n[problem:Gym-102201C]仙人掌行列式\n[problem:CodeForces-708E]\n[problem:AtCoder-arc093_d]本场ARC只有CDEF四题,F编号为D\n[problem:CodeForces-1229E2]\n[problem:CodeForces-1810G]\n[problem:UniversalOJ-513]\n[problem:Gym-101221H]\n[problem:QOJ-6504]即CCPCF2022D,Flower\u0027s Land 2\n[problem:UniversalOJ-181]\n[problem:CodeForces-1264D2]\n[problem:AtCoder-agc030_d]\n[problem:LibreOJ-2304]\n[problem:UniversalOJ-477]\n[problem:UniversalOJ-607]\n[problem:AtCoder-agc023_e]\n「白鱼赤乌」没有提交途径\n\n## Day5\n- 专题:欧拉回路;网络流;Prufer 序列;二分图最大权匹配\n- 讲师:QAQAutoMaton\n- 题目:13道\n\n[problem:UniversalOJ-457]「经典题」是其中的一个部分\n[problem:CodeForces-1229E2]\n[problem:QOJ-6681]\n[problem:CodeForces-704D]\n[problem:CodeForces-1408H]\n[problem:CodeForces-611H]\n[problem:Gym-101221I]\n[problem:UniversalOJ-670]\n[problem:UniversalOJ-217]\n[problem:CodeForces-528C]\n[problem:Gym-101620C]\n[problem:AtCoder-agc034_d]\n[problem:QOJ-6508]\n\n## Day6\n- 原专题$^\\dag$:字符串组合理论;基本子串结构;Lyndon 理论、Significant-Suffix;Runs 理论;基本子串字典\n- 新专题$^\\ddag$:线性规划 \u0026 对偶;模拟费用流 \u0026 凸优化;乘积优化;双无向图连通性,圆方树;双极定向;耳分解;偶子图,割空间,环空间;有向图连通性;类欧几里得,万能欧几里得\n- 讲师:ix35\n- 题目:4+12(13)+14\u003d30(31)道\n\n\n[problem:洛谷-P8456]\n[problem:洛谷-P7353]\n[problem:洛谷-P5776]\n[problem:CodeChef-CUREK]\n[problem:洛谷-P9394]\n[problem:QOJ-5089]\n[problem:CodeForces-1336E2]上一题的另一做法前置\n[problem:QOJ-4686]\n[problem:UniversalOJ-134]\n[problem:CodeForces-1515G]\n[problem:UniversalOJ-42]\n[problem:CodeForces-1810H]\n[problem:QOJ-6351]\n「有向图周期」、「模意义有理逼近」、「PKUSC 2023 D2T3」不知道能在哪交。\n[problem:CodeForces-1765J]\n[problem:QOJ-5036]\n[problem:洛谷-P3337]\n[problem:CodeForces-1307G]\n[problem:UniversalOJ-480]\n[problem:Gym-102331H]\n[problem:Gym-102331J]\n[problem:QOJ-5013]\n[problem:UniversalOJ-455]\n[problem:CodeForces-1534G]\n[problem:AtCoder-arc070_c]即[ARC 070 E] Narrow Rectangles\n[problem:LibreOJ-2568]\n[problem:UniversalOJ-769]\n[problem:LibreOJ-3412][NFLSPC 3] 不讲武德\n\n「PKUSC 2023 D2T2」不知道能在哪交。\n\n## Day7\n- 专题:扫描线;线段树合并;权值线段\n树;动态开点线段树;CDQ分治;二进制分组;时间线段树;可持久化数据结构\n- 讲师:juruocjl\n- 题目:34+2\u003d36题\n\n[problem:洛谷-P5490]经典扫描线\n[problem:洛谷-P4605]不交线段扫描线 1\n[problem:CodeForces-704E]不交线段扫描线 2\n[problem:洛谷-P6106]不交线段扫描线 3\n[problem:洛谷-P3810]经典 CDQ\n[problem:洛谷-P4690]转化 CDQ\n[problem:CodeForces-568E]CDQ 优化 DP 1\n[problem:洛谷-P5979]CDQ 优化 DP 2\n[problem:洛谷-P6619]不那么板的线段树二分\n[problem:Gym-104090J]平衡树二分\n[problem:洛谷-P4556]线段树合并\n[problem:洛谷-P5494]线段树分裂\n[problem:洛谷-P5612]一个题\n[problem:洛谷-P5044]另一个题\n[problem:UniversalOJ-418]需要转化一下的题\n[problem:洛谷-P4198]经典题\n[problem:CodeForces-671E]改编题 2\n[problem:洛谷-P5787]经典题\n[problem:洛谷-P3206]也是经典题\n[problem:UniversalOJ-503]稍微上点强度\n[problem:洛谷-P6109]强度不够?\n[problem:洛谷-P3380]模板题\n[problem:洛谷-P5471]优化最短路\n[problem:洛谷-P3688]标记永久化\n[problem:洛谷-P4899]需要转化的题\n[problem:洛谷-P2483]另一个需要转化的题\n[problem:Gym-103470E]一个经典技巧\n[problem:洛谷-P9335]一个题\n[problem:洛谷-P7712]一个题(2)\n[problem:洛谷-P5608]一个题(3)\n[problem:CodeForces-526F]也许是比较经典的套路\n[problem:UniversalOJ-712]一个题(4)\n[problem:UniversalOJ-191]二进制分组\n[problem:洛谷-P2305]另一个题\n「变形扫描线」、「改编题」不知道在哪里交\n**注:**\n$^\\dag$: 带有此标记的是在课表中但是没有讲的\n$^\\ddag$: 带有此标记的是不在课表中但是讲了的内容","threadId":152642,"likeCnt":21,"createTime":1690717042000,"isWorkbook":true,"viewCnt":3982,"openness":2,"fav":false,"id":3908,"trustable":false}