Choose the best route--hdu2680

Choose the best route

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

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

 

 

 

很明显的要用dijkstra，但是估计大家用一般的方法建图的时候都会超时吧，因为起点不止一个，起点多就要多次调用函数，因此超时！

倒不如反向建图，变成一个起点，多个终点！

另外注意：公车车是单向的！

 

 

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #define MAX 0x3f3f3f3f
 5 using namespace std;
 6 int map[1010][1010],d[1010],n,m,s,t;
 7 void dijkstra(int x)
 8 {
 9     int i,j,min,mark,used[1010];
10     for(i=1;i<=n;i++)
11     {
12         used[i]=0;
13         d[i]=map[x][i];
14     }
15     d[x]=0;
16     used[x]=1;
17     for(i=1;i<=n;i++)
18     {
19         min=MAX;
20         mark=-1;
21         for(j=1;j<=n;j++)
22         {
23             if(!used[j]&&d[j]<min)
24             {
25                 min=d[j];
26                 mark=j;
27             }
28         }
29         if(mark==-1)
30         break;
31         used[mark]=1;
32         for(j=1;j<=n;j++)
33         {
34             if(!used[j]&&d[j]>d[mark]+map[mark][j])
35             d[j]=d[mark]+map[mark][j];
36         }
37     }
38 
39 }
40 int main()
41 {
42     int a,b,c,i,j;
43     while(scanf("%d%d%d",&n,&m,&s)!=EOF)
44     {
45         memset(map,MAX,sizeof(map));
46         for(i=0;i<m;i++)
47         {
48             scanf("%d%d%d",&a,&b,&c);
49             if(map[b][a]>c)
50             map[b][a]=c;
51         }
52         dijkstra(s);//调用一次
53         int start;
54         int mi=MAX;
55         scanf("%d",&t);
56         for(i=0;i<t;i++)//找出最小的花费
57         {
58             scanf("%d",&start);
59             mi=mi<d[start]?mi:d[start];
60         }
61         if(mi==MAX)
62         printf("-1\n");
63         else
64         printf("%d\n",mi);
65     }
66 return 0;
67 }

 

转载于:https://www.cnblogs.com/Eric-keke/p/4739449.html