hdu2680—Choose the best route（spfa）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2680

Choose the best route

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

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
  
  

题目大意：给你一张图，多个起点，一个终点，问起点到终点的最短距离

解题思路：以终点为起点，起点作为终点，跑spfa，切记是路径是单向的，反向建图

#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <iostream>  
#include <queue>
#include <set>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
using namespace std;  
typedef long long ull;
const int N = 1008;
const int M = 20800;
const int INF = 0x3fffffff;
const double Pi = acos(-1.0);

struct Edge{  
	int node,len;  
	Edge*next;  
}m_edge[M*2];  
Edge*head[N];  
int Ecnt,dist[N],vis[N];  

void init()  
{  
	Ecnt = 0;  
	fill( head , head+N , (Edge*)0 );  
}  

void mkEdge( int a , int b , int c )  
{  
	m_edge[Ecnt].node = b;  
	m_edge[Ecnt].len = c;  
	m_edge[Ecnt].next = head[a];  
	head[a] = m_edge+Ecnt++;  
}  

void spfa( int n )  
{  
	fill( dist , dist+N , INF );  
	fill( vis , vis+N , 0 );  
	queue<int>point;  
	point.push(n);  
	vis[n] = 1;  
	dist[n] = 0;  
	while( !point.empty() ){  
		int s = point.front();  
		point.pop();  
		vis[s] = 0;  
		for( Edge*p = head[s] ; p ; p = p->next ){  
			int t = p->node;  
			if( dist[t] > dist[s]+p->len ){  
				dist[t] = dist[s]+p->len;  
				if( !vis[t] ){  
					point.push(t);  
					vis[t] = 1;  
				}  
			}  
		}  
	}  
}  

int main()
{
	int n,m,s;
	while( ~scanf("%d%d%d",&n,&m,&s) ){
		init();
		int a,b,c;
		for( int i = 0 ; i < m ; ++i ){
			scanf("%d%d%d",&a,&b,&c);
			mkEdge( b , a , c );
		}
		spfa(s);
		int w,ans = INF;
		scanf("%d",&w);
		for( int i = 0 ; i < w ; ++i ){
			scanf("%d",&a);
			ans = min( ans , dist[a] );
		}
		if( ans != INF ) printf("%d\n",ans);
		else printf("%d\n",-1);
	}
	return 0;
}