hdu 3665 Seaside 最短路
来源:互联网 发布:算法导论22章 编辑:程序博客网 时间:2024/05/16 14:19
题目:
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1716 Accepted Submission(s): 1259
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
分析:
最短路,结点少,直接floyd。增加总终点n,若某一城镇在海边,则其与n距离为零。
代码:
#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>#include<ctype.h> //tower()#include<set> #include<map> #include<iomanip>// cout<<setprecision(1)<<fixed<<a;#include<vector> #include<cmath>#include<algorithm>#include<bitset>#include<limits.h>#include<stack>#include<queue>using namespace std;const int maxn=16;const int INF=0x3f3f3f3f;int n,d[maxn][maxn];int main(){ while(scanf("%d",&n)==1){ for(int i=0;i<=n;i++) for(int j=0;j<=n;j++)d[i][j] = i==j?0:INF; for(int i=0;i<n;i++){//城镇编号为[0,n-1] int m,p; scanf("%d%d",&m,&p); if(p) d[i][n]=0; while(m--){ int u,dist; scanf("%d%d",&u,&dist); d[i][u]=dist; } } for(int k=0;k<=n;k++) for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) if(d[i][k]<INF && d[k][j]<INF) d[i][j]=min(d[i][j],d[i][k]+d[k][j]); printf("%d\n",d[0][n]); } return 0;}
0 0
- HDU 3665 Seaside 最短路
- hdu 3665 Seaside(最短路)
- hdu 3665 Seaside 最短路
- hdu 3665 Seaside【裸最短路】
- HDU 3665 Seaside (Floyd 最短路)
- HDU 3665 Seaside (最短路--floyd)
- HDU Problem 3665 Seaside【最短路】
- Seaside 3665 (最短路)
- hdoj 3665 Seaside 【裸最短路】
- HDOJ 3665 Seaside(最短路--floyd)
- hdoj 3665 Seaside 【最短路&&SPFA】
- 杭电 3665 Seaside(最短路)(弗洛伊德过)
- HDOJ 3665 Seaside(dijkstra最短路,水题~)
- hdu 3665 Seaside
- hdu 3665:Seaside
- hdu 3665 Seaside
- HDU--3665--Seaside
- Seaside HDU 3665 【Dijkstra】
- Activiti工作流简单入门
- NYOJ171 第三届acm省赛 聪明的kk
- node处理未捕获异常
- Activiti工作流引擎使用
- NLP+句法结构(三)︱中文句法结构(CIPS2016、依存句法、文法)
- hdu 3665 Seaside 最短路
- Windows下的Eclipse启动出现:a java runtime environment(JRE) or java development kit(JDK) must be
- 字符串(寻找最大元素)
- 解密Redis持久化
- Activiti入门列子一个简单的Activiti请假流程
- 库函数与系统调用的联系与区别
- linux 下查看内存情况命令
- CSU-1511 残缺的棋盘 解题报告
- tensorflow基本使用中出现的问题及解决方案