逃跑(escape)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
#include<ctime>
#include<vector>
using namespace std;
int n,m,a,src,des;
struct node
{
    int next,to;
    long long dis,dis2;
}edge[400001];
int head[20001],size=1;
int b[20001];//蝙蝠所在点 
long long v1[20001];//各点到终点 
long long v2[20001];//二小姐到各点 
long long v3[20001];
void putin(int from,int to,long long dis,long long dis2)
{
    size++;
    edge[size].next=head[from];
    edge[size].to=to;
    edge[size].dis=dis;
    edge[size].dis2=dis2;
    head[from]=size;
}
void in(int from,int to,long long dis,long long dis2)
{
    putin(from,to,dis,dis2);
    putin(to,from,dis,dis2);
}
void bfs1()
{
    memset(v1,127/3,sizeof(v1));
    int front=0,tail=0,i,j;
    int p[20001],vis[20001]={0};
    p[tail++]=des;
    v1[des]=0;
    vis[des]=1;
    while(front!=tail)
    {
        int x=p[front++];
        front%=20000;
        vis[x]=0;
        for(i=head[x];i!=-1;i=edge[i].next)
        {
            int y=edge[i].to;
            if(v1[y]>v1[x]+edge[i].dis)
            {
                v1[y]=v1[x]+edge[i].dis;
                if(!vis[y])
                {
                    vis[y]=1;
                    p[tail++]=y;
                    tail%=20000;
                }
            }
        }
    }
}
void bfs2()
{
    memset(v2,127/3,sizeof(v2));
    int front=0,tail=0,i,j;
    int p[20001],vis[20001]={0};
    p[tail++]=src;
    v2[src]=0;
    vis[src]=1;
    while(front!=tail)
    {
        int x=p[front++];
        front%=20000;
        vis[x]=0;
        for(i=head[x];i!=-1;i=edge[i].next)
        {
            int y=edge[i].to;
            if(v2[y]>v2[x]+edge[i].dis2)
            {
                v2[y]=v2[x]+edge[i].dis2;
                if(!vis[y])
                {
                    vis[y]=1;
                    p[tail++]=y;
                    tail%=20000;
                }
            }
        }
    }
}
void bfs3()
{
    memset(v3,128,sizeof(v3));
    int front=0,tail=0,i,j;
    int p[20001],vis[20001]={0};
    for(i=1;i<=a;i++)
    {
        p[tail++]=b[i];
        v3[b[i]]=v1[b[i]];
        vis[b[i]]=1;
    }
    while(front!=tail)
    {
        int x=p[front++];
        front%=20000;
        vis[x]=0;
        for(i=head[x];i!=-1;i=edge[i].next)
        {
            int y=edge[i].to;
            if(v3[y]<v3[x]-edge[i].dis)
            {
                v3[y]=v3[x]-edge[i].dis;
                if(!vis[y])
                {
                    vis[y]=1;
                    p[tail++]=y;
                    tail%=20000;
                }
            }
        }
    }
}
long long ans,ans1;
int main()
{
    memset(head,-1,sizeof(head));
    int i,j;
    scanf("%d%d%d%d%d",&n,&m,&a,&src,&des);
    for(i=1;i<=a;i++)
        scanf("%d",&b[i]);
    for(i=1;i<=m;i++)
    {
        int from,to;long long dis,dis2;
        scanf("%d%d%lld%lld",&from,&to,&dis,&dis2);
        in(from,to,dis,dis2);
    }
    bfs1();bfs2();bfs3();
    ans+=v2[des];
    for(i=1;i<=a;i++)
        ans+=v1[b[i]];
    ans1=ans;
    for(i=1;i<=n;i++)
    {
        ans1=min(ans1,ans-v2[des]+v2[i]+v1[i]-v3[i]);
    }
    cout<<ans1;
    return 0;
}