{"workbook":{"problemsBrief":"{\"Kattis-segmentintersection\":[\"Line Segment Intersection\",534,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/KTH%20CSC%20Popup%202005\\\"\\u003eKTH CSC Popup 2005\\u003c/a\\u003e\"],\"CodeForces-1906M\":[\"Triangle Construction\",3337,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1906L\":[\"Palindromic Parentheses\",716,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1906K\":[\"Deck-Building Game\",436,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1906J\":[\"Count BFS Graph\",1051,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-277E\":[\"Binary Tree on Plane\",1541,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/277\\\"\\u003eCodeforces Round 170 (Div. 1)\\u003c/a\\u003e\"],\"QOJ-1964\":[\"Stock Price Prediction\",55,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/792\\\"\\u003eThe 2021 ICPC Asia Seoul Regional Contest\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/792?v\\u003d1\\\"\\u003eMoscow International Workshop 2021. Day 4. Korean Contest\\u003c/a\\u003e\"],\"CodeForces-1906I\":[\"Contingency Plan 2\",205,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1906H\":[\"Twin Friends\",1028,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-56D\":[\"Changing a String\",2639,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"Gym-100486G\":[\"Simple Polygon\",15,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100486\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014-2015 CT S02E02: Codeforces Trainings Season 2 Episode 2 (CTU Open 2011 + misc)\\u003c/a\\u003e\"],\"CodeForces-1849E\":[\"Max to the Right of Min\",2206,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1912\":[\"诗人小G\",6639,\"NOI2009\"],\"Gym-101512A\":[\"Avoiding the Apocalypse\",207,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101512\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014 Benelux Algorithm Programming Contest (BAPC 14)\\u003c/a\\u003e\"],\"Gym-104790K\":[\"King of the Hill\",164,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104790\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023 Benelux Algorithm Programming Contest (BAPC 23)\\u003c/a\\u003e\"],\"Gym-104670J\":[\"Joint Jog Jam\",273,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104670\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021)\\u003c/a\\u003e\"],\"洛谷-P4072\":[\"征途\",6559,\"SDOI2016\"],\"Gym-104670D\":[\"Deceptive Directions\",123,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104670\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021)\\u003c/a\\u003e\"],\"Gym-104670G\":[\"Grazed Grains\",204,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104670\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021)\\u003c/a\\u003e\"],\"Gym-104832H\":[\"Task Assignment to Two Employees\",96,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104832\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023-2024 ICPC, Asia Yokohama Regional Contest 2023\\u003c/a\\u003e\"],\"Gym-104832J\":[\"Do It Yourself?\",122,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104832\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023-2024 ICPC, Asia Yokohama Regional Contest 2023\\u003c/a\\u003e\"],\"洛谷-P9520\":[\"监狱 / Jail\",422,\"JOIST 2022\"],\"Gym-104832E\":[\"Chayas\",182,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104832\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023-2024 ICPC, Asia Yokohama Regional Contest 2023\\u003c/a\\u003e\"],\"AtCoder-abc302_f\":[\"Merge Set\",1344,\"\\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\"],\"AtCoder-arc169_c\":[\"Not So Consecutive\",537,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc169\\\"\\u003eestie Programming Contest 2023 (AtCoder Regular Contest 169)\\u003c/a\\u003e\"],\"CodeForces-1876C\":[\"Autosynthesis\",2741,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1876\\\"\\u003eCodeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"Kattis-krotating\":[\"K-Rotating\",64,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202017%20ACM%20-%20ICPC%20Asia%20Ho%20Chi%20Minh%20City%20Regional%20Contest\\\"\\u003eThe 2017 ACM - ICPC Asia Ho Chi Minh City Regional Contest\\u003c/a\\u003e\"],\"QOJ-6569\":[\"Splitting Pairs\",139,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1248\\\"\\u003e2022-2023 ICPC North America Championship\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1248?v\\u003d1\\\"\\u003eThe 1st Universal Cup. Stage 19: America\\u003c/a\\u003e\"],\"QOJ-1957\":[\"Friendship Graphs\",150,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/792\\\"\\u003eThe 2021 ICPC Asia Seoul Regional Contest\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/792?v\\u003d1\\\"\\u003eMoscow International Workshop 2021. Day 4. Korean Contest\\u003c/a\\u003e\"],\"CodeForces-1903D2\":[\"Maximum And Queries (hard version)\",973,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1036E\":[\"Covered Points\",1845,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"QOJ-1954\":[\"Ant Colonies\",53,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/792\\\"\\u003eThe 2021 ICPC Asia Seoul Regional Contest\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/792?v\\u003d1\\\"\\u003eMoscow International Workshop 2021. Day 4. Korean Contest\\u003c/a\\u003e\"],\"CodeForces-1800G\":[\"Symmetree\",2652,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1800\\\"\\u003eCodeforces Round 855 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-508D\":[\"Tanya and Password\",4480,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/508\\\"\\u003eCodeforces Round 288 (Div. 2)\\u003c/a\\u003e\"],\"Gym-104021E\":[\"XOR Tree\",94,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104021\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC Asia Yinchuan Regional Contest\\u003c/a\\u003e\"],\"Gym-104021D\":[\"Easy Problem\",207,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104021\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC Asia Yinchuan Regional Contest\\u003c/a\\u003e\"],\"Gym-104021F\":[\"Function!\",458,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104021\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC Asia Yinchuan Regional Contest\\u003c/a\\u003e\"],\"Gym-101252D\":[\"Sequence analysis\",121,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101252\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2009-2010 ACM-ICPC, NEERC, Southern Subregional Contest\\u003c/a\\u003e\"],\"Gym-104021H\":[\"Delivery Route\",224,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104021\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC Asia Yinchuan Regional Contest\\u003c/a\\u003e\"],\"Gym-104021K\":[\"Largest Common Submatrix\",379,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104021\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC Asia Yinchuan Regional Contest\\u003c/a\\u003e\"],\"CodeForces-1906B\":[\"Button Pressing\",736,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"Gym-104021C\":[\"Image Processing\",44,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104021\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC Asia Yinchuan Regional Contest\\u003c/a\\u003e\"],\"洛谷-P5574\":[\"任务分配问题\",1336,\"CmdOI2019\"],\"Gym-102700F\":[\"Free restricted flights\",144,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102700\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020 ICPC Universidad Nacional de Colombia Programming Contest\\u003c/a\\u003e\"],\"QOJ-4579\":[\"XOR Pairs\",115,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/989\\\"\\u003e2021-2022 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"QOJ-5548\":[\"Increase the Toll Fees\",136,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1109\\\"\\u003e2022-2023 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"Gym-102219E\":[\"Optimal Slots\",842,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102219\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2019 ICPC Malaysia National\\u003c/a\\u003e\"],\"QOJ-5544\":[\"Grid Game\",57,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1109\\\"\\u003e2022-2023 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"QOJ-5543\":[\"The Only Mode\",58,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1109\\\"\\u003e2022-2023 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"CodeForces-1904F\":[\"Beautiful Tree\",521,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1822G2\":[\"Magic Triples (Hard Version)\",2866,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1904E\":[\"Tree Queries\",1234,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"QOJ-5545\":[\"Contingency Plan\",83,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1109\\\"\\u003e2022-2023 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"Kattis-bipartitebattle\":[\"Bipartite Battle\",68,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202018%20ICPC%20Asia%20Hanoi%20Regional%20Contest\\\"\\u003eThe 2018 ICPC Asia Hanoi Regional Contest\\u003c/a\\u003e\"],\"LibreOJ-6002\":[\"最小路径覆盖\",1384,\"网络流 24 题\"],\"LibreOJ-6001\":[\"太空飞行计划\",1656,\"网络流 24 题\"],\"LightOJ-1268\":[\"Unlucky Strings\",527,null],\"Gym-101635K\":[\"Blowing Candles\",758,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101635\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2017)\\u003c/a\\u003e\"],\"CodeForces-833B\":[\"The Bakery\",7039,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"Gym-102465K\":[\"Dishonest Driver\",724,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102465\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018-2019 ICPC Southwestern European Regional Programming Contest (SWERC 2018)\\u003c/a\\u003e\"],\"Gym-102562I\":[\"Mafia\",34,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102562\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eAGM 2020, Final Round, Day 1\\u003c/a\\u003e\"],\"CodeForces-845G\":[\"Shortest Path Problem?\",2131,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"Kattis-famouspagoda\":[\"Famous Pagoda\",265,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202017%20ACM%20-%20ICPC%20Asia%20Ho%20Chi%20Minh%20City%20Regional%20Contest\\\"\\u003eThe 2017 ACM - ICPC Asia Ho Chi Minh City Regional Contest\\u003c/a\\u003e\"],\"QOJ-4583\":[\"Concerto de Pandemic\",39,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/989\\\"\\u003e2021-2022 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"Gym-102700A\":[\"Approach\",154,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102700\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020 ICPC Universidad Nacional de Colombia Programming Contest\\u003c/a\\u003e\"],\"洛谷-P5344\":[\"逛森林\",940,\"XR-1\"],\"QOJ-4580\":[\"Bicycle Tour\",104,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/989\\\"\\u003e2021-2022 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"QOJ-5537\":[\"Storing Eggs\",82,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1109\\\"\\u003e2022-2023 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"AtCoder-abc326_f\":[\"Robot Rotation\",704,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc326\\\"\\u003ePanasonic Programming Contest 2023（AtCoder Beginner Contest 326）\\u003c/a\\u003e\"],\"AtCoder-arc142_d\":[\"Deterministic Placing\",73,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc142\\\"\\u003eAtCoder Regular Contest 142\\u003c/a\\u003e\"],\"CodeChef-CHEFDAG\":[\"Chef and DAG\",479,\"rahuldugar\"],\"CodeForces-1856E2\":[\"PermuTree (hard version)\",1733,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1856\\\"\\u003eCodeforces Round 890 (Div. 2) supported by Constructor Institute\\u003c/a\\u003e\"],\"CodeForces-1903F\":[\"Babysitting\",879,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"Kattis-jurassicjungle\":[\"Jurassic Jungle\",91,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202018%20ICPC%20Asia%20Hanoi%20Regional%20Contest\\\"\\u003eThe 2018 ICPC Asia Hanoi Regional Contest\\u003c/a\\u003e\"],\"Gym-101158J\":[\"Cover the Polygon with Your Disk\",68,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101158\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 ACM-ICPC, Asia Tsukuba Regional Contest\\u003c/a\\u003e\"],\"AtCoder-abc326_g\":[\"Unlock Achievement\",203,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc326\\\"\\u003ePanasonic Programming Contest 2023（AtCoder Beginner Contest 326）\\u003c/a\\u003e\"],\"CodeForces-1252B\":[\"Cleaning Robots\",608,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1252\\\"\\u003e2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"Gym-104790H\":[\"Hidden Art\",139,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104790\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023 Benelux Algorithm Programming Contest (BAPC 23)\\u003c/a\\u003e\"],\"CodeForces-868F\":[\"Yet Another Minimization Problem\",5433,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"Gym-104871G\":[\"Going to the Moon\",388,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104871\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023-2024 ICPC Central Europe Regional Contest (CERC 23)\\u003c/a\\u003e\"],\"Kattis-chineseremainder\":[\"Chinese Remainder\",959,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/KTH%20CSC%20Popup%202005\\\"\\u003eKTH CSC Popup 2005\\u003c/a\\u003e\"],\"QOJ-5540\":[\"City Hall\",137,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1109\\\"\\u003e2022-2023 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"CodeForces-95E\":[\"Lucky Country\",2159,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1938K\":[\"Tree Quiz\",733,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1938\\\"\\u003e2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"Gym-102920H\":[\"Needle\",869,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102920\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020-2021 ACM-ICPC, Asia Seoul Regional Contest\\u003c/a\\u003e\"],\"CodeForces-1902F\":[\"Trees and XOR Queries Again\",1411,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1902E\":[\"Collapsing Strings\",5558,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"Gym-102920L\":[\"Two Buildings\",637,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102920\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020-2021 ACM-ICPC, Asia Seoul Regional Contest\\u003c/a\\u003e\"],\"Kattis-dividedoughnut\":[\"Divide Doughnut\",133,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202018%20ICPC%20Asia%20Hanoi%20Regional%20Contest\\\"\\u003eThe 2018 ICPC Asia Hanoi Regional Contest\\u003c/a\\u003e\"],\"CodeForces-786B\":[\"Legacy\",9232,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"Kattis-insidersidentity\":[\"Insider\\u0027s Identity\",118,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202018%20ICPC%20Asia%20Hanoi%20Regional%20Contest\\\"\\u003eThe 2018 ICPC Asia Hanoi Regional Contest\\u003c/a\\u003e\"],\"Kattis-barcode\":[\"Barcode\",355,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202017%20ACM%20-%20ICPC%20Asia%20Ho%20Chi%20Minh%20City%20Regional%20Contest\\\"\\u003eThe 2017 ACM - ICPC Asia Ho Chi Minh City Regional Contest\\u003c/a\\u003e\"],\"Kattis-droppingball\":[\"Dropping Ball\",142,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202017%20ACM%20-%20ICPC%20Asia%20Ho%20Chi%20Minh%20City%20Regional%20Contest\\\"\\u003eThe 2017 ACM - ICPC Asia Ho Chi Minh City Regional Contest\\u003c/a\\u003e\"],\"CodeForces-1901E\":[\"Compressed Tree\",1940,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1901\\\"\\u003eEducational Codeforces Round 158 (Rated for Div. 2)\\u003c/a\\u003e\"],\"QOJ-4589\":[\"White-Black Tree\",75,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/989\\\"\\u003e2021-2022 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"Gym-104619F\":[\"Finding Bridges\",97,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104619\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023 ICPC Asia Taiwan Online Programming Contest\\u003c/a\\u003e\"],\"CodeForces-377A\":[\"Maze\",29509,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/377\\\"\\u003eCodeforces Round 222 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1383B\":[\"GameGame\",5433,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1383\\\"\\u003eCodeforces Round 659 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1101G\":[\"(Zero XOR Subset)-less\",2309,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1941G\":[\"Rudolf and Subway\",4881,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"Gym-101987K\":[\"TV Show Game\",900,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101987\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018-2019 ACM-ICPC, Asia Seoul Regional Contest\\u003c/a\\u003e\"],\"CodeForces-959F\":[\"Mahmoud and Ehab and yet another xor task\",2860,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/959\\\"\\u003eCodeforces Round 473 (Div. 2)\\u003c/a\\u003e\"],\"Gym-100548C\":[\"The Problem Needs 3D Arrays\",182,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100548\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014-2015 ACM-ICPC, Asia Xian Regional Contest\\u003c/a\\u003e\"],\"AtCoder-arc138_d\":[\"Differ by K bits\",438,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc138\\\"\\u003eDaiwa Securities Co. Ltd. Programming Contest 2022 Spring (AtCoder Regular Contest 138）\\u003c/a\\u003e\"],\"QOJ-4590\":[\"Happy Travelling\",52,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/989\\\"\\u003e2021-2022 ICPC Asia Pacific - Jakarta Regional\\u003c/a\\u003e\"],\"Gym-100548G\":[\"The Problem to Slow Down You\",350,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100548\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014-2015 ACM-ICPC, Asia Xian Regional Contest\\u003c/a\\u003e\"],\"CodeForces-1867F\":[\"Most Different Tree\",474,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1867\\\"\\u003eCodeforces Round 897 (Div. 2)\\u003c/a\\u003e\"],\"Gym-100513J\":[\"Getting Ready for VIPC\",35,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100513\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest\\u003c/a\\u003e\"],\"CodeForces-1900D\":[\"Small GCD\",5187,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1900\\\"\\u003eCodeforces Round 911 (Div. 2)\\u003c/a\\u003e\"],\"TLX-inc-2023-I\":[\"Critical Roads\",42,\"\\u003ca href\\u003d\\u0027https://tlx.toki.id/problems/inc-2023\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eINC 2023\\u003c/a\\u003e\"],\"TLX-inc-2023-F\":[\"Interesting Couple\",28,\"\\u003ca href\\u003d\\u0027https://tlx.toki.id/problems/inc-2023\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eINC 2023\\u003c/a\\u003e\"],\"洛谷-P3515\":[\"Lightning Conductor\",6353,\"POI 2011\"],\"TLX-inc-2023-G\":[\"Narrow Passageway\",32,\"\\u003ca href\\u003d\\u0027https://tlx.toki.id/problems/inc-2023\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eINC 2023\\u003c/a\\u003e\"],\"TLX-inc-2023-J\":[\"Counting Pairs\",94,\"\\u003ca href\\u003d\\u0027https://tlx.toki.id/problems/inc-2023\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eINC 2023\\u003c/a\\u003e\"],\"Gym-101177C\":[\"Crazy Rotations\",99,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101177\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 ACM-ICPC, South Pacific Regional Contest (SPPC 16)\\u003c/a\\u003e\"],\"CodeForces-1100F\":[\"Ivan and Burgers\",4035,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-arc069_d\":[\"Flags\",187,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc069\\\"\\u003eAtCoder Regular Contest 069\\u003c/a\\u003e\"],\"CSES-1703\":[\"Critical Cities\",460,\"Advanced Graph Problems\"],\"CodeForces-526F\":[\"Pudding Monsters\",3672,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"Kattis-gameofdivisibility\":[\"Game of Divisibility\",61,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/The%202017%20ACM%20-%20ICPC%20Asia%20Ho%20Chi%20Minh%20City%20Regional%20Contest\\\"\\u003eThe 2017 ACM - ICPC Asia Ho Chi Minh City Regional Contest\\u003c/a\\u003e\"],\"洛谷-P4696\":[\"Matching\",1314,\"CEOI 2011\"],\"QOJ-3172\":[\"Tomb Raider\",72,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/474\\\"\\u003e2019-2020 ICPC North America Championship\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/474?v\\u003d1\\\"\\u003eXX Open Cup named after E.V. Pankratiev, Grand Prix of North America\\u003c/a\\u003e\"],\"AtCoder-abc320_g\":[\"Slot Strategy 2 (Hard)\",139,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc320\\\"\\u003eToyota Programming Contest 2023#5（AtCoder Beginner Contest 320）\\u003c/a\\u003e\"],\"Gym-103860J\":[\"jwfw.harie.edu\",309,\"\\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\"],\"CodeForces-1907G\":[\"Lights\",2295,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"Kattis-generalchineseremainder\":[\"Chinese Remainder Theorem (non-relatively prime moduli)\",1024,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/KTH%20CSC%20Popup%202005\\\"\\u003eKTH CSC Popup 2005\\u003c/a\\u003e\"],\"Kattis-openpitmining\":[\"Open-Pit Mining\",346,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/Rocky%20Mountain%20Regional%20Contest%20%28RMRC%29%202017\\\"\\u003eRocky Mountain Regional Contest (RMRC) 2017\\u003c/a\\u003e\"],\"AtCoder-abc328_g\":[\"Cut and Reorder\",350,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc328\\\"\\u003eToyota Programming Contest 2023#7（AtCoder Beginner Contest 328）\\u003c/a\\u003e\"],\"CodeForces-1797D\":[\"Li Hua and Tree\",4509,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1797\\\"\\u003eCodeforces Round 864 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1797E\":[\"Li Hua and Array\",1614,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1797\\\"\\u003eCodeforces Round 864 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc328_f\":[\"Good Set Query\",1532,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc328\\\"\\u003eToyota Programming Contest 2023#7（AtCoder Beginner Contest 328）\\u003c/a\\u003e\"],\"CodeForces-1163E\":[\"Magical Permutation\",1016,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-755F\":[\"PolandBall and Gifts\",2017,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/755\\\"\\u003e8VC Venture Cup 2017 - Elimination Round\\u003c/a\\u003e\"],\"Gym-100502C\":[\"Catalan Square\",490,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100502\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014 Nordic Collegiate Programming Contest\\u003c/a\\u003e\"],\"QOJ-3163\":[\"Bomas\",49,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/474\\\"\\u003e2019-2020 ICPC North America Championship\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/474?v\\u003d1\\\"\\u003eXX Open Cup named after E.V. Pankratiev, Grand Prix of North America\\u003c/a\\u003e\"],\"UVA-1376\":[\"Animal Run\",338,null],\"Gym-102460B\":[\"The Power Monitor System\",170,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102460\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest\\u003c/a\\u003e\"],\"QOJ-3161\":[\"Another Coin Weighing Puzzle\",77,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/474\\\"\\u003e2019-2020 ICPC North America Championship\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/474?v\\u003d1\\\"\\u003eXX Open Cup named after E.V. Pankratiev, Grand Prix of North America\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"collectingGroups":[],"author":"__builtin_orz","updateTime":1775490432000,"title":"進階主題題單","dislikeCnt":0,"content":" \n### 網路流 匹配\n \n [problem:LibreOJ-6002] DAG 最小路徑覆蓋 裸題\n [problem:CodeChef-CHEFDAG] DAG 最小路徑覆蓋\n [problem:LibreOJ-6001] 最大權閉合子圖\n [problem:Kattis-openpitmining] 最大閉包\n [problem:Gym-100548C] 最大密度子圖\n [problem:Gym-101512A] 分層圖網路流\n [problem:UVA-1376] 平面圖最小割\u003d最大流\n [problem:Gym-104832H]\n [problem:CodeForces-1906I]\n[problem:AtCoder-abc320_g] 二分+最大匹配\n[problem:AtCoder-abc326_g]\n[problem:CodeForces-277E] MCMF\n[problem:Gym-102562I] 最大權閉合子圖(裸)\n\n----\n### DP\nsubset sum\n[problem:Gym-102219E] 回朔(字典序最小)\n\n組合dp\n[problem:CodeForces-1906H]\n[problem:CodeForces-1906J]\n[problem:AtCoder-arc169_c]\n\n樹dp\n[problem:Gym-102460B]\n[problem:CodeForces-1252B]\n[problem:CodeForces-1901E]\n[problem:CodeForces-1856E2] 樹上背包+動態開bitset\n[problem:AtCoder-arc142_d]\n\n位元dp\n[problem:AtCoder-abc328_g] 排列\n[problem:QOJ-5537] 放東西\n[problem:TLX-inc-2023-G] 放東西\n\n背包dp\n[problem:CodeForces-755F] 二進制分解+bitset優化\n[problem:CodeForces-95E] 二進制分解+bitset優化\n\n期望值\n[problem:Gym-104832E] 排列\n\n編輯距離\n[problem:CodeForces-56D] 輸出解\n\n矩陣快速冪優化\nhttps://codeforces.com/blog/entry/8544\n\n斜率優化\n[problem:QOJ-5540]\n\n四邊形不等式\n[DP的决策单调性优化总结\n](https://www.luogu.com.cn/blog/command-block/dp-di-jue-ce-dan-diao-xing-you-hua-zong-jie)\n[problem:洛谷-P4072]\n[problem:洛谷-P5574]\n[problem:洛谷-P3515]\n[problem:洛谷-P1912] 決策單調性分治\n[problem:Kattis-famouspagoda] 決策單調性分治\n[problem:CodeForces-833B] 決策單調性分治\n[problem:CodeForces-868F] 決策單調性分治 + 移動區間\n[problem:Gym-104021C]\n \n----\n### 數論\n排容 反演\n[problem:CodeForces-1900D] 可歐拉反演\n[problem:Gym-104021D]\n[problem:QOJ-3161]\n\n組合數\n[problem:Kattis-barcode]\n\n枚舉\n[problem:Gym-104790H]\n[problem:Gym-104021F]\n[problem:CodeForces-1822G2]\n\n中國餘式定理(CRT)\n[problem:Kattis-chineseremainder]\n[problem:Kattis-generalchineseremainder]\n\n----\n### Tree\n樹上資結\n[problem:CodeForces-1797D] set+換根\n[problem:CodeForces-1797E]\n[problem:QOJ-1954]\n[problem:Gym-104619F]\n[problem:QOJ-5548]\n[problem:QOJ-4580]\n[problem:CodeForces-1902F]\n[problem:CodeForces-1904E] 離線+線段樹+換根\n\nTree Isomorphism\n[problem:CodeForces-1867F]\n[problem:CodeForces-1800G]\n\n----\n### 貪心\n[problem:Gym-104832J]\n\n----\n### 構造\n[problem:QOJ-5545]\n[problem:Kattis-jurassicjungle]\n[problem:CodeForces-1906M]\n[problem:CodeForces-1906L]\n[problem:CodeForces-1906B] ?\n\n----\n### 分治\n[problem:Gym-102920L]\n[problem:CodeForces-1849E]\n[problem:CodeForces-526F]\n\n----\n### String Algorithm\nKMP\n[problem:QOJ-1964] 離散化匹配\n[problem:洛谷-P4696] 離散化匹配\n[problem:Gym-102465K] KMP+DP\n[problem:LightOJ-1268] KMP+DP+矩陣快速冪優化\nTrie\n[problem:CodeForces-1902E]\nAC自動機\n[problem:Kattis-insidersidentity] 自動機上dp\nPalindrome Tree\n[problem:Gym-100548G]\n\n----\n### XOR\n組合 計數\n[problem:Gym-104021E]\n[problem:QOJ-4579]\n\n線性基\n[problem:CodeForces-845G]\n[problem:CodeForces-959F]\n[problem:CodeForces-1101G]\n[problem:CodeForces-1100F]\n[problem:CodeForces-1902F]\n[problem:CodeForces-1163E] 格雷碼構造\n[problem:AtCoder-arc138_d] 格雷碼構造\n\n----\n### Game\n[problem:QOJ-5544]\n[problem:QOJ-4589]\n[problem:QOJ-6569]\n[problem:CodeForces-1383B] 後手模仿先手\n[problem:Kattis-gameofdivisibility] 後手模仿先手\n[problem:Kattis-bipartitebattle] 手爆sg\n\n----\n### 互動題\n[problem:Kattis-dividedoughnut] 勘根定理\n[problem:Gym-104790K] 十字搜 or 隨機化\n\n--- \n### 掃描線\n[problem:QOJ-3163]\n\n----\n### Treap\n[problem:Kattis-droppingball]\n\n----\n### Binary Search on DS\n[problem:CodeForces-1938K]\n\n----\n### 折半枚舉\n[problem:Gym-103860J]\n[problem:AtCoder-abc326_f]\n\n---\n### 根號分治 分塊\n[problem:QOJ-4590]\n[problem:Kattis-krotating]\n\n----\n### 2-SAT\n[problem:Gym-101987K]\n[problem:CodeForces-1903F] 二分+線段樹優化建圖\n[problem:AtCoder-arc069_d] 二分+線段樹優化建圖\n\n---\n### 優化建圖\n[problem:CodeForces-1904F]\n[problem:CodeForces-1903F]\n[problem:CodeForces-786B]\n[problem:洛谷-P5344]\n[problem:洛谷-P9520]\n\n---\n### 二分圖\n[problem:QOJ-1957] dsu+背包\n[problem:QOJ-3172] dsu\n\n----\n### Sparse Table\n[problem:QOJ-4583]\n\n----\n### Functional Graphs\n[problem:CodeForces-1907G] 水母圖貪心\n[problem:CodeForces-1876C] 水母圖貪心\n\n----\n### FWT SOSDP\n[problem:CodeForces-1906K]\n[problem:TLX-inc-2023-J]\n[problem:CodeForces-1903D2]\n\n----\n### FFT\n[problem:Gym-102920H]\n[problem:Gym-101177C]\n\n----\n### 偏序\n[problem:QOJ-5543]\n\n----\n### 帶權並查集\n[problem:AtCoder-abc328_f]\n\n----\n### 最短路\n[problem:Gym-104021H]\n[problem:AtCoder-abc302_f]\n[problem:CodeForces-1941G]\n[problem:Gym-104670D]\n[problem:Gym-102700F] Floyd Warshall\n\n----\n### 懸線法\n[problem:Gym-104021K]\n\n----\n### 支配樹\n[problem:CSES-1703] 裸題\n[problem:TLX-inc-2023-I] 支配邊\n[problem:Gym-100513J]\n\n----\n### 曼哈頓最小生成樹\n[problem:TLX-inc-2023-F]\n\n### 生成樹\n[problem:CodeForces-377A]\n\n### Euler Path/Cycle\n[problem:CodeForces-508D]\n\n### floyd判環\n[problem:Gym-101252D]\n\n### 幾何\n基礎幾何\n[problem:CodeForces-1036E] 皮克\u0026點相交\n線相交位置\n[problem:Kattis-segmentintersection]\n線段距離\n[problem:Gym-104670J]\n[problem:Gym-102700A]\n點與圓距離\n[problem:Gym-104871G]\n圓和多邊形最大面積\n[problem:Gym-101158J]\n掃描線\n[problem:Gym-100486G] 線段交數量(https://contest.felk.cvut.cz/11prg/solved.html)\n旋轉卡尺\n[problem:Gym-101635K]\n切點\n[problem:Gym-104670G]\n\n### 大數\n[problem:Gym-100502C]","threadId":177724,"likeCnt":0,"createTime":1701882266000,"isWorkbook":true,"viewCnt":2629,"openness":2,"fav":false,"id":4353,"trustable":false}
