HDU 3665 Seaside (Floyd 最短路)
来源:互联网 发布:app软件大全 编辑:程序博客网 时间:2024/04/30 12:05
Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1146 Accepted Submission(s): 834
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
2
2010 Asia Regional Harbin
题目大意:有n个镇,编号为0~n-1,有些镇靠海,xiaoY现在在0号镇,求出从0号镇到海边的最短路径长度。
题目分析:根据题意建下图,Floyd跑一下,再找个最短的
#include <cstdio>int const INF = 0xffffff;int n, map[15][15];int ok[15];void Floyd() { for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) for(int k = 0; k < n; k++) if(map[j][i] + map[i][k] < map[j][k]) map[j][k] = map[j][i] + map[i][k]; } void Init() { for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) i == j ? map[i][j] = 0 : map[i][j] = INF; } int main(){ while(scanf("%d", &n) != EOF) { Init(); int m, s, l; for(int i = 0; i < n; i++) { scanf("%d %d", &m, &ok[i]); for(int j = 0; j < m; j++) { scanf("%d %d", &s, &l); map[i][s] = l; } } Floyd(); int ans = INF; for(int i = 0; i < n; i++) if(ok[i] && ans > map[0][i]) ans = map[0][i]; printf("%d\n", ans); }}
0 0
- HDU 3665 Seaside (Floyd 最短路)
- HDU 3665 Seaside (最短路--floyd)
- HDU 3665 Seaside 最短路
- hdu 3665 Seaside(最短路)
- hdu 3665 Seaside 最短路
- HDOJ 3665 Seaside(最短路--floyd)
- hdu 3665 Seaside【裸最短路】
- HDU Problem 3665 Seaside【最短路】
- hdu 3665 seaside floyd
- hdu 3665Seaside(简单floyd)
- HDU 3665 Seaside(简单Floyd)
- HDU -- 3665 Seaside (Floyd)
- Seaside 3665 (最短路)
- hdoj 3665 Seaside 【裸最短路】
- hdoj 3665 Seaside 【最短路&&SPFA】
- HDU-1869 最短路 FLOYD
- HDU 1869 最短路 floyd
- hdu 1385 floyd 最短路
- C++之函数简介
- 多线程编程(3): 使用互斥锁同步线程
- 【iOS初学笔记】TextField设置内填充(padding or inset)
- Python实战之多线程编程threading.Thread
- codeforces 283C Coin Troubles (神级思维+判环+背包)
- HDU 3665 Seaside (Floyd 最短路)
- Python实战之多线程编程thread模块
- Python实战之子进程
- MySQL应用
- C++之面向程序设计浅析
- 我不是会学会玩
- HDU356 Eight II(康拓展开+预处理)
- PowerShell常用的轉義符、比較符、邏輯操作符
- Python多线程编程