hdu 3631 Shortest Path(Floyd)
来源:互联网 发布:c语言中else if的用法 编辑:程序博客网 时间:2024/04/29 19:18
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3631
Shortest Path
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3962 Accepted Submission(s): 938
Problem Description
When YY was a boy and LMY was a girl, they trained for NOI (National Olympiad in Informatics) in GD team. One day, GD team’s coach, Prof. GUO asked them to solve the following shortest-path problem.
There is a weighted directed multigraph G. And there are following two operations for the weighted directed multigraph:
(1) Mark a vertex in the graph.
(2) Find the shortest-path between two vertices only through marked vertices.
For it was the first time that LMY faced such a problem, she was very nervous. At this moment, YY decided to help LMY to analyze the shortest-path problem. With the help of YY, LMY solved the problem at once, admiring YY very much. Since then, when LMY meets problems, she always calls YY to analyze the problems for her. Of course, YY is very glad to help LMY. Finally, it is known to us all, YY and LMY become programming lovers.
Could you also solve the shortest-path problem?
There is a weighted directed multigraph G. And there are following two operations for the weighted directed multigraph:
(1) Mark a vertex in the graph.
(2) Find the shortest-path between two vertices only through marked vertices.
For it was the first time that LMY faced such a problem, she was very nervous. At this moment, YY decided to help LMY to analyze the shortest-path problem. With the help of YY, LMY solved the problem at once, admiring YY very much. Since then, when LMY meets problems, she always calls YY to analyze the problems for her. Of course, YY is very glad to help LMY. Finally, it is known to us all, YY and LMY become programming lovers.
Could you also solve the shortest-path problem?
Input
The input consists of multiple test cases. For each test case, the first line contains three integers N, M and Q, where N is the number of vertices in the given graph, N≤300; M is the number of arcs, M≤100000; and Q is the number of operations, Q ≤100000. All vertices are number as 0, 1, 2, … , N - 1, respectively. Initially all vertices are unmarked. Each of the next M lines describes an arc by three integers (x, y, c): initial vertex (x), terminal vertex (y), and the weight of the arc (c). (c > 0) Then each of the next Q lines describes an operation, where operation “0 x” represents that vertex x is marked, and operation “1 x y” finds the length of shortest-path between x and y only through marked vertices. There is a blank line between two consecutive test cases.
End of input is indicated by a line containing N = M = Q = 0.
End of input is indicated by a line containing N = M = Q = 0.
Output
Start each test case with "Case #:" on a single line, where # is the case number starting from 1.
For operation “0 x”, if vertex x has been marked, output “ERROR! At point x”.
For operation “1 x y”, if vertex x or vertex y isn’t marked, output “ERROR! At path x to y”; if y isn’t reachable from x through marked vertices, output “No such path”; otherwise output the length of the shortest-path. The format is showed as sample output.
There is a blank line between two consecutive test cases.
For operation “0 x”, if vertex x has been marked, output “ERROR! At point x”.
For operation “1 x y”, if vertex x or vertex y isn’t marked, output “ERROR! At path x to y”; if y isn’t reachable from x through marked vertices, output “No such path”; otherwise output the length of the shortest-path. The format is showed as sample output.
There is a blank line between two consecutive test cases.
Sample Input
5 10 101 2 63350 4 57253 3 69634 0 81461 2 99621 0 19432 1 23924 2 1542 2 74221 3 98960 10 30 20 40 40 11 3 31 1 10 30 40 0 0
Sample Output
Case 1:ERROR! At point 4ERROR! At point 100ERROR! At point 3ERROR! At point 4
Source
2010 Asia Regional Tianjin Site —— Online Contest
代码如下:
#include <cstdio>#include <cstring>#define INF 0x3fffffff #define MAXN 317int dis[MAXN][MAXN];int mark[MAXN];int n;int min(int a, int b){return a < b ? a:b;}void init(){for(int i = 0; i < n; i++){for(int j = 0; j < n; j++){if(i == j)dis[i][j] = 0;elsedis[i][j] = INF;}}}void Floyd(int k){for(int i = 0; i < n; i++){for(int j = 0; j < n; j++){dis[i][j] = min(dis[i][j],dis[i][k]+dis[k][j]);}}}int main(){int i, j;int M, Q;int a, b, w;int cas = 0;while(~scanf("%d%d%d",&n,&M,&Q)){if(n == 0 && M == 0 && Q == 0)break;if(cas != 0)printf("\n");init();memset(mark,0,sizeof(mark));for(i = 0; i < M; i++){scanf("%d%d%d",&a,&b,&w);if(w < dis[a][b]){dis[a][b] = w;}}int op, x, y;printf("Case %d:\n",++cas);for(i = 0; i < Q; i++){scanf("%d",&op);if(op == 0){scanf("%d",&x);if(mark[x]){printf("ERROR! At point %d\n",x);continue;}mark[x] = 1;Floyd(x);}else if(op == 1){scanf("%d%d",&x,&y);if(!mark[x] || !mark[y]){printf("ERROR! At path %d to %d\n",x,y);continue;}if(dis[x][y] >= INF)printf("No such path\n");elseprintf("%d\n",dis[x][y]);}}}return 0;}
1 0
- hdu 3631 Shortest Path(floyd插点法)
- hdu 3631 Shortest Path(Floyd)
- hdu 3631 Shortest Path(Floyd)
- hdu 3631 Shortest Path (floyd)
- 【HDU】3631 Shortest Path 【floyd】
- hdu 3631 Shortest Path (floyd)
- hdu 3631 Shortest Path【Floyd】
- hdu 3631 Shortest Path (floyd)
- HDU 3631 Shortest Path Floyd
- Hdu 3631 Shortest Path(Floyd插点)
- HDU 3631 Shortest Path(Floyd变形)
- HDU - 3631 Shortest Path(Floyd最短路)
- hdu 3631 Shortest Path floyd 解题报告
- HDU 5636 Shortest Path(Floyd)
- HDU 5636:Shortest Path floyd
- HDU 5636:Shortest Path【Floyd】
- POJ 3631 SHORTEST PATH(FLOYD改装)
- HDU 3631(Shortest Path) 最短路问题 (Floyd)
- SQL Server 管理须知
- 字符串的复制,长度计算,单词反序输出
- C# dsoframer.ocx 控件注册
- Ceph:一个 Linux PB 级分布式文件系统
- typedef void(*Fun)(void)
- hdu 3631 Shortest Path(Floyd)
- 数学基础
- 解决CCS5.1 字体偏小问题
- poj3026Borg Maze(bfs预处理+最小生成树)
- 黑马程序员——集合(上)(Collection及子类)
- [2039]数据结构上机实验之二分查找
- poj 1860 Currency Exchange(SPFA)
- C语言的16进制输入
- 有5名学生保存在结构体数组中,编程按学生的成绩升序排序,按学生的姓名降序排序,按年龄从低到高排序