一直没想到怎么做因为复杂度标程也是卡过去的估计= =
如果按照一条直线出数据的话那就是
20 * (5e4 + 1000) * (5e4 + 1000) / 2 * log(5e4)
很明显爆掉了。。。
但是事实就是只要遍历最短路的就完事了
#include<iostream>
#include<cstring>
#include<utility>
#include<queue>
#define x first
#define y second
using namespace std;
const int N = 1e3 + 10,M = 1e5 + 10;
int head[N],to[M],last[M],w[M],cnt,shang[M],sha[M];
void add(int a,int b,int c){
to[++cnt] = b;
w[cnt] = c;
last[cnt] = head[a];
head[a] = cnt;
}
typedef pair<int,int> PII;
int flag[N],dist[N];
void dij(int f){
memset(flag,0,sizeof flag);
memset(dist,0x3f,sizeof dist);
priority_queue<PII,vector<PII>,greater<PII> > q;
q.push({0,1});
dist[1] = 0;
while(q.size()){
PII p = q.top();
q.pop();
if(flag[p.y]) continue;
flag[p.y] = 1;
for(int i = head[p.y]; i != -1; i = last[i]){
int j = to[i];
if(dist[j] > dist[p.y] + w[i]){
dist[j] = dist[p.y] + w[i];
q.push({dist[j],j});
if(f){
shang[j] = p.y;
sha[j] = i;
}
}
}
}
}
int main(){
int t;
cin >> t;
while(t--){
int n,m;
cnt = 0;
memset(head,-1,sizeof head);
memset(shang,-1,sizeof shang);
scanf("%d%d",&n,&m);
for(int i = 1; i <= m; i++){
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
add(x,y,z);
add(y,x,z);
}
dij(1);
int minn = 0;
for(int i = n; i != -1; i = shang[i]){
int j = sha[i];
int g = w[j];
w[j] = 0x3f3f3f3f;
dij(0);
w[j] = g;
minn = max(minn,dist[n]);
}
if(minn != 0x3f3f3f3f) cout << minn << endl;
else cout << -1 << endl;
}
return 0;
}