| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 10542 | 10542 NOIP201304车站分级 | 1 / 3 | 10 | |
| 11191 | 11191 【模板】Dijkstra-最短路 | 14 / 52 | 7 | |
| 11192 | 11192 旅游花费 | 3 / 7 | 10 | |
| 11197 | 11197 农场派对 | 5 / 12 | 9 | |
| 11244 | 11244 病毒 | 4 / 8 | 10 | |
| 11246 | 11246 分糖果 | 4 / 19 | 9 | |
| 11247 | 11247 信息学社团 | 14 / 44 | 6 | |
| 11299 | 11299 最短路径问题 | 10 / 18 | 7 | |
| 11301 | 11301 【模板】单源最短路(弱化版) | 14 / 26 | 5 | |
| 11312 | 11312 香甜的黄油 | 5 / 9 | 9 | |
| 11313 | 11313 信使 | 7 / 10 | 9 | |
| 11318 | 11318 【模板】拓扑排序 / 家谱树 | 0 / 2 | 10 | |
| 11384 | 11384 最优乘车 | 1 / 1 | 10 | |
| 16160 | 16160 地铁 | 1 / 1 | 10 |
By signing up a 算道OJ universal account, you can submit code and join discussions in all online judging services provided by us.