hdu2066最短路

过几天就要去打区域赛了，虽然本人很渣但上一届还是把机会给我了，我已经感觉到了没人看好我，不说别的了，将来一定要用实力教育他们，这次我负责图论专题，先来第一发，一定要争气啊
—模版题不解释了

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <iostream>
#include <algorithm>
using namespace std;
int Time[1010][1010],t,s,d,i,j,k,wantPlace[2000],linkPlace,sta,en,toTime,small,timeAll[1010][1010];
const int maxTime = 1033333333;
int dijkstra()
{
  int shortTime = maxTime,shortest,color[1010] = {0};
  for(i=1;i<=1000;i++)
  {
      shortTime = maxTime;
     for(j=1;j<=1000;j++)
     {
         if(color[j]==0&&timeAll[0][j]<shortTime)
         {
             shortest = j;
             shortTime = timeAll[0][j];
         }
     }
     color[shortest] = 1;
     for(j=1;j<=1000;j++)
     {
         if(timeAll[0][j]>timeAll[0][shortest]+Time[shortest][j])
            timeAll[0][j] = timeAll[0][shortest]+Time[shortest][j];
     }
  }
  small = timeAll[0][wantPlace[0]];
  for(i=1;i<d;i++)
        if(small>timeAll[0][wantPlace[i]])small = timeAll[0][wantPlace[i]];
   return small;
}
int main()
{
    while(scanf("%d%d%d",&t,&s,&d)!=EOF)
    {
        for(i=0; i<=1005; i++)
         for(j=0; j<=i; j++)
        {
          if(i==j)Time[i][j] = 0;
          else Time[i][j] = Time[j][i] = maxTime;
        }
        for(i=0; i<=1005; i++)
         for(j=0; j<=i; j++)
        {
          if(i==j)timeAll[i][j] = 0;
          else timeAll[i][j] = timeAll[j][i] = maxTime;
        }
        while(t--)
        {
            scanf("%d%d%d",&sta,&en,&toTime);
            if(toTime<Time[sta][en]){
                Time[sta][en] = toTime;
                Time[en][sta] = toTime;
            }
        }
        while(s--)
        {
            scanf("%d",&linkPlace);
            timeAll[0][linkPlace] = timeAll[linkPlace][0] = 0;
            Time[0][linkPlace] = Time[linkPlace][0] = 0;
        }
        for(i=0; i<d; i++)
        scanf("%d",&wantPlace[i]);
        small = dijkstra();
        printf("%d\n",small);
    }
    return 0;
}