hdu2680(Dijkstra+单源最短路径)

Choose the best route

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5038    Accepted Submission(s): 1598

Problem Description

One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.

 

Input

There are several test cases.
Each case begins with three integers n, m and s,(n<1000,m<20000,1=<s<=n) n stands for the number of bus stations in this city and m stands for the number of directed ways between bus stations .(Maybe there are several ways between two bus stations .) s stands for the bus station that near Kiki’s friend’s home.
Then follow m lines ,each line contains three integers p , q , t (0<t<=1000). means from station p to station q there is a way and it will costs t minutes .
Then a line with an integer w(0<w<n), means the number of stations Kiki can take at the beginning. Then follows w integers stands for these stations.

 

Output

The output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.

 

Sample Input

  
  

   
   5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1
  
  

 

Sample Output

  
  

   
   1
-1
  
  
  
  

   
    
  
  
  
  

   
   本题是个比较裸的段元最短距离，虽然是有向边且有多个起点，一个终点；
  
  
  
  

   
   可以将边反向，转化成一个起点，多个终点，求单源最短路径
  
  
  
  

   
    
  
  
  
  

   
   
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;


//*****************************************************************
#define INF 0x3f3f3f3f
#define Max 1000+10
int n;//表示顶点数目
int dis[Max];//dis数组表示源点到各点的距离
int g[Max][Max];//用邻接矩阵g[][]存放图的边
bool visited[Max];//标记原点到该点的最短距离是否找到
//开始应初始化memset(g, INF, sizeof(g));
int start[Max];

void Dijkstra(int start)
{
	int temp,k,i,j;
	memset(visited,false,sizeof(visited));
	for(i=1;i<=n;++i)
		dis[i]=g[start][i];
	dis[start]=0;
	visited[start]=1;
	for(i=1;i<=n;++i)
	{
		temp=INF;
		for(int j=1;j<=n;++j)
			if(!visited[j]&&temp>dis[j])
				temp=dis[k=j];
		if(temp==INF)break;
		visited[k]=1;
		for(j=1;j<=n;++j)
			if(!visited[j]&&dis[j]>dis[k]+g[k][j])
				dis[j]=dis[k]+g[k][j];
	}
}
//*****************************************************************


int main()
{
	int m,s,i,ans;
	int a,b,t,cnt_n;
	while(~scanf("%d%d%d",&n,&m,&s))
	{
		memset(g,INF,sizeof(g));
		for(i=0;i<m;i++)
		{
			scanf("%d%d%d",&a,&b,&t);
			if(t<g[b][a])
				g[b][a]=t;
		}

		scanf("%d",&cnt_n);
		Dijkstra(s);
		ans=INF;
		for(i=0;i<cnt_n;i++)
		{
			scanf("%d",&start[i]);
			if(dis[start[i]]<ans)
				ans=dis[start[i]];
		}
		if(INF==ans)
			printf("-1\n");
		   else
			   printf("%d\n",ans);
	}
	return 0;
}