hdu 3665 Seaside(最短路)
来源:互联网 发布:火汉字笔顺演示软件 编辑:程序博客网 时间:2024/05/14 21:51
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1253 Accepted Submission(s): 915
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.
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.
Each case takes one line, print the shortest length that XiaoY reach seaside.
1 0
1 1
2 0
2 3
3 1
1 1
4 100
0 1
0 1
Sample Output
题目大意就是求得从起点开始到达海岸边最短的路,这里到达岸边的方案不止一种,要找出最短的。
单源最短路,很裸的Dijkstra
AC代码:
#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<map>#define INF 0x3f3f3f3fusing namespace std;struct Node{ int id; int flag;}node[15];int d[15],v[15],w[15][15];int main(){ int N; int n; int p,dis; while(scanf("%d",&N)!=EOF) { for(int i=0;i<N;i++) for(int j=0;j<N;j++) w[i][j]=INF; for(int i=0;i<N;i++) node[i].id=i; for(int i=0;i<N;i++) { scanf("%d%d",&n,&node[i].flag); for(int j=0;j<n;j++) { scanf("%d%d",&p,&dis); w[i][p]=dis; } } memset(v,0,sizeof(v)); for(int i=0;i<N;i++) d[i]=(i==0 ? 0 : INF); for(int i=0;i<N;i++) { int x,m=INF; for(int y=0;y<N;y++) if(!v[y] && d[y]<m){m=d[x=y];} v[x]=1; for(int y=0;y<N;y++) if(!v[y] && w[x][y]!=INF) d[y]=min(d[y],d[x]+w[x][y]); } int ans=INF; for(int i=0;i<N;i++) if(node[i].flag) ans=min(ans,d[i]); printf("%d\n",ans); } return 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】
- [C语言][LeetCode][27]Remove Element
- 聊天机器人&语音
- 这是一个起点
- leetcode_Combination Sum II
- office2007激活方法-序列号及不用激活码的激活方法
- hdu 3665 Seaside(最短路)
- hdu1856 More is better (并查集)
- Android之如何解决图片自动拉伸后失真【9patch】
- unable to checkout a viewer license necessary ....
- Jdk安装(最简洁的安装方法)
- JAVA 设计模式-抽象工厂模式
- 插入排序1.0
- elasticsearch中更新mapping的方式
- 孪生素数问题 nyoj 26