Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-1787\":[\"GCD Again\",2381,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A810%A3%A9_%D2%D4%B4%CB%B8%D0%D0%BBDOOMIII\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(10)_以此感谢DOOMIII \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3549\":[\"Flow Problem\",6549,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHyperHexagon%26%23039%3Bs+Summer+Gift+%28Original+tasks%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HyperHexagon\\u0027s Summer Gift (Original tasks) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2732\":[\"Leapin\\u0027 Lizards\",1394,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+2005\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 2005 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4638\":[\"Group\",1419,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1328E\":[\"Tree Queries\",9456,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1328\\\"\\u003eCodeforces Round 629 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1304E\":[\"1-Trees and Queries\",5049,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"Gym-102770E\":[\"Easy DP Problem\",625,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102770\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 17th Zhejiang Provincial Collegiate Programming Contest\\u003c/a\\u003e\"],\"HDU-5763\":[\"Another Meaning\",940,\"\\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+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1286\":[\"找新朋友\",7346,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3501\":[\"Calculation 2\",2148,\"\\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%A87%A3%A9%A1%AA%A1%AAHost+by+HIT+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(7)——Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4777\":[\"Rabbit Kingdom\",744,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Hangzhou+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Hangzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5469\":[\"Antonidas\",447,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+ACM%2FICPC+Asia+Regional+Shanghai+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 ACM/ICPC Asia Regional Shanghai Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1324F\":[\"Maximum White Subtree\",9365,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-766E\":[\"Mahmoud and a xor trip\",3022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"HDU-4902\":[\"Nice boat\",882,\"\\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+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1990\":[\"MooFest\",4244,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+U+S+Open\\\"\\u003eUSACO 2004 U S Open\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10692\":[\"Huge Mods\",745,null],\"CodeForces-1408D\":[\"Searchlights\",4245,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"CodeForces-1418D\":[\"Trash Problem\",4241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"POJ-2720\":[\"Last Digits\",317,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRocky+Mountain+2005\\\"\\u003eRocky Mountain 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1370\":[\"Bi-shoe and Phi-shoe\",4673,null],\"HDU-4288\":[\"Coder\",1549,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-6225\":[\"Little Boxes\",3160,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017ACM%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 2017ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4289\":[\"Control\",1670,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3572\":[\"Task Schedule\",2109,\"\\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\"],\"UVA-10515\":[\"Powers Et Al.\",3533,null],\"HDU-3874\":[\"Necklace\",1363,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+4+-+Host+by+SDU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 4 - Host by SDU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3973\":[\"AC\\u0027s String\",397,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+14+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 14 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-6228\":[\"Tree\",1794,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017ACM%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 2017ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1422D\":[\"Returning Home\",2680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1422\\\"\\u003eCodeforces Round 675 (Div. 2)\\u003c/a\\u003e\"],\"HDU-1532\":[\"Drainage Ditches\",6535,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUSACO+93\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e USACO 93 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2588\":[\"GCD\",2391,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2009+Spring+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2009 Spring Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-906D\":[\"Power Tower\",2335,\"\\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-1311E\":[\"Construct the Binary Tree\",2233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"HDU-6241\":[\"Color a Tree\",324,\"\\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-%B9%FE%B6%FB%B1%F5%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B9%FE%C0%ED%B9%A4%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017中国大学生程序设计竞赛-哈尔滨站-重现赛(感谢哈理工) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-474E\":[\"Pillars\",3446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/474\\\"\\u003eCodeforces Round 271 (Div. 2)\\u003c/a\\u003e\"],\"Gym-102501G\":[\"Swapping Places\",386,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102501\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2019-2020 ICPC Southwestern European Regional Programming Contest (SWERC 2019-20)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"Water_Liu","updateTime":1603684194000,"title":"题单","dislikeCnt":0,"content":"#### 树上问题\n[problem:HDU-6228][Tree] 树的重心\n[problem:HDU-6241][Color a Tree] 树上dp+二分答案\n[problem:HDU-5469][Antonidas] 点分治+hash\n[problem:CodeForces-1304E][1-Trees and Queries] LCA\n[problem:CodeForces-1311E][Construct the Binary Tree] 构造;列出上下界\n[problem:CodeForces-1328E][Tree Queries] LCA\n[problem:CodeForces-1324F][Maximum White Subtree] 换根dp\n\n#### 数据结构\n[problem:HDU-3874][Necklace] 线段树+离线处理\n[problem:HDU-4288][Coder] 线段树+离线处理;按模设计状态\n[problem:HDU-4638][Group] 树状数组+离线处理;有种链表的感觉\n[problem:HDU-4777][Rabbit Kingdom] 树状数组+离线处理+质因数分解;非常有意思的模板题\n[problem:HDU-4902][Nice boat] 线段树;维护区间所有元素是否全等;\n[problem:Gym-102501G][Swapping Places] 树状数组+贪心\n[problem:POJ-1990][MooFest]树状数组+离线处理\n\n#### 字符串\n[problem:HDU-3973][AC\u0027s String] hash+线段树\n[problem:HDU-5763][Another Meaning] hash+dp\n\n\n\n#### 数论\n[problem:HDU-1286][找新朋友] 欧拉函数;线性筛\n[problem:HDU-1787][GCD Again] 欧拉函数;单点\n[problem:HDU-3501][Calculation 2] 欧拉函数;gcd的对称性\n[problem:HDU-2588][GCD] 欧拉函数;gcd推式子\n[problem:LightOJ-1370][Bi-shoe and Phi-shoe] 欧拉函数+线段树\n[problem:UVA-10692][Huge Mods] 扩展欧拉定理\n[problem:UVA-10515][Powers Et Al.] 扩展欧拉定理;\nm^n%10 \u003d(m%10)^(n%\\phi(10)+[n\u003e\u003d\\phi(10)]*\\phi(10)) \n[problem:POJ-2720][Last Digits] 扩展欧拉定理;卡时间\n[problem:CodeForces-906D][Power Tower] 扩展欧拉定理\n\n#### 图论\n[problem:CodeForces-1422D][Returning Home] 最短路-堆优化dij;拆点建图\n\n#### 其他\n[problem:HDU-6225][Little Boxes] 大数\n[problem:CodeForces-1418D][Trash Problem] STL:multiset\n\n\n-----\n\n\n#### 待分类\n[problem:CodeForces-766E][Mahmoud and a xor trip] 树上dp;按位分治,拆开之后就和下题一样了[【牛客-14248】](http://ac.nowcoder.com/acm/problem/14248)\n[problem:CodeForces-474E][Pillars] 线段树+离散化处理\n[problem:HDU-3549][Flow Problem] EK模板 O(nm^2)\n[problem:HDU-1532][Drainage Ditches] EK模板\n[problem:HDU-3572][Task Schedule] dinic;建模trick:将可分配的物品看做流,约束条件看做是流量限制\n[problem:HDU-4289][Control] 最小割转最大流,拆点;若点有是否选择两种状态的,将点拆成选与不选两种状态,并从“不选”向“选”连一条边,容量为选择代价\n[problem:HDU-2732][Leapin\u0027 Lizards] 最大流,拆点\n[problem:Gym-102770E][Easy DP Problem] 划分树\n[problem:CodeForces-1408D][Searchlights] Pecco\n","threadId":82120,"likeCnt":1,"createTime":1600957982000,"isWorkbook":true,"viewCnt":2005,"openness":2,"fav":false,"id":2474,"trustable":false}