最短路 || HDU 2066 一个人的旅行

本草的旅行故事(✺ω✺)，可以从S个点中的任意一个开始，到达D个点中的任意一个，求最短路

*解法：把草儿的家记成点0，S个点与0的距离为0，然后spfa求最短路

又是改了一万次，①多组数据啊 ②改完多组数据记得加初始化啊 ③无向图反着也要建啊

脑子可能被我丢在被窝里了zzzzZ

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <queue>
 using namespace std;
 #define SZ 20005
 #define INF 1e9+10
 int head[SZ],nxt[SZ],tot = ;
 struct edge
 {
     int t,d;
 }l[SZ];
 void build(int f,int t,int d)
 {
     l[++tot] = (edge){t,d};
     nxt[tot] = head[f];
     head[f] = tot;
 }
 queue<int> q;
 bool use[SZ];
 int dist[SZ];
 void spfa(int s)
 {
     memset(dist, , sizeof(dist));
     memset(use, , sizeof(use));
     use[s] = ;
     dist[s] = ;
     q.push(s);
     while(!q.empty())
     {
         int u = q.front(); q.pop();
         use[u] = ;
         for(int i = head[u];i;i = nxt[i])
         {
             int v = l[i].t;
             if(dist[v] > dist[u] + l[i].d)
             {
                 dist[v] = dist[u] + l[i].d;
                 if(!use[v])
                     use[v] = , q.push(v);
             }
         }
     }
     return;
 }
 int main()
 {
     int T, S, D;
     while(scanf("%d %d %d", &T, &S, &D) != EOF)
     {
         memset(head, , sizeof(head));
         tot = ;
         for(int i = ; i < T; i++)
         {
             int x, y, z;
             scanf("%d %d %d", &x, &y, &z);
             build(x, y, z);
             build(y, x, z);
         }
         for(int i = ;i < S; i++)
         {
             int x;
             scanf("%d", &x);
             build(, x, );
             build(x, , );//反着也要建
         }
         spfa();
         int minn = INF;
         for(int i = ; i < D; i++)
         {
             int ed;
             scanf("%d", &ed);
             minn = min(minn, dist[ed]);
         }
         printf("%d\n", minn);
     }
     return ;
 }