ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
3314 | B200 最小花费 | 0 / 0 | 5 | |
3879 | B201 带负权的单源最短路 | 0 / 0 | 5 | |
3313 | H95 热浪 | 1 / 1 | 5 | |
3315 | H97 香甜的黄油 | 0 / 0 | 5 | |
3324 | H107 最短路径问题 | 2 / 6 | 5 | |
3325 | H108 信使 | 0 / 0 | 5 | |
3372 | H156 [NOI1997] 最优乘车 | 0 / 0 | 5 | |
3373 | H157 牛的旅行 | 0 / 0 | 5 | |
3380 | H164 新年好 | 1 / 1 | 5 | |
3711 | H505 医院设置 | 0 / 0 | 1 | |
3737 | H532 弗洛伊德最短路径算法【模板】 | 0 / 0 | 1 | |
3773 | H569 格式化输出最短路径 | 1 / 1 | 1 | |
3775 | H571 分糖果 | 0 / 0 | 5 | |
3776 | H572 城市路 | 1 / 6 | 5 | |
3777 | H573 刻录光盘 | 0 / 0 | 5 | |
3778 | H574 珍珠 | 0 / 0 | 5 | |
3934 | H756 城市交通 | 0 / 0 | 5 | |
1898 | P1898 旅行者 | 0 / 0 | (None) | |
4060 | P4060 城市交通 | 1 / 1 | 5 |
By signing up a 黑猫OJ universal account, you can submit code and join discussions in all online judging services provided by us.