大家能帮忙看一下吗，谢谢
by GaryH @ 2020-02-05 17:09:09
问一个问题
`int main()`函数第9行（不含`int main()`）有错误......
by __polar_ice @ 2020-02-05 17:29:06
```cpp
for(int j=head[p];j!=-1;j=edge[j].next)
dis[edge[j].to]=std::min(dis[edge[j].to],dis[p]+edge[j].w);
```
改成
```cpp
for(int j=head[p];j!=-1;j=edge[j].next)
if(!b[edge[j].to])
dis[edge[j].to]=std::min(dis[edge[j].to],dis[p]+edge[j].w);
```
而且楼上的意见是对的，`scanf("%d%d%d",&u,&v);`多了一个`%d`
by Islauso @ 2020-02-05 17:54:50
@[GaryH](/user/100091) 你看一下这样改了之后行不行
by Islauso @ 2020-02-05 17:55:40
@[GaryH](/user/100091)
~~此题为何不用$Floyd？~~
by ZolaWatle @ 2020-02-05 18:21:49
@[远航TV四叶](/user/177531) 答曰：“$Floyd$甚菜，怎能凸显GaryH之巨，故以$Dijkstra$替之”
by Islauso @ 2020-02-05 18:51:42
@[xiaolin_](/user/183235) $ Dijkstra $甚菜，怎能凸显$ xiaolin $_之巨，故加$ priority $ _ $ queue $替之
by ZolaWatle @ 2020-02-05 19:44:29
@[远航TV四叶](/user/177531) 无端%人不可取~~我到现在单源最短路径（标准版）还没有过就是因为搞不懂priority_queue~~
by Islauso @ 2020-02-05 19:46:51
@[xiaolin_](/user/183235) fAKe！我连堆优化都不会orz
by ZolaWatle @ 2020-02-05 19:48:08
@[远航TV四叶](/user/177531) priority_queue差不多就是堆优化，听说优先队列就是用堆来实现的~~话说HX不是学了线段树吗？问问他学没学堆~~
by Islauso @ 2020-02-05 19:50:33