~~旅行怎么能不用O(n)算法呢？？？~~
加上这一坨试试——
```cpp
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
```
by Ouaoan @ 2018-12-06 21:28:14
~~别写tarjan了。。没必要的说~~
因为优先队列你这貌似是$O(n^2logn)$?可以提前vector排序来着。，。
其他的。。也许可以试一下全局i,j？
by 星小雨 @ 2018-12-06 21:29:13
@[渣儿](/space/show?uid=13117)
您可以看看我的提交记录。
~~为了卡常，这玩意我怎么可以不加上？~~
by RiverFun @ 2018-12-06 21:31:17
@[星小雨](/space/show?uid=20435) 好吧我试试
by RiverFun @ 2018-12-06 21:31:38
@[Steve_braveman](/space/show?uid=96570) vector只需要排序一次吧
~~(维护一个堆不是更慢吗)~~
by 爱撒谎的先生 @ 2018-12-06 21:33:45
看下我的，我只跑了几百多ms
@[Steve_braveman](/space/show?uid=96570)
by 桑树下的邂逅 @ 2018-12-06 21:38:12
@[渣儿](/space/show?uid=13117) 这一坨是干什么的
by Yoo_ @ 2018-12-06 21:41:58
出现了：玄学优化怪
by Jameswood @ 2018-12-06 21:44:13