包括DFS,BFS,树与图的深度优先遍历,树与图的广度优先遍历,拓扑排序,Dijkstra,bellman-ford,spfa,Floyd,Prim,Kruskal,染色法判定二分图,匈牙利算法等内容。
Login to join training plan
Section 6. Dijkstra
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing849 Dijkstra求最短路 I | 40 | 22 | 3 |
| AcWing850 Dijkstra求最短路 II | 29 | 17 | 4 |
| ybt1379 热浪 | 22 | 14 | 5 |
| ybt1376 信使 | 27 | 14 | 5 |
| ybt1377 最优乘车 | 17 | 7 | 8 |
| ybt1345 香甜的黄油 | 30 | 8 | 7 |
| ybt1344 最小花费 | 12 | 7 | 9 |
| ybt1500 新年好 | 16 | 6 | 8 |
| ybt1496 架设电话线 | 3 | 3 | 10 |
| P1073 [NOIP 2009 提高组] 最优贸易 | 2 | 2 | 10 |
| P3008 [USACO11JAN] Roads and Planes G | 1 | 1 | 10 |
Section 7. bellman-ford
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing853 有边数限制的最短路 | 33 | 17 | 4 |
Section 8. spfa
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing851 spfa求最短路 | 22 | 13 | 5 |
| AcWing852 spfa判断负环 | 16 | 8 | 8 |
Section 11. Kruskal
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing859 Kruskal算法求最小生成树 | 22 | 5 | 8 |
Section 14. 图论
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| 1814 [GXOI/GZOI2019]旅行者 | 0 | 0 | (None) |
| P3037 [SDOI2012]拯救小云公主 | 2 | 1 | 10 |
| P3038 [HNOI2015]菜肴制作 | 0 | 0 | (None) |
| P3039 [NOI2008] 假面舞会 | 2 | 1 | 10 |
| P3040 负载平衡问题 | 0 | 0 | (None) |
| 1819 「一本通 4.4 练习 4」跳跳棋 | 0 | 0 | (None) |
| 1820 「一本通 4.5 练习 3」染色 | 0 | 0 | (None) |
| P3043 [省选联考 2021 A 卷] 矩阵游戏 | 0 | 0 | (None) |
| P3055 [NOI2018] 归程 | 0 | 0 | (None) |
| P3056 [USACO06JAN]The Cow Prom S | 0 | 0 | (None) |
| 1824 「一本通 3.5 例 1」受欢迎的牛 | 2 | 1 | 10 |
| P3057 [USACO03FALL / HAOI2006] 受欢迎的牛 G | 0 | 0 | (None) |
| NOIPS2018C 赛道修建 | 0 | 0 | (None) |
| P3047 [HNOI2015]开店 | 0 | 0 | (None) |
| P3050 【模板】树上 k 级祖先 | 0 | 0 | (None) |
| P3045 [NOIP2016 提高组] 天天爱跑步 | 0 | 0 | (None) |
| P3049 [NOI2015] 软件包管理器 | 0 | 0 | (None) |
| P3051 [POI2015] ODW | 0 | 0 | (None) |
| P3048 [NOIP2018 提高组] 保卫王国 | 0 | 0 | (None) |
| P3052 [WC2010] 重建计划 | 0 | 0 | (None) |
| NOIPS2018D 旅行 | 0 | 0 | (None) |
| P3053 [IOI2008] Island | 0 | 0 | (None) |
- Enrollees
- 92
- Created By