HDU 2680 Choose the best route

Choose the best route

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

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

Author

dandelion

题解:这几天最短路径刷的我真的。。。

1、基本上都有一个相同的坑，给两条相同的路，花费不一样。。。（需要单独判断）

2、除了需要注意上面的坑，还有就是他的起点有多个，可以设置一个0到起点站的花费为0，然后在直接Dijkstra就过了，输入输出最好用c的，c++的要超时。

下面是AC代码：

#include"iostream"
#include"cstring"
#define MAX 0xfffffff

using namespace std;

int map[1007][1007];
int dis[1007];
bool flag[1007];
int n,m,s,w,t;

void Dijkstra(int start)
{
	memset(flag,false,sizeof(flag));
	flag[start]=true;
	for(int i=1;i<=n;i++) dis[i]=map[start][i];
	for(int i=1;i<=n;i++)
	{
		int minn=MAX;
		for(int j=1;j<=n;j++)
		{
			if(!flag[j] && dis[j]<minn)
			{
				minn=dis[j];
				start=j;
			}
		}
		if(minn == MAX) break;
		flag[start]=true;
		for(int j=1;j<=n;j++)
			if(!flag[j] && dis[j] > dis[start]+map[start][j])
				dis[j]=dis[start]+map[start][j];	
	}
}
int main()
{
	while(~scanf("%d%d%d",&n,&m,&s))
	{
		for(int i=0;i<=n;i++)
			for(int j=0;j<=n;j++)
					map[i][j]=MAX;
		while(m--)
		{
			int a,b,c;
			scanf("%d%d%d",&a,&b,&c);
			if(c<map[a][b])
				map[a][b]=c;
		}
		scanf("%d",&t);
		while(t--)
		{
			int start;
			scanf("%d",&start);
			map[0][start]=0;
		}
		Dijkstra(0);
		if(dis[s]!=MAX) printf("%d\n",dis[s]);
		else printf("-1\n");
	}
	return 0;
}