题意传送门:
一道最短路
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
inline ll read()
{
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,m,cnt,s,t1,t2;
int last[100005],q[100005],dis[100005];
bool inq[100005];
struct data{int to,next,v;}e[400005];
void ins(int u,int v,int w)
{
e[++cnt].to=v;e[cnt].next=last[u];last[u]=cnt;e[cnt].v=w;
}
void insert(int u,int v,int w)
{
ins(u,v,w);ins(v,u,w);
}
void spfa(int x)
{
memset(dis,127/3,sizeof(dis));
q[0]=x;inq[x]=1;dis[x]=0;
int head=0,tail=1;
while(head!=tail)
{
int now=q[head];head++;
if(head==100001)head=0;
for(int i=last[now];i;i=e[i].next)
if(dis[now]+e[i].v<dis[e[i].to])
{
dis[e[i].to]=dis[now]+e[i].v;
if(!inq[e[i].to])
{
inq[e[i].to]=1;
if(dis[e[i].to]<dis[q[head]])
{
head--;if(head<0)head=100000;
q[head]=e[i].to;
}
else
{
q[tail++]=e[i].to;
if(tail==100001)tail=0;
}
}
}
inq[now]=0;
}
}
int main()
{
m=read();n=read();s=read();t1=read();t2=read();
for(int i=1;i<=m;i++)
{
int u=read(),v=read(),w=read();
insert(u,v,w);
}
spfa(t1);
int ans=dis[s]+dis[t2];
spfa(t2);
printf("%d",min(ans,dis[s]+dis[t1]));
return 0;
}