HDOJ 3665 Seaside(最短路--floyd)
2015-08-23 23:05
267 查看
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1368 Accepted Submission(s): 983
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
Each case takes one line, print the shortest length that XiaoY reach seaside.
[align=left]Sample Input[/align]
5
1 0
1 1
2 0
2 3
3 1
1 1
4 100
0 1
0 1
[align=left]Sample Output[/align]
2
ac代码:
#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:a using 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; }
相关文章推荐
- 【jQuery】仿淘宝五星评价打分的实现
- 快速排序算法C++实现
- 零基础学python-7.7 字符串格式化方法(2)
- 【转】Ensemble learning(集成学习)
- 零基础学python-7.7 字符串格式化方法(2)
- 字典数据类型-字典常见操作
- Mac环境下搭建PhoneGap环境【转载】
- CSS3114: @font-face 未能完成 OpenType 嵌入权限检查。权限必须是可安装的。
- [不断更新]前端工程师面试必备知识清单
- SDM对分频器输出信号相位噪声的影响
- python发送Email 带附件
- UVa 1613:K-Graph Oddity(BFS)
- SQL中的case when then else end用法
- css属性image-redering详解
- 黑马程序员--正则表达式
- gdb调试总结
- POJ 2506 Tiling(大数)
- NMAKE : fatal error U1045: spawn failed : Permission denied
- 编写高质量代码改善C#程序的157个建议——建议142:总是提供有意义的命名
- 存储过程引发的思考