HDU1688 Sightseeing(SPFA 求最短路与次短路的路径条数)可用作模板
来源:互联网 发布:淘宝内衣女店主 编辑:程序博客网 时间:2024/05/16 11:21
Sightseeing
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 718 Accepted Submission(s): 293
Problem 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.
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:
One line with two integers N and M, separated by a single space, with 2 ≤ N ≤ 1,000 and 1 ≤ M ≤ 10, 000: the number of cities and the number of roads in the road map.
M lines, each with three integers A, B and L, separated by single spaces, with 1 ≤ A, B ≤ N, A ≠ B and 1 ≤ L ≤ 1,000, describing a road from city A to city B with length L.
The roads are unidirectional. Hence, if there is a road from A to B, then there is not necessarily also a road from B to A. There may be different roads from a city A to a city B.
One line with two integers S and F, separated by a single space, with 1 ≤ S, F ≤ N and S ≠ F: the starting city and the final city of the route.
There will be at least one route from S to F.
One line with two integers N and M, separated by a single space, with 2 ≤ N ≤ 1,000 and 1 ≤ M ≤ 10, 000: the number of cities and the number of roads in the road map.
M lines, each with three integers A, B and L, separated by single spaces, with 1 ≤ A, B ≤ N, A ≠ B and 1 ≤ L ≤ 1,000, describing a road from city A to city B with length L.
The roads are unidirectional. Hence, if there is a road from A to B, then there is not necessarily also a road from B to A. There may be different roads from a city A to a city B.
One line with two integers S and F, separated by a single space, with 1 ≤ S, F ≤ N and S ≠ F: the starting city and the final city of the route.
There will be at least one route from S to F.
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 10^9 = 1,000,000,000.
Sample Input
25 81 2 31 3 21 4 52 3 12 5 33 4 23 5 44 5 31 55 62 3 13 2 13 1 104 5 25 2 75 2 74 1
Sample Output
32
Source
华东区大学生程序设计邀请赛_热身赛
题意:给出一个有向图,两个点之间可有多条同向同值的直接路。问从S 点 到 F点 的 最短路条数与 最短路距离+1 路径条数 总和是多少。
#include<stdio.h>#include<queue>#include<vector>using namespace std;const int N = 1005;const int inf = 1e9;struct EDG{ int v,d;};struct node{ int v,c;};vector<EDG>mapt[N];int spfa(int sp,int ep,int n){ int inq[N][2]={0},dis[N][3],num[N][2]; queue<node>q; //队列里面的节点都是需要更新的 node pre,now; for(int i=1;i<=n;i++) { dis[i][0]=dis[i][1]=inf; dis[i][2]=inf; //只是用于标记当前(i,0)组合点己更新过的值 num[i][0]=num[i][1]=0; } now.v=sp; now.c=0; dis[sp][0]=0; num[sp][0]=1; q.push(now); while(!q.empty()) { pre=q.front(); q.pop(); inq[pre.v][pre.c]=0; if(pre.c==0) //为下次被替换到次小值时,是否需要再一次根据当前值更新作判断依居 dis[pre.v][2]=dis[pre.v][0]; int k=mapt[pre.v].size(); for(int i=0;i<k;i++) { now.v=mapt[pre.v][i].v; if(dis[now.v][0]>=dis[pre.v][pre.c]+mapt[pre.v][i].d) { if(dis[now.v][0]>dis[pre.v][pre.c]+mapt[pre.v][i].d) { dis[now.v][1]=dis[now.v][0]; num[now.v][1]=num[now.v][0]; //当最小被替换成次小时,如果这个值没有更新过,就一定要放入队列 now.c=1; if(inq[now.v][now.c]==0&&dis[now.v][now.c]!=dis[now.v][2]) q.push(now),inq[now.v][now.c]=1; dis[now.v][0]=dis[pre.v][pre.c]+mapt[pre.v][i].d; num[now.v][0]=num[pre.v][pre.c]; } else num[now.v][0]+=num[pre.v][pre.c]; now.c=0; if(inq[now.v][now.c]==0) q.push(now),inq[now.v][now.c]=1; } else if(dis[now.v][1]>=dis[pre.v][pre.c]+mapt[pre.v][i].d) { if(dis[now.v][1]>dis[pre.v][pre.c]+mapt[pre.v][i].d) { dis[now.v][1]=dis[pre.v][pre.c]+mapt[pre.v][i].d; num[now.v][1]=num[pre.v][pre.c]; } else num[now.v][1]+=num[pre.v][pre.c]; now.c=1; if(inq[now.v][now.c]==0) q.push(now),inq[now.v][now.c]=1; } } } if(dis[ep][1]==dis[ep][0]+1) num[ep][0]+=num[ep][1]; return num[ep][0];}int main(){ int t,n,m,a; EDG ss; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) mapt[i].clear(); while(m--) { scanf("%d%d%d",&a,&ss.v,&ss.d); mapt[a].push_back(ss); } int sp,ep; scanf("%d%d",&sp,&ep); printf("%d\n",spfa(sp,ep,n)); }}
0 0
- HDU1688 Sightseeing(SPFA 求最短路与次短路的路径条数)可用作模板
- hdu1688 Sightseeing(次短路)
- HDU-1688 Sightseeing 最短路与“次短路”条数
- hdu 1688 Sightseeing(最短路+次短路条数)
- hdu 1688 Sightseeing【最短路,次短路条数】
- POJ-3463: Sightseeing 【最短路次短路及条数】
- HDU 1688 Sightseeing 求最短路和次短路条数之和
- 优先队列优化的求最短路和次短路条数以及长度的模板
- 最短路和次短路的条数(dijstra算法或spfa算法)POJ3463
- POJ 3463 Sightseeing (最短路&次短路条数问题)
- Sightseeing(最短路与次短路之和)
- POJ 3463 Sightseeing 次短路条数
- HDU 1688 Sightseeing 【次短路条数】
- poj 3463 Sightseeing(dij求最短路+次短路(比最短路长1)的总走法)
- HDU 1688 Sightseeing 最短路 及次短路 路径长度和路径数
- [次短路][路径计数](模板题) poj3436 Sightseeing
- spfa求最短路模板(邻接矩阵)
- POJ3463 Sightseeing(dijkstra求最短路+次短路)
- Installation error: INSTALL_CANCELED_BY_USER
- Web负载均衡
- Linux程序设计(Linux shell编程的例子:统计代码行数)
- boa.conf配置
- hadoop浅谈
- HDU1688 Sightseeing(SPFA 求最短路与次短路的路径条数)可用作模板
- 黑马程序员-----面向对象
- Android学习阶段总结:自己做一个闹钟能学到什么?
- 第一篇博客,开个头,希望以后继续加油
- 算符优先分析
- 负载均衡的几种实现技术
- <C/C++图>最小生成树:Prim算法
- Android应用程序永久获取root权限方法
- 负载均衡的几种实现方式