首先用bfs跑出s层以内的危险城市,然后就可以dijkstra了
注意开long long 还有初值要够大
代码
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
typedef pair <long long ,int> PIL;
int n,m,k,s;
int p,q;
int flag[maxn],vis[maxn],head[maxn],cnt;
long long dis[maxn];
struct point
{
int u,dis;
};
struct edge
{
int to,nxt;
}e[maxn<<2];
queue <point> que;
void add(int x,int y)
{
e[++cnt].to=y;
e[cnt].nxt=head[x];
head[x]=cnt;
}
void bfs()
{
while(!que.empty())
{
int u=que.front().u;
int dis=que.front().dis;
que.pop();
for(int i=head[u];i;i=e[i].nxt)
{
int to=e[i].to;
if(dis<s && flag[to]==1)
{
flag[to]=0;
que.push((point){to,dis+1});
}
}
}
}
void dijkstra()
{
for(int i=2;i<=n;i++) dis[i]=1e18;
priority_queue <PIL,vector<PIL>,greater<PIL> > Q;
Q.push((PIL){0,1});
while(!Q.empty())
{
int u=Q.top().second;
Q.pop();
if(vis[u]) continue;
vis[u]=true;
for(int i=head[u];i;i=e[i].nxt)
{
int to=e[i].to;
if(flag[to]==-1) continue;
if(!flag[to])
if(dis[to]>dis[u]+q)
{
dis[to]=dis[u]+q;
Q.push((PIL){dis[to],to});
}
if(flag[to]==1)
if(dis[to]>dis[u]+p)
{
dis[to]=dis[u]+p;
Q.push((PIL){dis[to],to});
}
}
}
}
int main()
{
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
scanf("%d%d%d%d%d%d",&n,&m,&k,&s,&p,&q);
for(int i=1;i<=n;i++) flag[i]=1;
int x,y;
for(int i=1;i<=k;i++)
{
scanf("%d",&x);
que.push((point){x,0});
flag[x]=-1;
}
for(int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
add(x,y); add(y,x);
}
bfs();
dijkstra();
if(!flag[n]) dis[n]-=q;
else dis[n]-=p;
printf("%lld",dis[n]);
return 0;
}