Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P3378\":[\"堆\",59502,\"模板\"],\"洛谷-P4768\":[\"归程\",6828,\"NOI2018\"],\"CodeForces-1245D\":[\"Shichikuji and Power Grid\",7432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3958\":[\"奶酪\",34795,\"NOIP2017 提高组\"],\"AtCoder-abc127_f\":[\"Absolute Minima\",364,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc127\\\"\\u003eAtCoder Beginner Contest 127\\u003c/a\\u003e\"],\"CodeForces-1213G\":[\"Path Queries\",7064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P6192\":[\"最小斯坦纳树\",3186,\"模板\"],\"AtCoder-abc217_h\":[\"Snuketoon\",73,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc217\\\"\\u003eAtCoder Beginner Contest 217\\u003c/a\\u003e\"],\"HDU-1280\":[\"前m大的数\",7375,\"\\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%A8VI%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VI) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-867E\":[\"Buy Low Sell High\",227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/867\\\"\\u003eCodeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)\\u003c/a\\u003e\"],\"CodeForces-1681F\":[\"Unique Occurrences\",1553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1681\\\"\\u003eEducational Codeforces Round 129 (Rated for Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc141_d\":[\"Powerful Discount Tickets\",2696,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc141\\\"\\u003eAtCoder Beginner Contest 141\\u003c/a\\u003e\"],\"CodeForces-891C\":[\"Envy\",2415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/891\\\"\\u003eCodeforces Round 446 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4294\":[\"游览计划\",1524,\"WC2008\"],\"洛谷-P3366\":[\"最小生成树\",126586,\"模板\"],\"CodeForces-240E\":[\"Road Repairs\",396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/240\\\"\\u003eCodeforces Round 145 (Div. 1, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"HDU-1512\":[\"Monkey King\",1889,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZOJ+3rd+Anniversary+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZOJ 3rd Anniversary Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3402\":[\"可持久化并查集\",8489,null],\"洛谷-P3367\":[\"并查集\",100177,\"模板\"],\"CodeForces-266D\":[\"BerDonalds\",770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/266\\\"\\u003eCodeforces Round 163 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4716\":[\"最小树形图\",2724,\"模板\"],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"洛谷-P1801\":[\"黑匣子\",15572,null],\"CodeForces-1468J\":[\"Road Reform\",4190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1468\\\"\\u003e2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules)\\u003c/a\\u003e\"],\"Gym-103446H\":[\"Life is a Game\",617,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103446\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 ICPC Asia Shanghai Regional Programming Contest\\u003c/a\\u003e\"],\"洛谷-P1967\":[\"货车运输\",29583,\"NOIP2013 提高组\"],\"HDU-2121\":[\"Ice_cream’s world II\",1440,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-10++Programming+Contest_WarmUp\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-10 Programming Contest_WarmUp \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1213\":[\"How Many Tables\",26650,\"\\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%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM省赛集训队选拔赛之热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-600E\":[\"Lomsat gelral\",14322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"Gym-102482C\":[\"Conquer the World\",38,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102482\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018 ACM-ICPC World Finals\\u003c/a\\u003e\"],\"洛谷-P3377\":[\"左偏树/可并堆\",16457,\"模板\"],\"洛谷-P2483\":[\"k 短路 / [SDOI2010] 魔法猪学院\",3016,\"模板\"],\"QOJ-6330\":[\"XOR Reachable\",72,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1207\\\"\\u003eThe 1st Universal Cup. Stage 12: Ōokayama\\u003c/a\\u003e\"],\"洛谷-P8026\":[\"Bajtocja\",362,\"ONTAK2015\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"abcdhhhh","updateTime":1685273899000,"title":"(Section 9) 堆、并查集、最小生成树","dislikeCnt":0,"content":"# 堆\n## 优先队列\n[problem:洛谷-P3378] 模板\n[problem:洛谷-P1801] 基本运用\n[problem:AtCoder-abc141_d] 基本运用(数据结构上机题)\n[problem:HDU-1280] 基本运用(数据结构上机题)\n[problem:AtCoder-abc127_f] 对顶堆\n[problem:CodeForces-867E] \n[problem:AtCoder-abc217_h] \n[problem:洛谷-P4779] 最短路模板\n\n## 可并堆\n[problem:洛谷-P3377] 模板\n[problem:HDU-1512] 基本运用\n[problem:Gym-102482C] \n\n## 可持久化可并堆\n[problem:洛谷-P2483] K 短路模板\n\n# 并查集\n## 并查集\n[problem:洛谷-P3367] 模板\n[problem:洛谷-P3958] 基本运用\n[problem:HDU-1213] 基本运用(数据结构上机)\n[problem:CodeForces-1213G] 基本运用(数据结构上机)\n\n## 可撤销并查集\n[problem:CodeForces-1681F] (虽然不是正解)\n[problem:CodeForces-891C] \n[problem:QOJ-6330] 与 trie 结合\n\n## 可持久化并查集\n[problem:洛谷-P3402] 模板\n\n## 树上启发式合并\n\n[problem:CodeForces-600E] 模板题\n[problem:洛谷-P8026] \n\n# 最小生成树\n## 最小生成树\n[problem:洛谷-P3366] 模板\n[problem:CodeForces-1468J] 基本运用\n[problem:CodeForces-1245D] 基本运用\n\n\n## Kruskal 重构树\n\n[problem:洛谷-P1967] 模板题(数据结构上机)\n[problem:Gym-103446H] \n[problem:洛谷-P4768] (也可用可持久化并查集)\n\n## 最小斯坦纳树\n\n[problem:洛谷-P6192] 模板\n[problem:洛谷-P4294] \n\n## 最小树形图\n\n[problem:洛谷-P4716] 模板\n[problem:HDU-2121] \n[problem:CodeForces-240E]\n\n## 最小直径生成树\n[problem:CodeForces-266D]\n\n\n\n","threadId":146153,"likeCnt":0,"createTime":1685200884000,"isWorkbook":true,"viewCnt":720,"openness":2,"fav":false,"id":3685,"trustable":false}