POJ-2387 Til the Cows Come Home ( 最短路 )
2016-05-31 19:06
429 查看
题目链接: http://poj.org/problem?id=2387
Description
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John's field has N (2 <= N <= 1000) landmarks in it,
uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in
which Bessie stands all day is landmark N. Cows travel in the field
using T (1 <= T <= 2000) bidirectional cow-trails of various
lengths between the landmarks. Bessie is not confident of her navigation
ability, so she always stays on a trail from its start to its end once
she starts it.
Given the trails between the landmarks, determine the minimum
distance Bessie must walk to get back to the barn. It is guaranteed
that some such route exists.
Input
* Line 1: Two integers: T and N
* Lines 2..T+1: Each line describes a trail as three space-separated
integers. The first two integers are the landmarks between which the
trail travels. The third integer is the length of the trail, range
1..100.
Output
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
Sample Input
Sample Output
Description
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John's field has N (2 <= N <= 1000) landmarks in it,
uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in
which Bessie stands all day is landmark N. Cows travel in the field
using T (1 <= T <= 2000) bidirectional cow-trails of various
lengths between the landmarks. Bessie is not confident of her navigation
ability, so she always stays on a trail from its start to its end once
she starts it.
Given the trails between the landmarks, determine the minimum
distance Bessie must walk to get back to the barn. It is guaranteed
that some such route exists.
Input
* Line 1: Two integers: T and N
* Lines 2..T+1: Each line describes a trail as three space-separated
integers. The first two integers are the landmarks between which the
trail travels. The third integer is the length of the trail, range
1..100.
Output
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
Sample Input
5 5 1 2 20 2 3 30 3 4 20 4 5 20 1 5 100
Sample Output
90 最短路模板题,求1到n的最短路
#include<iostream> #include<algorithm> #include<cmath> #include<cstring> #include<stack> #include<queue> using namespace std; int way[1005][1005]; bool flag[1005]; int main(){ ios::sync_with_stdio( false ); int n, m; while( cin >> m >> n ){ int x, y, d; memset( way, 0x3f3f3f3f, sizeof( way ) ); memset( flag, false, sizeof( flag ) ); for( int i = 0; i < m; i++ ){ cin >> x >> y >> d; way[x][y] = way[y][x] = min( way[x][y], d ); } for( int k = 0; k < n - 1; k++ ){ int minv = 0x3f3f3f3f, mini; for( int i = 1; i < n; i++ ){ if( !flag[i] && minv > way [i] ){ minv = way [i]; mini = i; } } flag[mini] = true; for( int i = 1; i < n; i++ ){ if( !flag[i] ){ way [i] = min( way [i], way [mini] + way[mini][i] ); } } } cout << way [1] << endl; } return 0; }
相关文章推荐
- Java创建文件
- 向上沟通
- 你好,Oh My Zsh - 社区力量全新方式定义命令行
- Java加密技术(三)——PBE算法
- 第十四周 5.30 --- 6.5
- 【Gradle】管理库工程release及debug
- Python学习笔记 2 字符串的操作大全
- 【Jmeter】参数Parameters和Body Data
- 写监听和DOM时那些傻逼的错误
- #MYSQL子查询
- 关于android自定义键盘
- Docker学习(一)
- Linux 命令笔记
- Hibernate开发步骤
- 解决easyui propertygrid控件中,combobox控件(下拉框控件)回显value值的问题
- elasticsearch插件大全(不断更新)
- 从零开始开发jvm语言(零)
- 工作单元(Unit Of Work)模式 ( 二 )
- SELECT INTO 和 INSERT INTO SELECT 两种表复制语句
- oc addChildViewController