hdu 2066

题目链接

把草儿所在的位置记为0，相邻的城市的权值记为0，一次dij求出想去的里面最小的那个就是答案

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string.h>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int maxn =5e4+5;
const int maxm=10000;
const int mod =1e9+7;
const int INF=0x3f3f3f3f;
const double eps=1e-8;
const int MAXN=1000010;
struct qnode
{
    int v;
    int c;
    qnode(int _v=0,int _c=0):v(_v),c(_c){}
    bool operator <(const qnode &r)const
    {
        return c>r.c;
    }
};
struct Edge
{
    int v,cost;
    Edge(int _v=0,int _cost=0):v(_v),cost(_cost){}
};
vector <Edge> E[MAXN];
bool vis[MAXN];
int dist[MAXN];
void Dijkstra(int n,int start)
{
    memset(vis,false,sizeof(vis));
    for(int i=1;i<=n;i++)dist[i]=INF;
    priority_queue<qnode>que;
    while(!que.empty())que.pop();
    dist[start]=0;
    que.push(qnode(start,0));
    qnode tmp;
    while(!que.empty())
    {
        tmp=que.top();
        que.pop();
        int u=tmp.v;
        if(vis[u]) continue;
        vis[u]=true;
        for(int i=0;i<E[u].size();i++)
        {
            int v=E[tmp.v][i].v;
            int cost=E[tmp.v][i].cost;
            if(!vis[v]&&dist[v]>dist[u]+cost)
            {
                dist[v]=dist[u]+cost;
                que.push(qnode(v,dist[v]));
            }
        }
    }
}
int main()
{
    int t,s,d;
    while(scanf("%d%d%d",&t,&s,&d)!=EOF)
    {
        for(int i=0;i<maxn;i++)
            E[i].clear();
        int nn=0;
        for(int i=1;i<=t;i++)
        {
        int u,v,w;scanf("%d%d%d",&u,&v,&w);
        nn=max(nn,max(u,v));
        E[u].push_back(Edge(v,w));
        E[v].push_back(Edge(u,w));
       }
    for(int i=0;i<s;i++)
    {
        int pp;scanf("%d",&pp);
        E[0].push_back(Edge(pp,0));
        E[pp].push_back(Edge(0,0));
    }
    Dijkstra(nn,0);
    int ans=INF;
    for(int i=0;i<d;i++)
    {
        int mm;scanf("%d",&mm);
        int vis=dist[mm];
        ans=min(ans,vis);
    }
    printf("%d\n",ans);
    }
    return 0;
}