{"workbook":{"problemsBrief":"{\"CodeForces-1336A\":[\"Linova and Kingdom\",23855,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1336\\\"\\u003eCodeforces Round 635 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-2033G\":[\"Sakurako and Chefir\",2182,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/2033\\\"\\u003eCodeforces Round 981 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1336C\":[\"Kaavi and Magic Spell\",4408,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1336\\\"\\u003eCodeforces Round 635 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1849D\":[\"Array Painting\",10607,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\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\"],\"CodeForces-1255C\":[\"League of Leesins\",7517,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1255\\\"\\u003eCodeforces Round 601 (Div. 2)\\u003c/a\\u003e\"],\"Yukicoder-2206\":[\"Popcount Sum 2\",134,null],\"洛谷-P5839\":[\"Moortal Cowmbat G\",1341,\"USACO19DEC\"],\"CodeForces-1324E\":[\"Sleeping Schedule\",18141,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"HDU-7488\":[\"猫咪们狂欢\",271,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2024%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%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%A85%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2024“钉耙编程”中国大学生算法设计超级联赛（5） \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-6315\":[\"Naive Operations\",1982,\"\\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+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2018 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"Gym-105484B\":[\"Birthday Gift\",1517,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/105484\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2024 ICPC Asia Nanjing Regional Contest (The 3rd Universal Cup. Stage 16: Nanjing)\\u003c/a\\u003e\"],\"CodeForces-702F\":[\"T-Shirts\",2299,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/702\\\"\\u003eEducational Codeforces Round 15\\u003c/a\\u003e\"],\"CodeForces-875C\":[\"National Property\",2450,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-645F\":[\"Cowslip Collections\",1045,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"洛谷-P6651\":[\"Chain\",590,\"SWTR-5\"],\"洛谷-P10156\":[\"胜者组\",631,\"LSOT-2\"],\"CodeForces-1202E\":[\"You Are Given Some Strings...\",2911,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1202\\\"\\u003eEducational Codeforces Round 70 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P11907\":[\"F. 恐怖的黑色魔物\",219,\"NHSPC 2023\"],\"CodeForces-1795D\":[\"Triangle Coloring\",13536,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1795\\\"\\u003eEducational Codeforces Round 143 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1242C\":[\"Sum Balance\",2083,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1242\\\"\\u003eCodeforces Round 599 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-818G\":[\"Four Melodies\",1078,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"洛谷-P9650\":[\"Escape Plan\",677,\"SNCPC2019\"],\"CodeForces-559E\":[\"Gerald and Path\",1343,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/559\\\"\\u003eCodeforces Round 313 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-898F\":[\"Restoring the Expression\",1817,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1690G\":[\"Count the Trains\",4356,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1690\\\"\\u003eCodeforces Round 797 (Div. 3)\\u003c/a\\u003e\"],\"CodeChef-SEQGOODNESS\":[\"Sum of Goodness\",1768,\"prince_patel_8\"],\"Gym-104857J\":[\"Takeout Delivering\",1590,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104857\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)\\u003c/a\\u003e\"],\"CodeForces-1479D\":[\"Odd Mineral Resource\",1453,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1479\\\"\\u003eCodeforces Round 700 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1237D\":[\"Balanced Playlist\",5170,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"洛谷-P7118\":[\"Galgame\",920,null],\"CodeForces-1213F\":[\"Unstable String Sort\",3150,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"Gym-105139D\":[\"MACARON Likes Happy Endings\",100,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/105139\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2024 International Collegiate Programming Contest in Hubei Province, China\\u003c/a\\u003e\"],\"CodeForces-1237F\":[\"Balanced Domino Placements\",1196,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-1794E\":[\"Labeling the Tree with Distances\",1609,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1794\\\"\\u003eCodeforces Round 856 (Div. 2)\\u003c/a\\u003e\"],\"HDU-6299\":[\"Balanced Sequence\",1627,\"\\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+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2018 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1310C\":[\"Au Pont Rouge\",829,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1310\\\"\\u003eVK Cup 2019-2020 - Elimination Round (Engine)\\u003c/a\\u003e\"],\"CodeChef-MINORPATH\":[\"Minimum OR Path\",819,\"harasees_singh\"],\"CodeForces-914E\":[\"Palindromes in a Tree\",2073,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1929F\":[\"Sasha and the Wedding Binary Search Tree\",2379,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1929\\\"\\u003eCodeforces Round 926 (Div. 2)\\u003c/a\\u003e\"],\"QOJ-9479\":[\"And DNA\",468,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1812\\\"\\u003eThe 3rd Universal Cup. Stage 13: Sendai\\u003c/a\\u003e\"],\"洛谷-P8578\":[\"So What Do We Do Now?\",1489,\"CoE R5\"],\"洛谷-P9306\":[\"进行一个排的重 (Minimum Version)\",610,\"DTOI-5\"],\"CodeForces-873F\":[\"Forbidden Indices\",1955,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-1077F2\":[\"Pictures with Kittens (hard version)\",4681,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-2124E\":[\"Make it Zero\",3971,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/2124\\\"\\u003eEPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-780F\":[\"Axel and Marston in Bitland\",1387,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/780\\\"\\u003eТехнокубок 2017 - Финал (только для онсайт-финалистов)\\u003c/a\\u003e\"],\"CodeForces-1208D\":[\"Restore Permutation\",5987,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1208\\\"\\u003eManthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1874C\":[\"Jellyfish and EVA\",2318,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1874\\\"\\u003eCodeforces Round 901 (Div. 1)\\u003c/a\\u003e\"],\"CodeChef-LECOINS\":[\"Little Elephant and Colored Coins\",168,\"witaliy_adm\"],\"HDU-7436\":[\"传送\",373,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2024%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%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 2024“钉耙编程”中国大学生算法设计超级联赛（1） \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1696E\":[\"Placing Jinas\",5345,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1696\\\"\\u003eCodeforces Global Round 21\\u003c/a\\u003e\"],\"QOJ-10335\":[\"Twin Contests\",251,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1965\\\"\\u003eThe 3rd Universal Cup. Stage 34: Aobayama\\u003c/a\\u003e\"],\"CodeForces-1679D\":[\"Toss a Coin to Your Graph...\",6005,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1679\\\"\\u003eCodeforces Round 791 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-176B\":[\"Word Cut\",2664,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/176\\\"\\u003eCroc Champ 2012 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1207D\":[\"Number Of Permutations\",7155,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1207\\\"\\u003eEducational Codeforces Round 71 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4824\":[\"Censoring S\",13383,\"USACO15FEB\"],\"QOJ-6656\":[\"先人类的人类选别\",169,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1260\\\"\\u003e2023 清华大学学生程序设计竞赛暨高校邀请赛（THUPC 2023）决赛\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1260?v\\u003d1\\\"\\u003ePetrozavodsk Winter 2025. Day 6. THird febrUary contest\\u003c/a\\u003e\"],\"CodeForces-459D\":[\"Pashmak and Parmida\\u0027s problem\",13529,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4949\":[\"最短距离\",1290,null],\"QOJ-11110\":[\"Witnessing the Miracle\",499,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/2036\\\"\\u003eThe 3rd Universal Cup. Stage 38: Guangzhou\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/2036?v\\u003d1\\\"\\u003e第十届中国大学生程序设计竞赛总决赛（CCPC Final 2024）\\u003c/a\\u003e\"],\"HDU-7284\":[\"Easy problem I\",424,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%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 2023“钉耙编程”中国大学生算法设计超级联赛（1） \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1709E\":[\"XOR Tree\",4143,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-2000G\":[\"Call During the Journey\",3177,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/2000\\\"\\u003eCodeforces Round 966 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1436C\":[\"Binary Search\",12231,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1436\\\"\\u003eCodeforces Round 678 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P7706\":[\"文文的摄影布置\",2637,\"Wdsr-2.7\"],\"CodeForces-2000F\":[\"Color Rows and Columns\",7297,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/2000\\\"\\u003eCodeforces Round 966 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1557D\":[\"Ezzat and Grid\",3206,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1557\\\"\\u003eCodeforces Round 737 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3863\":[\"序列\",2180,null],\"CodeForces-2000H\":[\"Ksyusha and the Loaded Set\",2479,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/2000\\\"\\u003eCodeforces Round 966 (Div. 3)\\u003c/a\\u003e\"],\"QOJ-9879\":[\"ReTravel\",583,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1872\\\"\\u003eThe 3rd Universal Cup. Stage 21: Ōokayama\\u003c/a\\u003e\"],\"CodeForces-1149C\":[\"Tree Generator™\",1806,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1149\\\"\\u003eCodeforces Round 556 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1913D\":[\"Array Collapse\",4396,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1913\\\"\\u003eEducational Codeforces Round 160 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1638E\":[\"Colorful Operations\",2576,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1638\\\"\\u003eCodeforces Round 771 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2934\":[\"Safe Travel G\",1823,\"USACO09JAN\"],\"洛谷-P6617\":[\"查找 Search\",1703,null],\"洛谷-P2416\":[\"泡芙\",828,null],\"CodeForces-1016F\":[\"Road Projects\",1096,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1016\\\"\\u003eEducational Codeforces Round 48 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-325C\":[\"Monsters and Diamonds\",493,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/325\\\"\\u003eMemSQL start[c]up Round 1\\u003c/a\\u003e\"],\"CodeForces-1153E\":[\"Serval and Snake\",1890,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1666F\":[\"Fancy Stack\",1608,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1666\\\"\\u003e2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1763C\":[\"Another Array Problem\",8035,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1763\\\"\\u003eCodeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT\\u003c/a\\u003e\"],\"CodeForces-1096D\":[\"Easy Problem\",10574,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P6062\":[\"Muddy Fields G\",2972,\"USACO05JAN\"],\"CodeForces-571A\":[\"Lengthening Sticks\",3034,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/571\\\"\\u003eCodeforces Round 317 [AimFund Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P6583\":[\"回首过去\",1809,null],\"洛谷-P2541\":[\"Robotic Cow Herd P\",662,\"USACO16DEC\"],\"洛谷-P5536\":[\"核心城市\",7419,\"XR-3\"],\"AtCoder-abc335_g\":[\"Discrete Logarithm Problems\",126,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc335\\\"\\u003eAtCoder Beginner Contest 335 (Sponsored by Mynavi)\\u003c/a\\u003e\"],\"洛谷-P1852\":[\"跳跳棋\",3383,null],\"CodeForces-1601D\":[\"Difficult Mountain\",2151,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1601\\\"\\u003eCodeforces Round 751 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1924D\":[\"Balanced Subsequences\",1707,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1924\\\"\\u003eCodeforces Round 921 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1924B\":[\"Space Harbour\",3427,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1924\\\"\\u003eCodeforces Round 921 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1499D\":[\"The Number of Pairs\",7174,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UniversalOJ-637\":[\"A. 数据结构\",754,\"美团杯2021\"],\"CodeForces-947A\":[\"Primal Sport\",189,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/947\\\"\\u003eCodeforces Round 470 (rated, Div. 1, based on VK Cup 2018 Round 1)\\u003c/a\\u003e\"],\"CodeForces-1227F2\":[\"Wrong Answer on test 233 (Hard Version)\",2131,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"洛谷-P8131\":[\"Gene Folding\",523,\"ICPC 2020 WF\"],\"CodeForces-526F\":[\"Pudding Monsters\",3672,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"CodeForces-1790F\":[\"Timofey and Black-White Tree\",4051,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1790\\\"\\u003eCodeforces Round 847 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P2150\":[\"寿司晚宴\",6019,\"NOI2015\"],\"洛谷-P4696\":[\"Matching\",1314,\"CEOI 2011\"],\"洛谷-P5268\":[\"一个简单的询问\",4989,\"SNOI2017\"],\"洛谷-P12952\":[\"Intruder Outsmarting\",307,\"GCJ Farewell Round #2\"],\"CodeForces-1458B\":[\"Glass Half Spilled\",4176,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1458\\\"\\u003eCodeforces Round 691 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1515G\":[\"Phoenix and Odometers\",1428,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1515\\\"\\u003eCodeforces Global Round 14\\u003c/a\\u003e\"],\"洛谷-P12021\":[\"面包题\",466,null],\"Gym-104128B\":[\"Ropeway\",494,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104128\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Nanjing Regional Contest\\u003c/a\\u003e\"],\"CodeForces-311B\":[\"Cats Transport\",4578,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1244D\":[\"Paint the Tree\",8572,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-331C3\":[\"The Great Julya Calendar\",727,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-1721E\":[\"Prefix Function Queries\",2871,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1474C\":[\"Array Destruction\",14308,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1474\\\"\\u003eCodeforces Round 696 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1842F\":[\"Tenzing and Tree\",1843,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"QOJ-12150\":[\"AGI\",520,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/2135\\\"\\u003eThe 3rd Universal Cup. Stage 40: Potyczki\\u003c/a\\u003e\"],\"CodeForces-771D\":[\"Bear and Company\",1766,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"],\"Gym-102012G\":[\"Rikka with Intersections of Paths\",555,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102012\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018-2019 ACM-ICPC, Asia Xuzhou Regional Contest\\u003c/a\\u003e\"],\"CodeForces-771C\":[\"Bear and Tree Jumps\",3675,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"],\"洛谷-P4064\":[\"加法\",2631,\"JXOI2017\"],\"洛谷-P4587\":[\"神秘数\",4944,\"FJOI2016\"]}","joined":false,"groups":{}},"managingGroups":{},"collectingGroups":[[30411,"linSwGp","LinSwan\u0027sGroup","https://cn.cravatar.com/avatar/b2770da43a403dbd2e7a187d6d6dcf4c?d\u003dwavatar",true],[30475,"hutu","小胡图","https://cn.cravatar.com/avatar/71d37a6f9cf7390d64c72572970a03ca?d\u003drobohash",false]],"author":"wfbczx","updateTime":1759058773000,"title":"BCOI信息学专题训练（初二学生用）","dislikeCnt":0,"content":"#### 专题1 贪心构造交互思维\n[problem:CodeChef-MINORPATH] A - Minimum OR Path\n[problem:CodeForces-1763C] B - Another Array Problem\n[problem:CodeForces-2124E] C - Make it Zero\n[problem:QOJ-12150] D - AGI\n[problem:Gym-105484B] E - Birthday Gift\n[problem:CodeForces-1153E] F - Serval and Snake\n[problem:洛谷-P4064] G - 加法\n[problem:HDU-6299] H - Balanced Sequence\n[problem:洛谷-P2541] I - Robotic Cow Herd P\n[problem:洛谷-P1852] J - 跳跳棋\n\n#### 专题2 数据结构(1)\n[problem:CodeForces-1474C] A - Array Destruction\n[problem:CodeForces-1237D] B - Balanced Playlist\n[problem:CodeForces-1924B] C - Space Harbour\n[problem:HDU-6315] D - Naive Operations\n[problem:洛谷-P4587] E - 神秘数\n[problem:洛谷-P5268] F - 一个简单的询问\n\n#### 专题3 数据结构(2)\n[problem:CodeForces-1208D] A - Restore Permutation\n[problem:CodeForces-1690G] B - Count the Trains\n[problem:CodeForces-1913D] C - Array Collapse\n[problem:CodeForces-2000H] D - Ksyusha and the Loaded Set\n[problem:洛谷-P7706] E - 文文的摄影布置\n[problem:CodeForces-1638E] F - Colorful Operations\n[problem:洛谷-P6617] G - 查找 Search\n[problem:HDU-7436] H - 传送\n[problem:CodeForces-702F] I - T-Shirts\n[problem:QOJ-6656] J - 先人类的人类选别\n\n#### 专题4 数据结构(3)\n[problem:CodeForces-459D] A - Pashmak and Parmida\u0027s problem\n[problem:CodeForces-1849E] B - Max to the Right of Min\n[problem:HDU-7284] C - Easy problem I\n[problem:洛谷-P3863] D - 序列\n[problem:UniversalOJ-637] E - A. 数据结构\n[problem:CodeForces-526F] F - Pudding Monsters\n#### 专题5 字符串\n[problem:CodeForces-176B] A - Word Cut\n[problem:洛谷-P4824] B - Censoring S\n[problem:CodeForces-1721E] C - Prefix Function Queries\n[problem:CodeForces-898F] D - Restoring the Expression\n[problem:洛谷-P8131] E - Gene Folding\n[problem:洛谷-P4696] F - Matching\n[problem:CodeForces-1310C] G - Au Pont Rouge\n[problem:CodeForces-873F] H - Forbidden Indices\n[problem:CodeForces-1202E] I - You Are Given Some Strings...\n\n#### 专题6 dp(1)\n\n[problem:CodeForces-1849D] A - Array Painting\n[problem:CodeForces-1458B] B - Glass Half Spilled\n[problem:CodeForces-1077F2] C - Pictures with Kittens (hard version)\n[problem:CodeForces-1874C] D - Jellyfish and EVA\n[problem:QOJ-11110] E - Witnessing the Miracle / 见证奇迹\n\n#### 专题7 dp(2)\n[problem:CodeForces-1324E] A - Sleeping Schedule\n[problem:CodeForces-2000F] B - Color Rows and Columns\n[problem:CodeForces-1557D] C - Ezzat and Grid\n[problem:CodeForces-780F] D - Axel and Marston in Bitland\n[problem:QOJ-9879] E - ReTravel\n[problem:CodeForces-771D] F - Bear and Company\n[problem:CodeForces-331C3] G - The Great Julya Calendar\n[problem:CodeForces-1601D] H - Difficult Mountain\n[problem:Gym-105139D] I - MACARON Likes Happy Endings\n[problem:CodeForces-311B] J - Cats Transport\n\n#### 专题8 dp (3)\n[problem:CodeForces-1096D] A - Easy Problem\n[problem:洛谷-P10156] B - 胜者组\n[problem:CodeForces-1336C] C - Kaavi and Magic Spell\n[problem:Gym-104128B] D - Ropeway\n[problem:CodeForces-1242C] E - Sum Balance\n[problem:CodeForces-559E] F - Gerald and Path\n\n#### 专题9 组合数学（1）\n[problem:CodeForces-1436C] A - Binary Search\n[problem:洛谷-P9306] B - 进行一个排的重 (Minimum Version)\n[problem:CodeForces-1696E] C - Placing Jinas\n[problem:CodeForces-571A] D - Lengthening Sticks\n[problem:CodeForces-1929F] E - Sasha and the Wedding Binary Search Tree\n[problem:CodeForces-1227F2] F - Wrong Answer on test 233 (Hard Version)\n[problem:洛谷-P7118] G - Galgame\n[problem:CodeForces-1237F] H - Balanced Domino Placements\n[problem:QOJ-10335] I - Twin Contests\n[problem:QOJ-9479] J - And DNA\n#### 专题10 组合数学 （2）\n[problem:CodeForces-1795D] A - Triangle Coloring\n[problem:CodeForces-1207D] B - Number Of Permutations\n[problem:CodeChef-SEQGOODNESS] C - Sum of Goodness\n[problem:CodeForces-1666F] D - Fancy Stack\n[problem:Yukicoder-2206] E - Popcount Sum 2\n[problem:CodeForces-1924D] F - Balanced Subsequences\n#### 专题11 图论（1）\n[problem:CodeForces-1255C] A - League of Leesins\n[problem:洛谷-P9650] B - Escape Plan\n[problem:洛谷-P5839] C - Moortal Cowmbat G\n[problem:Gym-104857J] D - Takeout Delivering\n[problem:洛谷-P2934] E - Safe Travel G\n[problem:洛谷-P6651] F - Chain\n[problem:CodeForces-875C] G - National Property\n[problem:洛谷-P6062] H - Muddy Fields G\n[problem:HDU-7488] I - 猫咪们狂欢\n[problem:CodeForces-818G] J - Four Melodies\n#### 专题12 图论（2）\n[problem:CodeForces-1679D] A - Toss a Coin to Your Graph...\n[problem:CodeForces-1213F] B - Unstable String Sort\n[problem:CodeForces-2000G] C - Call During the Journey\n[problem:洛谷-P2416] D - 泡芙\n[problem:洛谷-P11907] E - F. 恐怖的黑色魔物\n[problem:CodeForces-325C] F - Monsters and Diamonds\n#### 专题13 树上问题（1）\n[problem:CodeForces-1336A] A - Linova and Kingdom\n[problem:洛谷-P5536] B - 核心城市\n[problem:CodeForces-771C] C - Bear and Tree Jumps\n[problem:CodeForces-2033G] D - Sakurako and Chefir\n[problem:洛谷-P4949] E - 最短距离\n[problem:CodeForces-1709E] F - XOR Tree\n[problem:CodeForces-1794E] G - Labeling the Tree with Distances\n[problem:CodeForces-914E] H - Palindromes in a Tree\n[problem:CodeForces-1016F] I - Road Projects\n[problem:CodeForces-1479D] J - Odd Mineral Resource\n#### 专题14 树上问题（2）\n[problem:洛谷-P8578] A - So What Do We Do Now?\n[problem:CodeForces-1244D] B - Paint the Tree\n[problem:CodeForces-1790F] C - Timofey and Black-White Tree\n[problem:Gym-102012G] D - Rikka with Intersections of Paths\n[problem:CodeForces-1842F] E - Tenzing and Tree\n[problem:CodeForces-1149C] F - Tree Generator™\n#### 专题15 数论\n[problem:CodeForces-947A] A - Primal Sport\n[problem:CodeForces-1499D] B - The Number of Pairs\n[problem:洛谷-P12021] C - 面包题\n[problem:洛谷-P12952] D - Intruder Outsmarting\n[problem:洛谷-P6583] E - 回首过去\n[problem:CodeChef-LECOINS] F - Little Elephant and Colored Coins\n[problem:洛谷-P2150] G - 寿司晚宴\n[problem:AtCoder-abc335_g] H - Discrete Logarithm Problems\n[problem:CodeForces-645F] I - Cowslip Collections\n[problem:CodeForces-1515G] J - Phoenix and Odometers\n\n","threadId":273366,"likeCnt":2,"createTime":1754700660000,"isWorkbook":true,"viewCnt":933,"openness":2,"fav":false,"id":10441,"trustable":false}
