|
|
9908 |
ATabc251f
[ABC251F] Two Spanning Trees
|
3 / 5 |
10 |
|
|
9921 |
ATabc252e
[ABC252E] Road Reduction
|
4 / 16 |
9 |
|
|
10023 |
ATabc270f
[ABC270F] Transportation
|
1 / 1 |
10 |
|
|
7020 |
ATabc282e
[ABC282E] Choose Two and Eat One
|
3 / 3 |
10 |
|
|
8315 |
ATabc328e
[ABC328E] Modulo MST
|
1 / 3 |
10 |
|
|
2599 |
ATabc345f
[ABC345F] Many Lamps
|
3 / 3 |
10 |
|
|
1610 |
ATabc352e
[ABC352E] Clique Connect
|
3 / 10 |
10 |
|
|
1546 |
ATabc355f
[ABC355F] MST Query
|
4 / 7 |
10 |
|
|
1664 |
ATabc364f
[ABC364F] Range Connect MST
|
4 / 18 |
9 |
|
|
8034 |
ATagc064b
[AGC064B] Red and Blue Spanning Tree
|
1 / 17 |
10 |
|
|
203 |
ATarc165c
[ARC165C] Social Distance on Graph
|
5 / 27 |
8 |
|
|
1178 |
ATarc167c
[ARC167C] MST on Line++
|
1 / 1 |
10 |
|
|
1241 |
ATarc181e
[ARC181E] Min and Max at the edge
|
1 / 1 |
10 |
|
|
12503 |
CF545E
D92【模板】最短路径树 Dijkstra 算法 CF545E Paths and Trees
|
3 / 6 |
10 |
|
|
264 |
P1091
D130 最小生成树 Kruskal 算法 P1550 [USACO08OCT] Watering Hole G
|
52 / 85 |
2 |
|
|
1411 |
P2138
D131【最小生成树】[USACO07DEC] Building Roads S
|
27 / 61 |
4 |
|
|
1476 |
P2202
D139【最小生成树】无线通讯网
|
37 / 151 |
7 |
|
|
1876 |
P2457
D140 【最小生成树】构造完全图 走廊泼水节
|
8 / 24 |
7 |
|
|
2056 |
P2632
D134 最小生成树 Kruskal 算法[USACO13FEB] Tractor S
|
10 / 46 |
7 |
|
|
2105 |
P2681
D144 最小生成树 Kruskal 算法[USACO11DEC] Simplifying the Farm G
|
2 / 2 |
10 |
|
|
2181 |
P2757
D08 [USACO04DEC] Bad Cowtractors S
|
7 / 15 |
8 |
|
|
2205 |
P2781
D142 最小生成树 Kruskal 算法+01分数规划[USACO01OPEN] Earthquake
|
1 / 2 |
10 |
|
|
2885 |
P3232
D133【最小生成树】[USACO08NOV] Cheering up the Cow G
|
5 / 11 |
9 |
|
|
3642 |
P3977
D141【LCA最近公共祖先：严格次小生成树】[BJWC2010] 严格次小生成树
|
4 / 7 |
10 |
|
|
3790 |
P4125
[WC2013] 平面图
|
1 / 3 |
10 |
|
|
3842 |
P4177
曼哈顿最小生成树
|
0 / 8 |
10 |
|
|
3861 |
P4196
[WC2012] 最小生成树
|
0 / 0 |
(无) |
|
|
4259 |
P4594
【动态树LCT】[WC2006] 水管局长(加强版)
|
4 / 28 |
9 |
|
|
4734 |
P5069
[PA 2011] Hard Choice
|
1 / 1 |
10 |
|
|
6462 |
P6793
[CERC2016] 机棚障碍 Hangar Hurdles
|
3 / 9 |
10 |
|
|
6722 |
P7053
D132 最小生成树 Kruskal 算法 [USACO15FEB] Superbull S
|
6 / 25 |
8 |
|
|
6744 |
P7075
D08 [USACO14MAR] Watering the Fields S
|
3 / 3 |
10 |
|
|
6862 |
P7193
D08 [USACO16DEC] Moocast G
|
7 / 13 |
8 |
|
|
6946 |
P7277
D135 最小生成树 Prim 算法[USACO19OPEN] I Would Walk 500 Miles G
|
12 / 74 |
8 |
|
|
361 |
lg1967
D147 Kruskal 重构树[NOIP 2013 提高组] 货车运输
|
40 / 93 |
4 |
|
|
2849 |
lg2323
[HNOI2006] 公路修建问题
|
5 / 20 |
8 |
|
|
2736 |
lg2330
[SCOI2005] 繁忙的都市
|
18 / 20 |
4 |
|
|
5334 |
lg2387
[NOI2014] 魔法森林
|
2 / 5 |
10 |
|
|
4094 |
lg2504
D129 最小生成树 Kruskal 算法[HAOI2006] 聪明的猴子
|
14 / 42 |
6 |
|
|
4418 |
lg2573
[SCOI2012] 滑雪
|
9 / 95 |
9 |
|
|
4319 |
lg2619
*【最小生成树：灵活】[国家集训队] Tree I
|
4 / 16 |
9 |
|
|
6695 |
lg3141
D138 [USACO16FEB] Fenced In P
|
1 / 12 |
10 |
|
|
3666 |
lg3206
【CDQ分治】[HNOI2010] 城市建设
|
0 / 0 |
(无) |
|
|
6206 |
lg3249
[HNOI2016] 矿区
|
1 / 1 |
10 |
|
|
4987 |
lg3280
[SCOI2013] 摩托车交易
|
1 / 1 |
10 |
|
|
5199 |
lg3317
[SDOI2014] 重建
|
1 / 1 |
10 |
|
|
263 |
lg3366
D07D08 最小生成树(loj123)
|
90 / 460 |
7 |
|
|
5289 |
lg3623
[APIO2008] 免费道路
|
2 / 4 |
10 |
|
|
4871 |
lg3639
[APIO2013] 道路费用
|
1 / 4 |
10 |
|
|
6839 |
lg3665
[USACO17OPEN] Switch Grass P
|
2 / 3 |
10 |
|
|
3477 |
lg4047
[JSOI2010] 部落划分
|
1 / 1 |
10 |
|
|
2669 |
lg4208
[JSOI2008] 最小生成树计数
|
13 / 31 |
5 |
|
|
1333 |
lg4455
[CQOI2018] 社交网络
|
28 / 234 |
8 |
|
|
2400 |
lg5292
[HNOI2019] 校园旅行
|
1 / 3 |
10 |
|
|
2562 |
lg5468
[NOI2019] 回家路线
|
3 / 3 |
10 |
|
|
12490 |
lg5687
D138 最小生成树 Kruskal 算法 [CSP-S 2019 江西] 网格图
|
1 / 1 |
10 |
|
|
10411 |
lg6168
[IOI 2016] railroad
|
1 / 1 |
10 |
|
|
11539 |
lg6178
【模板】Matrix-Tree 定理
|
1 / 4 |
10 |
|
|
7312 |
lg6628
[省选联考 2020 B 卷] 丁香之路
|
5 / 8 |
10 |
|
|
7040 |
lg7528
D143 最小生成树 Kruskal 算法 [USACO21OPEN] Portals G
|
3 / 5 |
10 |
|
|
7641 |
lg8191
D136 【最小生成树】[USACO22FEB] Moo Network G
|
4 / 35 |
9 |
|
|
7033 |
lg8269
[USACO22OPEN] Visits S
|
4 / 12 |
9 |
|
|
12520 |
lg8950
[YsOI2022] 道路修建
|
1 / 3 |
10 |
|
|
7227 |
lg9531
[JOIST 2022] 复兴计划 / Reconstruction Project
|
1 / 1 |
10 |
|
|
7590 |
lg9984
[USACO23DEC] A Graph Problem P
|
3 / 7 |
10 |
|
|
414 |
lg11095
[ROI 2021] 旅行 (Day 2)
|
23 / 60 |
5 |
|
|
9062 |
lg11664
[JOI 2025 Final] 缆车 / Mi Teleférico
|
1 / 2 |
10 |
|
|
1375 |
lg14362
D145 最小生成树 Kruskal 算法[CSP-S 2025] 道路修复
|
30 / 73 |
5 |
|
|
8456 |
lg14415
[JOISC 2015] 遗产继承 / Inheritance
|
1 / 1 |
10 |
|
|
5907 |
lg14422
[JOISC 2014] 水壶 / Water Bottle
|
1 / 1 |
10 |
|
|
2963 |
loj2783
「BalticOI 2016 Day2」城市
|
2 / 2 |
10 |
|
|
6410 |
loj5066
「POI2017 R3」奇偶路口 Crossroads of parity
|
1 / 1 |
10 |
|
|
10977 |
loj5231
「UOI 2021 Stage 4 Day2」科扎克·武斯与最大公约数
|
1 / 1 |
10 |
|
|
11064 |
loj5384
「OOI 2022 Day 2」航空改革
|
1 / 1 |
10 |
|
|
9658 |
loj5605
「JOI 2026 Semifinal」新桥
|
1 / 2 |
10 |
|
|
11300 |
loj6259
「CodePlus 2017 12 月赛」白金元首与独舞
|
1 / 3 |
10 |
|
|
1437 |
loj10064
D94【最短路】单源最短路等价子图个数 黑暗城堡(题意错误，待修改)
|
25 / 144 |
8 |
