P2176 [USACO14FEB]路障Roadblock

analysis

DIJ先求一个最短路
然后暴力枚举最短路径上的每条边将边权double,然后再跑最短路,最后取最大值

code

#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define ll long long
template<typename T>void read(T &x){
    x=0;char r=getchar();T neg=1;
    while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
    while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
    x*=neg;
}

int n,m;
const int maxn=100+10;
const int maxm=5000+10;
struct node{
	int e;
	ll w;
	int nxt;
}edge[maxm<<1];
int head[maxn];
int cnt=0;
inline void addl(int u,int v,ll w){
	edge[cnt].e=v;
	edge[cnt].w=w;
	edge[cnt].nxt=head[u];
	head[u]=cnt++;
}

struct point{
	int pos;
	ll dis;
	point():pos(0),dis(0){}
	point(int pos,int dis):pos(pos),dis(dis){}
	friend bool operator <(point a,point b){
		return a.dis>b.dis;
	}
};
priority_queue<point>q;
ll dis[maxn];
int path[maxn];
int pre[maxn];
inline ll dijkstra(int S,int T,int che){
	clean(dis,0x3f);
	dis[S]=0;
	q.push(point(S,0));
	while(q.empty()==false){
		point f=q.top();
		q.pop();
		for(int i=head[f.pos];i!=-1;i=edge[i].nxt){
			int v=edge[i].e;
			if(dis[v]>dis[f.pos]+edge[i].w){
				dis[v]=dis[f.pos]+edge[i].w;
				q.push(point(v,dis[v]));
				if(che==1)
					path[v]=f.pos,
					pre[v]=i;
			}
		}
	}
	return dis[T]>=0x3f3f3f3f3f3f3f3f-10?-1:dis[T];
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("datain.txt","r",stdin);
	#endif
	clean(head,-1);
	clean(path,-1);
	
	read(n);
	read(m);
	register int ui,vi;
	register ll wi;
	loop(i,1,m){
		read(ui);
		read(vi);
		read(wi);
		addl(ui,vi,wi);
		addl(vi,ui,wi);
	}
	ll res1=dijkstra(1,n,1);
	
	ll res2=0,ans=0;
	for(int i=n;i!=-1;i=path[i]){
		int j=pre[i];
		if(edge[j].e==i){
			edge[j].w*=2;
			res2=dijkstra(1,n,2);
			ans=max(ans,res2);
			edge[j].w/=2;
		}
	}
	printf("%lld\n",ans-res1);
	/*
	for(int i=n;i!=-1;i=path[i])
		printf("%d\n",i),
		printf("^\n"),
		printf("|\n"),
		printf("|\n"),
		printf("|\n"),
		printf("|\n"),
		printf("|\n");*/
	return 0;
}