Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7745 Accepted Submission(s): 2572
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.
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
解体思路:先设置一个虚拟起点,让它到真正起点的距离为0,到其他点的距离为无穷大,这样就转化为:求从虚拟起点到终点的最短路径。
用的模板是正刚给讲的,超级好记,和prim的模板基本一样 ,膜拜大神啊!!!
#include<stdio.h>
#include<string.h>
#define INF 0x3f3f3f3f
#define maxn 1010
int map[maxn][maxn];
int dist[maxn];
bool vis[maxn];
int n,s;
int getnext(){
int pos=-1, dis=INF,i;
for(i=1;i<=n;++i)
if(!vis[i] && dist[i]<dis){
dis=dist[i];pos=i;
}
return pos;
}
void Dijkstra()
{
int i,u,sum;
for(i=0;i<=n;++i){
vis[i]=0;dist[i]=INF;
}
u=0;dist[0]=0;
while(u!=-1){
vis[u]=true;
for(i=0;i<=n;++i){
sum=dist[u]+map[u][i];
if(sum<dist[i])
dist[i]=sum;
}
if(vis[s])
return ;
u=getnext();
}
}
int main (){
int m,w,i,a,b,c,k;
while(scanf("%d%d%d",&n,&m,&s)==3){
memset(map,0x3f3f3f3f,sizeof(map));
memset(vis,0,sizeof(vis));
for(i=0;i<m;++i){
scanf("%d%d%d",&a,&b,&c);
if(c<map[a][b]) map[a][b]=c;
}
scanf("%d",&w);
while(w--){
scanf("%d",&k);
map[0][k]=0;//本题的精髓
}
Dijkstra();
if(dist[s]==INF)
printf("-1\n");
else
printf("%d\n",dist[s]);
}
return 0;
}