求最短路后面不用判断是否被访问过
```cpp
for(int j=1;j<=n;j++){
if(dis[j]>dis[i]+sq[i][j]){
dis[j]=dis[i]+sq[i][j];
}
}
```
by C20252323tzy @ 2023-08-07 19:00:20
@[Luxe877](/user/519986) 首先，第25到27行里面所有的`i`都要换成`ptr`，不然你求这个`ptr`是没有意义的。其次，要在输入`sq`数组前将`sq`数组全部设定为`0x3f3f3f3f`。改完就AC了
by ninghaotian @ 2023-08-07 19:02:13
@[C20252323tzy](/user/770611) 谢谢大佬（$n≤200$的数据量没必要用堆优化吧）
by Luxe877 @ 2023-08-07 19:03:13
@[Luxe877](/user/519986) 确实
by C20252323tzy @ 2023-08-07 19:04:35
@[ninghaotian](/user/927858) 感谢大佬，已[AC](https://www.luogu.com.cn/record/119534323)
此贴结
by Luxe877 @ 2023-08-07 19:06:04