【hdu】 Seaside (Floyd)注意初始化
来源:互联网 发布:linux英文改中文 编辑:程序博客网 时间:2024/04/29 21:00
Seaside
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 3 Accepted Submission(s) : 3
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
2
#include<cstdio>#include<cstring>#include<cstdlib>#define INF 0x3f3f3f3fusing namespace std;int N,p[12][12],f[12];//f[]标记是否靠近海滨 inline int min(int a,int b) {return a<b?a:b;}void Floyd(){ int i,j,k; for(i=0;i<N;i++) for(j=0;j<N;j++) for(k=0;k<N;k++) p[j][k]=min(p[j][i]+p[i][k],p[j][k]); int tmp=INF; for(i=1;i<N;i++)if(p[0][i]<tmp&&f[i]) tmp=p[0][i]; printf("%d\n",tmp); }int main(){ int i,j,M,P,S,L; while(scanf("%d",&N)!=EOF) { //memset(p,INF,sizeof(p)); for(i=0;i<N;i++) for(j=0;j<N;j++) p[i][j]=(i==j?0:INF);//注意初始化 for(i=0;i<N;i++) { scanf("%d%d",&M,&f[i]); if(M==0) continue; for(j=0;j<M;j++) { scanf("%d%d",&S,&L); p[i][S]=L; } } Floyd(); } return 0;}
- 【hdu】 Seaside (Floyd)注意初始化
- HDU -- 3665 Seaside (Floyd)
- HDU 3665 Seaside (最短路--floyd)
- hdu 3665 seaside floyd
- Seaside(Floyd)
- hdu 3665Seaside(简单floyd)
- HDU 3665 Seaside(简单Floyd)
- HDU 3665 Seaside (Floyd 最短路)
- HDOJ 3665 Seaside(最短路--floyd)
- hdu3665 Seaside (floyd算法)
- Seaside(hdu3665,floyd)
- hdu3665 seaside(floyd算法)
- HDU3665 Seaside(Floyd算法)
- 3665 Seaside【floyd】
- hdu3665-Seaside(SPFA,dijkstra,floyd)
- HDU 1003 注意初始化
- hdu 3665 Seaside
- hdu 3665:Seaside
- hud-1247-Hat’s Words
- iPhone delegate 两界面传递数据(转)
- C/C++中static关键字详解
- Epson LQ-630K打印机设置
- XMLWebService开发
- 【hdu】 Seaside (Floyd)注意初始化
- s3c6410 uboot代码分析
- android.database.sqlite.SQLiteException: database is locked
- 通过JDBC的DatabaseMetaData获取数据库元数据
- Hibernate二级缓存调用
- prototype.js教程及prototype中文手册
- Eclipse解决中文乱码
- 代码风格
- 代码审查