hdoj 3665 Seaside 【裸最短路】
来源:互联网 发布:加入淘宝联盟怎么赚钱 编辑:程序博客网 时间:2024/05/16 18:12
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1295 Accepted Submission(s): 947
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
题意:有N个点(编号从0-N-1),有若干个点距离海较近。现在你从0点出发,问你到达海边的最短路。
距离那些海边的点,然后就是最短路裸题,不解释。
#include <cstdio>#include <cstring>#include <queue>#include <algorithm>#define MAXN 200#define MAXM 400#define INF 0x3f3f3fusing namespace std;struct Edge{ int from, to, val, next;};Edge edge[MAXM];int head[MAXN], edgenum;int dist[MAXN];bool vis[MAXN];int N;void init(){ edgenum = 0; memset(head, -1, sizeof(head));}void addEdge(int u, int v, int w){ Edge E = {u, v, w, head[u]}; edge[edgenum] = E; head[u] = edgenum++;}int top;int rec[MAXN];//记录海边的点void getMap(){ int x, y, c, num, op; top = 0; for(int i = 0; i < N; i++) { scanf("%d%d", &num, &op); if(op == 1) rec[top++] = i; while(num--) { scanf("%d%d", &y, &c); addEdge(i, y, c); addEdge(y, i, c); } }}void SPFA(int sx){ queue<int> Q; memset(dist, INF, sizeof(dist)); memset(vis, false, sizeof(vis)); dist[sx] = 0; vis[sx] = true; Q.push(sx); while(!Q.empty()) { int u = Q.front(); Q.pop(); vis[u] = false; for(int i = head[u]; i != -1; i = edge[i].next) { Edge E = edge[i]; if(dist[E.to] > dist[u] + E.val) { dist[E.to] = dist[u] + E.val; if(!vis[E.to]) { vis[E.to] = true; Q.push(E.to); } } } } int ans = INF; for(int i = 0; i < top; i++) ans = min(ans, dist[rec[i]]); printf("%d\n", ans);}int main(){ while(scanf("%d", &N) != EOF) { init(); getMap(); SPFA(0); } return 0;}
0 0
- hdoj 3665 Seaside 【裸最短路】
- HDOJ 3665 Seaside(最短路--floyd)
- hdoj 3665 Seaside 【最短路&&SPFA】
- HDOJ 3665 Seaside(dijkstra最短路,水题~)
- hdu 3665 Seaside【裸最短路】
- HDU 3665 Seaside 最短路
- hdu 3665 Seaside(最短路)
- Seaside 3665 (最短路)
- hdu 3665 Seaside 最短路
- HDU 3665 Seaside (Floyd 最短路)
- HDU 3665 Seaside (最短路--floyd)
- HDU Problem 3665 Seaside【最短路】
- 杭电 3665 Seaside(最短路)(弗洛伊德过)
- hdoj 3665 Seaside
- hdoj 3665 Seaside
- HDOJ 3665 Seaside(最短路径,dijkstra算法)
- HDOJ-----3665最短路
- 杭电-3665 Seaside (判断后找最短路)
- CSR公布蓝牙“大杀器” CSR Mesh技术细节,号称要“干掉Zigbee”
- 重用从xib加载的UITableViewCell
- 浅谈switch-case的语法和应用
- iOS 9学习系列:如何使用ATS提高应用的安全性
- 最好的Stardict词库下载地址
- hdoj 3665 Seaside 【裸最短路】
- php uploadify上传图片时url出现%EF%BB%BF
- WebSocket 原理,为什么可以实现持久连接?
- HDOJ 5406 CRB and Apple 树状数组优化DP
- Objective-C基础知识点
- 8-20 UITextField
- 对数据库三范式的理解
- Elasticsearch-Spark 体验
- them for the primary five fifa ballon