POJ 3463 Sightseeing （最短路和次短路）
|
Sightseeing
Description Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city S to another city F. On this way, the tourists in the bus can see the sights alongside the route travelled. Moreover, the bus makes a number of stops (zero or more) at some beautiful cities, where the tourists get out to see the local sights. Different groups of tourists may have different preferences for the sights they want to see, and thus for the route to be taken from S to F. Therefore, Your Personal Holiday wants to offer its clients a choice from many different routes. As hotels have been booked in advance, the starting city S and the final city F, though, are fixed. Two routes from S to F are considered different if there is at least one road from a city A to a city B which is part of one route, but not of the other route. There is a restriction on the routes that the tourists may choose from. To leave enough time for the sightseeing at the stops (and to avoid using too much fuel), the bus has to take a short route from S to F. It has to be either a route with minimal distance, or a route which is one distance unit longer than the minimal distance. Indeed, by allowing routes that are one distance unit longer, the tourists may have more choice than by restricting them to exactly the minimal routes. This enhances the impression of a personal holiday.  For example, for the above road map, there are two minimal routes from S = 1 to F = 5: 1 → 2 → 5 and 1 → 3 → 5, both of length 6. There is one route that is one distance unit longer: 1 → 3 → 4 → 5, of length 7. Now, given a (partial) road map of the Benelux and two cities S and F, tour operator Your Personal Holiday likes to know how many different routes it can offer to its clients, under the above restriction on the route length. Input The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:
Output For every test case in the input file, the output should contain a single number, on a single line: the number of routes of minimal length or one distance unit longer. Test cases are such, that this number is at most 109 = 1,000,000,000. Sample Input 2 5 8 1 2 3 1 3 2 1 4 5 2 3 1 2 5 3 3 4 2 3 5 4 4 5 3 1 5 5 6 2 3 1 3 2 1 3 1 10 4 5 2 5 2 7 5 2 7 4 1 Sample Output 3 2 Hint The first test case above corresponds to the picture in the problem description. Source |
题意：旅行团每天固定的从S地出发到达T地，为了省油要求尽量走最短路径或比最短路径长1单位距离的路径，求满足条件的路径条数
算法：最短路和次短路。Dijkstra算法。采用邻接表建图。
总结：不要用邻接矩阵。因为有重边。
dis[x][2]:dis[x][0]表示起点到x的最短路、dis[x][1]表示起点到x的次短路；
arr[x][2]:arr[x][0]表示起点到x的最短路条数、arr[x][1]表示起点到x的次短路的条数；
vis[x][2]对应于x和0、1功能为记录该点是否被访问！
那么如何更新最小和次小路呢？显然我们容易想到下面的方法：
1.if(x<最小)更新最小，次小；
2.else if(x==最小)更新方法数；
3.else if(x<次小)更新次小；
4.else if(x==次小)更新方法数；
最后说说dijkstra的循环部分、这也是本题的关键。为什么我们要循环2*nnum-1次？显然这道题中我们每一条边都需要考虑、这不是在求最短的一条，说白了是让你求出所有的可能组合，那么我们势必对每一种情况都需要遍历一次，虽然中间有重复。最短路里已知[start][0]已被标记为访问过，那么就只有nnum-1次遍历了，而次短路我们则需要遍历nnum次，这样两者加起来就为2*nnum-1次。这与我们平时使用优先队列+heap是一样的。只是更加细化了而已。
#include<iostream> #include<cstdio> #include<cstring> using namespace std; const int INF=0x3f3f3f3f; const int VM=1010; const int EM=10010; struct Edge{ int to,nxt; int cap; }edge[EM<<1]; int vis[VM][2],dis[VM][2]; // dis[i][0]：到点i的最短路 dis[i][1]：到点j的次短路 int head[VM],count[VM][2]; // count[i][0]：到点i的最短路的路数 len[i][1]：到点j的次短路的路数 int n,m,cnt; void addedge(int cu,int cv,int cw){ edge[cnt].to=cv; edge[cnt].cap=cw; edge[cnt].nxt=head[cu]; head[cu]=cnt++; } void Dijkstra(int src,int des){ memset(vis,0,sizeof(vis)); memset(count,0,sizeof(count)); int i=0; for(i=1;i<=n;i++){ dis[i][0]=INF; dis[i][1]=INF; } dis[src][0]=0; count[src][0]=1; int j,k,tmp,flag; for(i=1;i<=2*n-1;i++){ tmp=INF; // 找新的最短路和次短路 for(j=1;j<=n;j++) if(!vis[j][0] && tmp>dis[j][0]){ k=j; flag=0; tmp=dis[j][0]; }else if(!vis[j][1] && tmp>dis[j][1]){ k=j; flag=1; tmp=dis[j][1]; } if(tmp==INF) // 如果最短路和次短路都不存在，则退出for循环 break; vis[k][flag]=1; for(j=head[k];j!=-1;j=edge[j].nxt){ // 更新和点k相连的边 int v=edge[j].to; if(dis[v][0]>tmp+edge[j].cap){ // 比最短路短 dis[v][1]=dis[v][0]; count[v][1]=count[v][0]; dis[v][0]=tmp+edge[j].cap; count[v][0]=count[k][flag]; }else if(dis[v][0]==tmp+edge[j].cap){ // 等于最短路 count[v][0]+=count[k][flag]; }else if(dis[v][1]>tmp+edge[j].cap){ // 比次短路短 dis[v][1]=tmp+edge[j].cap; count[v][1]=count[k][flag]; }else if(dis[v][1]==tmp+edge[j].cap){ // 等于次短路 count[v][1]+=count[k][flag]; } } } if(dis[des][1]==dis[des][0]+1) count[des][0]+=count[des][1]; printf("%d\n",count[des][0]); } int main(){ //freopen("input.txt","r",stdin); int t; scanf("%d",&t); while(t--){ cnt=0; memset(head,-1,sizeof(head)); scanf("%d%d",&n,&m); int u,v,w; while(m--){ scanf("%d%d%d",&u,&v,&w); addedge(u,v,w); } int src,des; scanf("%d%d",&src,&des); Dijkstra(src,des); } return 0; }
