HDOJ 3665 Seaside(最短路--floyd)
来源:互联网 发布:压力校验台淘宝 编辑:程序博客网 时间:2024/04/30 05:44
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1368 Accepted Submission(s): 983
Problem Description
XiaoY is living in a big city, there are N towns in it and some towns near the sea. All these towns are numbered from 0 to N-1 and XiaoY lives in the town numbered ’0’. There are some directed roads connecting them. It is guaranteed that you can reach any town from the town numbered ’0’, but not all towns connect to each other by roads directly, and there is no ring in this city. One day, XiaoY want to go to the seaside, he asks you to help him find out the shortest way.
Input
There are several test cases. In each cases the first line contains an integer N (0<=N<=10), indicating the number of the towns. Then followed N blocks of data, in block-i there are two integers, Mi (0<=Mi<=N-1) and Pi, then Mi lines followed. Mi means there are Mi roads beginning with the i-th town. Pi indicates whether the i-th town is near to the sea, Pi=0 means No, Pi=1 means Yes. In next Mi lines, each line contains two integers SMi and LMi, which means that the distance between the i-th town and the SMi town is LMi.
Output
Each case takes one line, print the shortest length that XiaoY reach seaside.
Sample Input
51 01 12 02 33 11 14 1000 10 1
Sample Output
2ac代码:#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#define MAXN 1010#define INF 0xfffffff#define max(a,b) a>b?a:b#define min(a,b) a>b?b:ausing namespace std;int pri[MAXN][MAXN];int num[MAXN];int main(){ int n; int i,j,m,a,c,k; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) for(j=0;j<n;j++) pri[i][j]=i==j?0:INF; for(i=0;i<n;i++) { scanf("%d%d",&m,&num[i]); for(j=0;j<m;j++) { scanf("%d%d",&a,&c); if(pri[i][a]>c) pri[i][a]=pri[a][i]=c; } } for(k=0;k<n;k++) for(i=0;i<n;i++) for(j=0;j<n;j++) pri[i][j]=min(pri[i][j],pri[i][k]+pri[k][j]); int mi=INF; for(i=1;i<n;i++) { if(num[i]) { mi=min(mi,pri[0][i]); } } printf("%d\n",mi); } return 0;}
0 0
- HDOJ 3665 Seaside(最短路--floyd)
- HDU 3665 Seaside (最短路--floyd)
- HDU 3665 Seaside (Floyd 最短路)
- HDOJ 3665 Seaside(dijkstra最短路,水题~)
- hdoj 3665 Seaside 【裸最短路】
- hdoj 3665 Seaside 【最短路&&SPFA】
- Seaside 3665 (最短路)
- HDU 3665 Seaside 最短路
- hdu 3665 Seaside(最短路)
- hdu 3665 Seaside 最短路
- HDOJ 3665 Seaside【Dijkstra】【SPFA】【Floyd】
- 最短路(Floyd)(HDOJ 2544)
- HDOJ 1217 Arbitrage (最短路 Floyd)
- HDU -- 3665 Seaside (Floyd)
- 杭电 3665 Seaside(最短路)(弗洛伊德过)
- hdu 3665 Seaside【裸最短路】
- HDU Problem 3665 Seaside【最短路】
- HDOJ 1596 find the safest road(floyd最短路)
- gdb调试总结
- 黑马程序员--正则表达式
- NMAKE : fatal error U1045: spawn failed : Permission denied
- SDM对分频器输出信号相位噪声的影响
- SQL中的case when then else end用法
- HDOJ 3665 Seaside(最短路--floyd)
- HDU2768Cat vs. Dog二分图 最大独立集(最大匹配)
- [不断更新]前端工程师面试必备知识清单
- python发送Email 带附件
- UVa 1613:K-Graph Oddity(BFS)
- 字典数据类型-字典常见操作
- RPC和NFS还有如此的渊源TODO
- 学习Spring必学的Java基础知识(7)----事务基础知识
- Android数据库ORMlite框架翻译系列(第一章)