杭电3665Seaside
来源:互联网 发布:桌面美女跳舞软件 编辑:程序博客网 时间:2024/05/16 08:10
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1369 Accepted Submission(s): 984
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
题意很简单,只要随便找到一个近海的city走到就行,因为体重要求city数量不多,所以用了比较简单的floyd:
附ac代码:
#include<stdio.h>#include<string.h>#define N 0x3f3f3fint map[100][100],m,n;void ac()//floyd找最短路径 { int i,j,k; for(i=0;i<m;i++) for(j=0;j<m;j++) for(k=0;k<m;k++) if(map[j][k]>map[j][i]+map[i][k]) map[j][k]=map[j][i]+map[i][k];}int main(){ int i,j,k,l,x,y[100],u,v; while(scanf("%d",&m)!=EOF) { memset(map,N,sizeof(map)); for(i=0;i<m;i++) { scanf("%d%d",&x,&y[i]); if(y[i]==0) map[i][x]=N; for(j=0;j<x;j++) { scanf("%d%d",&u,&v); map[i][u]=map[u][i]=v; } } ac(); int ans=N; for(i=0;i<m;i++) { if(y[i])//若果当前city近海,则比较当前结果 if(ans>map[0][i]) ans=map[0][i]; } printf("%d\n",ans); } return 0;}
0 0
- 杭电3665Seaside
- 杭电-3665 Seaside (判断后找最短路)
- 【杭电oj3665】Seaside
- 杭电 3665 Seaside(最短路)(弗洛伊德过)
- hdu 3665 Seaside
- hdu 3665:Seaside
- hdu 3665 Seaside
- HDU--3665--Seaside
- 3665 Seaside【floyd】
- Seaside HDU 3665 【Dijkstra】
- hdoj 3665 Seaside
- hdu-3665 Seaside
- hdoj 3665 Seaside
- Seaside hd 3665
- HDU 3665 Seaside
- hdu 3665 seaside floyd
- HDU-3665-Seaside
- HDU-3665 Seaside
- 黑马程序员——ios基础---Objective-C:基础语法
- iOS开发-CoreMotion框架(加速计和陀螺仪)
- hive学习笔记-高级查询
- 关于实体为Date类型的字段,如何用model.find(" date>? ",param)方法进行查询?
- hdu 4007 平行矩形包含点数
- 杭电3665Seaside
- 二阶有源低通滤波电路的设计与分析
- Unity换装之合并网格
- hdu5418--Victor and World(floyd+状压dp)
- Wireshark 数据分析(二)
- ChargeSystem——One,Two,Three
- C++ ERROR redefinition of ‘class ***’
- intent 跳转activity无效
- 为何毕业三年后的差距这么大?