wxh-b

wxh-b

细节比较多，主要思路就是转换为找最短路

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=5e5+5,M=1e5+5;//
int head[N],cnt=0,a,b,c,d,e,m;
struct edge{
	int link,v,l;
}q[M<<1];
void put(int u,int v,int w){
	q[++cnt].v=v;
	q[cnt].l=w;
	q[cnt].link=head[u];
	head[u]=cnt;
}
struct node{
	int id;
	ll val;
	bool operator <(const node &x)const{
	    return x.val<val;//
	}
};
priority_queue<node> myl;
ll dis[N];
int n;
bool vis[N];
ll dijkstra(int s,int t){//
	memset(vis,0,sizeof(vis));
	for(int i=0;i<=n;i++){dis[i]=1ll*N*N;}
	dis[s]=0;
    while(!myl.empty()) myl.pop();
	myl.push((node){s,dis[s]});
    while(!myl.empty()) {
    	node ssx=myl.top();myl.pop();int ss=ssx.id;vis[ss]=1;
    	if(ss==t){//
    		return dis[t];
		}
    	for(int i=head[ss];i;i=q[i].link){
    		int v=q[i].v;
    		if(vis[v]) continue;
    		if(dis[v]>dis[ss]+1ll*q[i].l){
    		dis[v]=dis[ss]+1ll*q[i].l;
    		myl.push((node){v,dis[v]});
    		}
		}
	}
}
int main(){
	scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
	scanf("%d",&m);
	for(int i=1;i<=m;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		int w=v-u+1;
		put(u-1,v,w),put(v,u-1,w);
	}
	n=a+b+c+d+e;
	int x=a,xx=a+b,y=a+b+c,yy=a+b+c+d;
	ll tmp1=dijkstra(x,xx);
	ll tmp2=dijkstra(x,y);
	ll tmp3=dijkstra(x,yy);
	ll tmp4=dijkstra(xx,yy);
	ll tmp5=dijkstra(y,yy);
	ll tmp6=dijkstra(xx,y);
	ll ans=min(tmp1+tmp5,tmp2+tmp4);
	ans=min(ans,tmp3+tmp6);
	if(ans>=1ll*N*N||ans<=0) puts("-1"); 
	else printf("%lld",ans);
}