ACwing链接:https://www.acwing.com/problem/content/1139/
题目分析:已知是从多个起点到一个终点,首先想到的是我们可不可以做多次最短路算法,可仔细分析后发现这样效率很低
惯用套路是我们可以创建一个虚拟源点,这个虚拟源点到多个起点的距离都是0,这样我们还是从同一个源点出发
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n,m,s,x,cnt;
const int N = 50010;
int e[N],ne[N],h[N],w[N],idx;
int dist[N],st[N];
void add(int a,int b,int c)
{
e[idx] = b,w[idx] = c,ne[idx] = h[a],h[a] = idx++;
}
int spfa()
{
memset(dist,0x3f3f3f3f,sizeof dist);
memset(st,0,sizeof st);
dist[0] = 0;
queue<int>q;
q.push(0);
st[0] = 1;
while(q.size())
{
int t = q.front();
q.pop();
st[t] = 0;
for(int i=h[t];~i;i=ne[i])
{
int j = e[i];
if(dist[j]>dist[t]+w[i])
{
dist[j] = dist[t]+w[i];
if(!st[j])
{
st[j] = 1;
q.push(j);
}
}
}
}
return dist[s];
}
int main()
{
while(~scanf("%d %d %d",&n,&m,&s))
{
memset(h,-1,sizeof h);
while(m--)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
}
cin>>cnt;
while(cnt--)
{
cin>>x;
add(0,x,0);
}
int t = spfa();
if(t==0x3f3f3f3f) cout<<-1<<endl;
else cout<<t<<endl;
}
return 0;
}