|
|
11631 |
ATabc120d
[ABC120D] Decayed Bridges
|
8 / 25 |
7 |
|
|
11661 |
ATabc126e
[ABC126E] 1 or 2
|
2 / 3 |
10 |
|
|
11686 |
ATabc131f
[ABC131F] Must Be Rectangular!
|
1 / 1 |
10 |
|
|
11722 |
ATabc137d
[ABC137D] Summer Vacation
|
1 / 1 |
10 |
|
|
11986 |
ATabc181f
[ABC181F] Silver Woods
|
1 / 1 |
10 |
|
|
11995 |
ATabc183f
[ABC183F] Confluence
|
2 / 2 |
10 |
|
|
12379 |
ATabc238e
[ABC238E] Range Sums
|
1 / 1 |
10 |
|
|
12451 |
ATabc247f
[ABC247F] Cards
|
3 / 9 |
10 |
|
|
8872 |
ATabc314f
[ABC314F] A Certain Game
|
1 / 1 |
10 |
|
|
8316 |
ATabc328f
[ABC328F] Good Set Query
|
2 / 8 |
10 |
|
|
7705 |
ATabc350d
[ABC350D] New Friends
|
9 / 42 |
7 |
|
|
1546 |
ATabc355f
[ABC355F] MST Query
|
4 / 7 |
10 |
|
|
3493 |
ATabc361g
[ABC361G] Go Territory
|
2 / 8 |
10 |
|
|
7947 |
ATabc372e
[ABC372E] K-th Largest Connected Components
|
3 / 4 |
10 |
|
|
855 |
ATabc408e
*【并查集】最小或路径[ABC408E] Minimum OR Path
|
11 / 115 |
9 |
|
|
8371 |
ATagc002d
[AGC002D] Stamp Rally
|
2 / 2 |
10 |
|
|
8714 |
ATagc016d
[AGC016D] XOR Replace
|
1 / 1 |
10 |
|
|
8625 |
ATagc031f
[AGC031F] Walk on Graph
|
1 / 2 |
10 |
|
|
8492 |
ATagc038d
[AGC038D] Unique Path
|
1 / 1 |
10 |
|
|
8064 |
ATagc059c
[AGC059C] Guessing Permutation for as Long as Possible
|
1 / 1 |
10 |
|
|
8009 |
ATagc069b
[AGC069B] Pair Guessing
|
1 / 1 |
10 |
|
|
9402 |
ATarc090b
[ABC087D] People on a Line
|
1 / 1 |
10 |
|
|
9225 |
ATarc124d
[ARC124D] Yet Another Sorting Problem
|
1 / 1 |
10 |
|
|
208 |
ATarc164b
[ARC164B] Switching Travel
|
1 / 1 |
10 |
|
|
1179 |
ATarc167d
[ARC167D] Good Permutation
|
1 / 1 |
10 |
|
|
836 |
P1657
D98 最短路径树+并查集 Dijkstra 算法[USACO09JAN] Safe Travel G
|
15 / 23 |
4 |
|
|
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 |
|
|
2181 |
P2757
D08 [USACO04DEC] Bad Cowtractors S
|
7 / 15 |
8 |
|
|
3017 |
P3364
[BalticOI 2004] ships 船
|
0 / 12 |
10 |
|
|
3182 |
P3527
[POI 2005] PUN-Points
|
1 / 1 |
10 |
|
|
3184 |
P3529
[POI 2005] SKA-Piggy Banks
|
2 / 2 |
10 |
|
|
3642 |
P3977
D141【LCA最近公共祖先：严格次小生成树】[BJWC2010] 严格次小生成树
|
4 / 7 |
10 |
|
|
4275 |
P4610
[POI 2003] Monkeys
|
1 / 1 |
10 |
|
|
4715 |
P5050
D55 树的直径 树形DP+并查集 [P2195] HXY造公园
|
1 / 3 |
10 |
|
|
4734 |
P5069
[PA 2011] Hard Choice
|
1 / 1 |
10 |
|
|
5963 |
P6298
[ONTAK2015] Bajtocja
|
1 / 4 |
10 |
|
|
388 |
SP1805
*【栈：单调栈】直方图的最大子矩阵面积
|
57 / 272 |
7 |
|
|
12484 |
lg1127
D167 欧拉路径 P1127 词链
|
17 / 36 |
5 |
|
|
268 |
lg1196
C126 带权并查集[NOI2002] 银河英雄传说
|
57 / 129 |
4 |
|
|
2668 |
lg1197
C130 并查集 [JSOI2008] 星球大战
|
24 / 38 |
3 |
|
|
12495 |
lg1347
D112 最短路→传递闭包 Floyd 算法 P1347 排序
|
2 / 3 |
10 |
|
|
2221 |
lg1455
C129【并查集+01背包】[P1455] 搭配购买
|
9 / 39 |
7 |
|
|
1344 |
lg1525
D170 二分图判定 二分+染色法[NOIP 2010 提高组] 关押罪犯
|
47 / 100 |
4 |
|
|
3519 |
lg1640
[SCOI2010] 连续攻击游戏
|
1 / 1 |
10 |
|
|
3023 |
lg1892
C123【扩展域并查集】[BalticOI 2003] 团伙
|
15 / 63 |
7 |
|
|
5860 |
lg1955
C128 并查集+离散化 [NOI2015] 程序自动分析
|
6 / 25 |
8 |
|
|
269 |
lg2024
C124C125【扩展域并查集｜带权并查集】[NOI2001] 食物链
|
63 / 122 |
3 |
|
|
5864 |
lg2178
[NOI2015] 品酒大会
|
2 / 12 |
10 |
|
|
2855 |
lg2294
【差分约束】[HNOI2005] 狡猾的商人
|
2 / 8 |
10 |
|
|
2857 |
lg2316
[HNOI2005] 分形
|
0 / 19 |
10 |
|
|
2849 |
lg2323
[HNOI2006] 公路修建问题
|
5 / 20 |
8 |
|
|
2736 |
lg2330
[SCOI2005] 繁忙的都市
|
19 / 22 |
3 |
|
|
4672 |
lg2498
[SDOI2012] 拯救小云公主
|
1 / 1 |
10 |
|
|
2703 |
lg2502
【贪心+并查集】[HAOI2006]旅行
|
16 / 35 |
5 |
|
|
2693 |
lg2607
D28 基环树 树形DP [ZJOI2008] 骑士
|
20 / 67 |
6 |
|
|
741 |
lg2661
D153 拓扑排序[NOIP 2015 提高组] 信息传递
|
7 / 13 |
8 |
|
|
6231 |
lg3181
[HAOI2016] 找相同字符
|
2 / 5 |
10 |
|
|
3663 |
lg3207
[HNOI2010] 物品调度
|
0 / 0 |
(无) |
|
|
3662 |
lg3209
D39 2-SAT [HNOI2010] 平面图判定
|
2 / 2 |
10 |
|
|
4393 |
lg3220
[HNOI2012] 与非
|
1 / 2 |
10 |
|
|
4398 |
lg3224
C68 线段树合并+并查集[HNOI2012] 永无乡
|
3 / 9 |
10 |
|
|
5678 |
lg3240
[HNOI2015] 实验比较
|
1 / 1 |
10 |
|
|
6202 |
lg3247
[HNOI2016] 最小公倍数
|
3 / 9 |
10 |
|
|
3998 |
lg3273
[SCOI2011] 棘手的操作
|
1 / 2 |
10 |
|
|
3999 |
lg3276
[SCOI2011] 镜像拆分
|
2 / 2 |
10 |
|
|
4990 |
lg3279
[SCOI2013] 密码
|
1 / 1 |
10 |
|
|
6234 |
lg3295
[SCOI2016] 萌萌哒
|
14 / 129 |
9 |
|
|
263 |
lg3366
D07D08 最小生成树(loj123)
|
90 / 460 |
7 |
|
|
11526 |
lg3367
C01【模板】并查集
|
24 / 87 |
6 |
|
|
5338 |
lg3402
【模板】可持久化并查集
|
1 / 3 |
10 |
|
|
5289 |
lg3623
[APIO2008] 免费道路
|
2 / 4 |
10 |
|
|
3968 |
lg3631
[APIO2011] 方格染色
|
1 / 2 |
10 |
|
|
9066 |
lg3747
[六省联考 2017] 相逢是问候
|
1 / 2 |
10 |
|
|
803 |
lg3958
[NOIP 2017 提高组] 奶酪
|
11 / 95 |
8 |
|
|
3477 |
lg4047
[JSOI2010] 部落划分
|
1 / 1 |
10 |
|
|
6267 |
lg4079
[SDOI2016] 齿轮
|
11 / 25 |
6 |
|
|
6216 |
lg4092
[HEOI2016/TJOI2016] 树
|
3 / 6 |
10 |
|
|
4876 |
lg4145
C43 线段树+暴力区修[上帝造题的七分钟 2 / 花神游历各国](输入格式有异)
|
47 / 306 |
8 |
|
|
6195 |
lg4219
C136 线段树分治+并查集 [BJOI2014] 大融合
|
4 / 14 |
9 |
|
|
6809 |
lg4271
D59 树的直径 树上前缀和[USACO18FEB] New Barns P
|
1 / 3 |
10 |
|
|
6798 |
lg4374
[USACO18OPEN] Disruption P
|
1 / 1 |
10 |
|
|
2393 |
lg4426
[HNOI/AHOI2018] 毒瘤
|
1 / 4 |
10 |
|
|
560 |
lg4768
D148 Kruskal 重构树[NOI2018] 归程
|
31 / 154 |
7 |
|
|
10762 |
lg5089
[eJOI 2018] 元素周期表
|
1 / 1 |
10 |
|
|
4902 |
lg5227
C134【线段树分治+并查集】[AHOI2013] 连通图
|
2 / 2 |
10 |
|
|
6949 |
lg5423
[USACO19OPEN] Valleys P
|
1 / 1 |
10 |
|
|
856 |
lg5443
[APIO2019] 桥梁
|
64 / 136 |
4 |
|
|
2218 |
lg5631
C135【线段树分治+并查集】最小mex生成树
|
2 / 3 |
10 |
|
|
5690 |
lg5787
C131【线段树分治+并查集】二分图 /【模板】线段树分治
|
2 / 2 |
10 |
|
|
1321 |
lg5937
C127【带权并查集+离散化】奇偶游戏[CEOI 1999] Parity Game
|
39 / 120 |
6 |
|
|
6891 |
lg6008
[USACO20JAN] Cave Paintings P
|
10 / 30 |
6 |
|
|
10797 |
lg6234
[eJOI 2019] T形覆盖
|
1 / 3 |
10 |
|
|
10760 |
lg6305
[eJOI 2018] 循环排序
|
1 / 1 |
10 |
|
|
10770 |
lg6405
[COCI 2014/2015 #2] ŠUMA
|
1 / 1 |
10 |
|
|
7312 |
lg6628
[省选联考 2020 B 卷] 丁香之路
|
5 / 8 |
10 |
|
|
1387 |
lg6765
[APIO2020] 交换城市
|
26 / 54 |
4 |
|
|
10387 |
lg6830
[IOI 2020] 连接擎天树
|
1 / 1 |
10 |
