|
|
640 |
640
[CSP-S 2022] 假期计划
|
1 / 2 |
8 |
|
|
647 |
647
[CSP-J 2023] 旅游巴士
|
4 / 42 |
7 |
|
|
659 |
659
[CSP-S 2021] 交通规划
|
0 / 0 |
9 |
|
|
673 |
673
[CSP-J2019 江西] 道路拆除
|
6 / 24 |
7 |
|
|
676 |
676
[CSP-J2019] 加工零件
|
2 / 13 |
7 |
|
|
755 |
755
黑暗城堡
|
0 / 0 |
(无) |
|
|
763 |
763
Sightseeing Trip
|
0 / 0 |
(无) |
|
|
765 |
765
[USACO08JAN] Telephone Lines S
|
1 / 1 |
8 |
|
|
766 |
766
[USACO07FEB] Cow Party S
|
8 / 14 |
5 |
|
|
767 |
767
[USACO06NOV] Roadblocks G
|
2 / 4 |
8 |
|
|
768 |
768
最短路计数
|
1 / 1 |
7 |
|
|
769 |
769
[CQOI2005] 新年好
|
1 / 13 |
5 |
|
|
772 |
772
[USACO11JAN] Roads and Planes G
|
0 / 0 |
(无) |
|
|
774 |
774
[BOI 2002] 双调路径
|
0 / 0 |
(无) |
|
|
777 |
777
Easy SSSP
|
2 / 17 |
5 |
|
|
915 |
915
[SCOI2009] 迷路
|
0 / 0 |
(无) |
|
|
954 |
954
[NOIP2001 提高组] Car 的旅行路线
|
0 / 0 |
(无) |
|
|
1035 |
1035
[NOIP2012 普及组] 文化之旅
|
0 / 0 |
(无) |
|
|
1071 |
1071
[NOIP2017 普及组] 棋盘
|
0 / 32 |
10 |
|
|
1075 |
1075
[NOIP2017 提高组] 逛公园
|
0 / 0 |
(无) |
|
|
1190 |
1190
[模板] bellman-ford 算法
|
15 / 23 |
3 |
|
|
1191 |
1191
[模板] spfa 算法
|
15 / 49 |
3 |
|
|
1193 |
1193
[模板] dijkstra 算法（堆优化）
|
15 / 85 |
5 |
|
|
1202 |
1202
[模板] floyd
|
15 / 44 |
5 |
|
|
1357 |
1357
[USACO07OCT] Obstacle Course S
|
14 / 47 |
6 |
|
|
1358 |
1358
[USACO09JAN] Laserphones S
|
1 / 4 |
10 |
|
|
1371 |
1371
[USACO2.4] 回家 Bessie Come Home
|
0 / 0 |
(无) |
|
|
1372 |
1372
[ARC061E] すぬけ君の地下鉄旅行
|
0 / 0 |
(无) |
|
|
1373 |
1373
[USACO09NOV] Job Hunt S
|
10 / 20 |
5 |
|
|
1375 |
1375
CF938D - Buy a Ticket
|
11 / 18 |
8 |
|
|
1376 |
1376
[W1] 团
|
6 / 8 |
9 |
|
|
1378 |
1378
CF1941G - Rudolf and Subway
|
2 / 3 |
7 |
|
|
1379 |
1379
[COCI2012-2013#5] HIPERCIJEVI
|
2 / 3 |
7 |
|
|
1380 |
1380
[JLOI2011] 飞行路线
|
11 / 13 |
7 |
|
|
1381 |
1381
无向图的最小环问题
|
2 / 24 |
9 |
|
|
1382 |
1382
[模板] 传递闭包
|
10 / 11 |
5 |
|
|
1383 |
1383
[ABC192E] Train
|
1 / 1 |
6 |
|
|
1384 |
1384
[ABC132E] Hopscotch Addict
|
1 / 2 |
7 |
|
|
1385 |
1385
[Code+#4] 最短路
|
1 / 1 |
8 |
|
|
1386 |
1386
[ABC208D] Shortest Path Queries 2
|
12 / 30 |
5 |
|
|
1387 |
1387
灾后重建
|
5 / 6 |
10 |
|
|
1388 |
1388
[GXOI/GZOI2019] 旅行者
|
1 / 1 |
8 |
|
|
1389 |
1389
CF1725M - Moving Both Hands
|
2 / 3 |
7 |
|
|
1390 |
1390
[NOI2007] 社交网络
|
2 / 2 |
7 |
|
|
1391 |
1391
[USACO08JAN] Cow Contest S
|
1 / 1 |
5 |
|
|
1392 |
1392
[JSOI2010] 连通数
|
1 / 2 |
8 |
|
|
1393 |
1393
[USACO21JAN] Telephone G
|
1 / 2 |
8 |
|
|
1394 |
1394
[USACO08OPEN] Clear And Present Danger
|
1 / 1 |
5 |
|
|
1526 |
1526
[USACO07NOV] Cow Relays G
|
0 / 2 |
10 |
|
|
1552 |
1552
[USACO11JAN] Roads and Planes G
|
0 / 0 |
(无) |
|
|
1776 |
1776
迷宫行走
|
0 / 0 |
(无) |
|
|
1817 |
1817
[ABC243E] Edge Deletion
|
0 / 0 |
(无) |
|
|
2064 |
2064
[ABC257F] Teleporter Setting
|
0 / 0 |
(无) |
|
|
2109 |
2109
[CSP-J2019 江西] 道路拆除
|
0 / 0 |
(无) |
|
|
2190 |
2190
CF1932G - Moving Platforms
|
0 / 0 |
8 |
|
|
2250 |
2250
[ABC264G] String Fair
|
0 / 0 |
(无) |
|
|
2366 |
2366
[GESP202312 七级] 商品交易
|
0 / 0 |
(无) |
|
|
2389 |
2389
[GESP202406 八级] 空间跳跃
|
0 / 0 |
(无) |
|
|
2470 |
2470
[W1] 团
|
1 / 5 |
7 |
|
|
2471 |
2471
无向图的最小环问题
|
1 / 2 |
5 |
|
|
2472 |
2472
灾后重建
|
0 / 0 |
7 |
|
|
2478 |
2478
[SCOI2011] 糖果
|
2 / 8 |
8 |
|
|
2479 |
2479
[1007] 倍杀测量者
|
0 / 0 |
9 |
|
|
2480 |
2480
[ABC216G] 01Sequence
|
0 / 0 |
8 |
|
|
2481 |
2481
[AGC056C] 01 Balanced
|
0 / 0 |
9 |
|
|
2482 |
2482
[TJOI2019] 大中锋的游乐场
|
1 / 3 |
7 |
