Choose the best route
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10690Accepted Submission(s): 3454
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 51 2 21 5 31 3 42 4 72 5 62 3 53 5 14 5 122 34 3 41 2 31 3 42 3 211
Sample Output
1-1
Author
dandelion
Source
2009浙江大学计算机研考复试（机试部分）——全真模拟
思路：
SPFA算法+反向建图+邻接表+队列
代码：
//这一道题要记住是反向建图！否则会超时！ #include <stdio.h>#include <string.h>#include <queue>#include <iostream>#include <algorithm>#define INF 0x3f3f3f3fusing namespace std;int n,m,s;int edgenum;int head[40005];int dis[1005];int vis[1005];void init(){edgenum=0;memset(head,-1,sizeof(head));}struct Edge{int from,to,val,next;}edge[40005];void addedge(int u,int v,int w){Edge E={u,v,w,head[u]};edge[edgenum]=E;head[u]=edgenum++; }void getmap(){int a,b,c;for(int i=1;i<=m;i++)//这一道题要记住是反向建图！ {scanf("%d%d%d",&a,&b,&c);addedge(b,a,c);}}void SPFA(){queue<int>q;q.push(s);memset(dis,INF,sizeof(dis));memset(vis,0,sizeof(vis));dis[s]=0;vis[s]=1;while(!q.empty()){int u=q.front();q.pop();vis[u]=0;for(int i=head[u];i!=-1;i=edge[i].next){int v=edge[i].to;if(dis[v]>dis[u]+edge[i].val){dis[v]=dis[u]+edge[i].val;if(vis[v]==0){vis[v]=1;q.push(v);}}}}}int main(){while(scanf("%d%d%d",&n,&m,&s)!=EOF){init();getmap();SPFA();int sx,min=INF,x;scanf("%d",&sx);for(int i=1;i<=sx;i++){scanf("%d",&x);min=min>dis[x]?dis[x]:min;}if(min==INF)//等号不是赋值号！printf("-1\n");elseprintf("%d\n",min);}return 0;}
版权声明：本文为博主原创文章，未经博主允许不得转载。
，人生就像一场旅行，不必在乎目的地，
