|
|
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 |
|
|
1406 |
1406
[APIO2009] 抢掠计划
|
1 / 2 |
10 |
|
|
1428 |
1428
[ABC223G] Vertex Deletion
|
0 / 0 |
(无) |
|
|
1454 |
1454
[HAOI2010] 软件安装
|
1 / 5 |
8 |
|
|
1488 |
1488
[ABC235E] MST + 1
|
1 / 1 |
7 |
|
|
1504 |
1504
[SDOI2010] 所驼门王的宝藏
|
0 / 0 |
8 |
|
|
1518 |
1518
[ABC226C] Martial artist
|
2 / 2 |
10 |
|
|
1520 |
1520
[ABC226E] Just one
|
2 / 2 |
10 |
|
|
1526 |
1526
[USACO07NOV] Cow Relays G
|
0 / 2 |
10 |
|
|
1539 |
1539
[JSOI2010] 满汉全席
|
0 / 0 |
(无) |
|
|
1551 |
1551
[USACO11JAN] The Continental Cowngress G
|
1 / 5 |
10 |
|
|
1552 |
1552
[USACO11JAN] Roads and Planes G
|
0 / 0 |
(无) |
|
|
1563 |
1563
[模板] 最小生成树
|
11 / 53 |
5 |
|
|
1564 |
1564
[USACO3.1] 最短网络 Agri-Net
|
10 / 16 |
5 |
|
|
1565 |
1565
局域网
|
1 / 2 |
6 |
|
|
1566 |
1566
[SCOI2005] 繁忙的都市
|
8 / 12 |
5 |
|
|
1567 |
1567
[USACO14MAR] Watering the Fields S
|
1 / 2 |
5 |
|
|
1568 |
1568
[SCOI2012] 滑雪
|
2 / 4 |
8 |
|
|
1569 |
1569
[ABC270F] Transportation
|
4 / 11 |
7 |
|
|
1570 |
1570
[ABC282E] Choose Two and Eat One
|
1 / 1 |
7 |
|
|
1571 |
1571
[USACO15FEB] Superbull S
|
1 / 1 |
6 |
|
|
1572 |
1572
[USACO22FEB] Moo Network G
|
1 / 1 |
7 |
|
|
1573 |
1573
[COCI2009-2010#7] SVEMIR
|
2 / 3 |
7 |
|
|
1574 |
1574
[JSOI2010] 部落划分
|
1 / 1 |
7 |
|
|
1575 |
1575
公路修建
|
1 / 7 |
7 |
|
|
1576 |
1576
[HNOI2006] 公路修建问题
|
1 / 7 |
8 |
|
|
1577 |
1577
[APIO2008] 免费道路
|
0 / 0 |
(无) |
|
|
1581 |
1581
[模板] 割点（割顶）
|
0 / 0 |
(无) |
|
|
1595 |
1595
[POI2008] BLO-Blockade
|
1 / 3 |
10 |
|
|
1596 |
1596
[模板] 拓扑排序 / 家谱树
|
5 / 14 |
9 |
|
|
1597 |
1597
[模板] 差分约束
|
0 / 0 |
(无) |
|
|
1631 |
1631
CF1385E - Directing Edges
|
3 / 3 |
7 |
|
|
1632 |
1632
[HNOI2015] 菜肴制作
|
1 / 1 |
8 |
|
|
1633 |
1633
[USACO20FEB] Timeline G
|
7 / 16 |
5 |
|
|
1634 |
1634
[HAOI2016] 食物链
|
11 / 18 |
5 |
|
|
1635 |
1635
[ABC245F] Endless Walk
|
5 / 9 |
7 |
|
|
1636 |
1636
Restore the Tree
|
2 / 3 |
7 |
|
|
1637 |
1637
[USACO18OPEN] Milking Order G
|
2 / 4 |
8 |
|
|
1639 |
1639
[USACO06JAN] Redundant Paths G
|
3 / 6 |
8 |
|
|
1776 |
1776
迷宫行走
|
0 / 0 |
(无) |
|
|
1817 |
1817
[ABC243E] Edge Deletion
|
0 / 0 |
(无) |
|
|
1974 |
1974
CF609E - Minimum spanning tree for each edge
|
1 / 1 |
8 |
|
|
2043 |
2043
[ABC254E] Small d and k
|
0 / 0 |
(无) |
|
|
2064 |
2064
[ABC257F] Teleporter Setting
|
0 / 0 |
(无) |
|
|
2109 |
2109
[CSP-J2019 江西] 道路拆除
|
0 / 0 |
(无) |
|
|
2190 |
2190
CF1932G - Moving Platforms
|
0 / 0 |
8 |
|
|
2212 |
2212
[ABC286G] Unique Walk
|
0 / 0 |
(无) |
|
|
2247 |
2247
[USACO15JAN] Grass Cownoisseur G
|
0 / 0 |
8 |
|
|
2250 |
2250
[ABC264G] String Fair
|
0 / 0 |
(无) |
|
|
2276 |
2276
[COTS 2019] 排名 Vezuv
|
0 / 0 |
(无) |
|
|
2365 |
2365
[GESP202312 六级] 工作沟通
|
0 / 1 |
10 |
|
|
2366 |
2366
[GESP202312 七级] 商品交易
|
0 / 0 |
(无) |
|
|
2375 |
2375
[GESP样题 七级] 最长不下降子序列
|
0 / 0 |
(无) |
|
|
2380 |
2380
[GESP202403 七级] 交流问题
|
0 / 0 |
(无) |
|
|
2389 |
2389
[GESP202406 八级] 空间跳跃
|
0 / 0 |
(无) |
|
|
2436 |
2436
[图论与代数结构 701] 强连通分量
|
7 / 25 |
7 |
|
|
2437 |
2437
[JSOI2014] 强连通图
|
1 / 4 |
8 |
|
|
2438 |
2438
[模板] 缩点
|
4 / 9 |
7 |
|
|
2439 |
2439
CF1914G1 - Light Bulbs (Easy Version)
|
1 / 1 |
7 |
|
|
2440 |
2440
CF427C - Checkposts
|
1 / 1 |
7 |
|
|
2441 |
2441
CF999E - Reachability from the Capital
|
1 / 2 |
8 |
|
|
2442 |
2442
CF894E - Ralph and Mushrooms
|
1 / 1 |
8 |
|
|
2458 |
2458
[模板] 割点
|
4 / 9 |
7 |
|
|
2459 |
2459
[模板] 点双连通分量
|
3 / 14 |
7 |
|
|
2460 |
2460
[模板] 边双连通分量
|
2 / 5 |
7 |
|
|
2461 |
2461
CF652E - Pursuit For Artifacts
|
1 / 1 |
8 |
|
|
2462 |
2462
「EVOI-RD2」旅行家
|
0 / 10 |
8 |
|
|
2463 |
2463
HDU4612 - Warm up
|
1 / 2 |
8 |
|
|
2469 |
2469
[模板] 负环
|
1 / 1 |
5 |
|
|
2470 |
2470
[W1] 团
|
1 / 5 |
7 |
|
|
2471 |
2471
无向图的最小环问题
|
1 / 2 |
5 |
|
|
2472 |
2472
灾后重建
|
0 / 0 |
7 |
|
|
2473 |
2473
拉近距离
|
0 / 0 |
7 |
|
|
2474 |
2474
[APIO2008] 免费道路
|
0 / 0 |
9 |
|
|
2475 |
2475
[模板] 拓扑排序 / 家谱树
|
2 / 2 |
5 |
|
|
2476 |
2476
[模板] 差分约束
|
2 / 6 |
7 |
|
|
2477 |
2477
小 K 的农场
|
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 |
|
|
2492 |
2492
[ABC383E] Sum of Max Matching
|
0 / 0 |
8 |
|
|
2493 |
2493
[模板] 最小生成树
|
2 / 4 |
5 |
|
|
2551 |
2551
有源汇有上下界最大流
|
0 / 0 |
8 |
|
|
2552 |
2552
有源汇有上下界最小流
|
0 / 0 |
8 |
