HDOJ 3665 Seaside(最短路径,dijkstra算法)
来源:互联网 发布:html a标签调用php文件 编辑:程序博客网 时间:2024/05/16 01:03
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1373 Accepted Submission(s): 988
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
按照题意的输入建图即可,最短路水题。
dijkstra算法,代码如下:
#include<cstdio>#include<cstring>#define INF 0x3f3f3f#define maxn 12int map[maxn][maxn],dis[maxn],n;void dijkstar(){int visit[maxn];int i,j,min,next=0;for(i=0;i<n;++i){dis[i]=map[0][i];visit[i]=0;}visit[0]=1;for(i=1;i<n;++i){min=INF;for(j=0;j<n;++j){if(!visit[j]&&min>dis[j]){next=j;min=dis[j];}}visit[next]=1;for(j=0;j<n;++j){if(!visit[j]&&dis[j]>dis[next]+map[next][j]) dis[j]=dis[next]+map[next][j];}}}int main(){int i,j,end[10],num,d,k,sea,place;while(scanf("%d",&n)!=EOF){for(i=0;i<n;++i){for(j=0;j<n;++j){if(i==j) map[i][j]=0;else map[i][j]=INF;}}k=0;for(i=0;i<n;++i){scanf("%d%d",&num,&sea);if(sea) end[k++]=i;//将在海边小镇存入数组 for(j=0;j<num;++j) { scanf("%d%d",&place,&d); if(map[i][place]>d) map[i][place]=d;//注意是单向图 }}dijkstar();int ans=INF;for(i=0;i<k;++i)//找到到海边最短的路径权值 {if(dis[end[i]]<ans) ans=dis[end[i]];}printf("%d\n",ans);}return 0;}
0 0
- HDOJ 3665 Seaside(最短路径,dijkstra算法)
- HDOJ 3790 最短路径问题(dijkstra算法)
- DIJKSTRA最短路径算法
- 最短路径算法-dijkstra
- dijkstra最短路径算法
- 最短路径 Dijkstra算法
- 最短路径(Dijkstra算法)
- 最短路径Dijkstra算法
- 最短路径 Dijkstra算法
- Dijkstra最短路径算法
- 最短路径dijkstra算法
- 最短路径 dijkstra算法
- 最短路径Dijkstra 算法
- 最短路径 (Dijkstra算法)
- Dijkstra最短路径算法
- 最短路径(Dijkstra算法)
- 最短路径--Dijkstra算法
- Dijkstra最短路径算法
- string::size_type类型
- Raising Modulo Numbers
- mysql常用函数
- 打开MySQL数据库远程访问的权限
- linux通过wget直接下载jdk,避免用户验证
- HDOJ 3665 Seaside(最短路径,dijkstra算法)
- ABAP调用外部WebService
- android 动画xml属性详解
- 反转链表
- HTML DOM addEventListener() 方法
- 汇编基础入门知识
- play Framework如何通过实体.find查询Date类型字段
- Spring框架下的单元测试方法
- 日经春秋 20150824