POJ 2387 Til the Cows Come Home (Dijkstra)
来源:互联网 发布:js 提示允许加载flash 编辑:程序博客网 时间:2024/05/18 20:35
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.
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.
* 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 51 2 202 3 303 4 204 5 201 5 100
Sample Output
90
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define INF 0x7fffffff#define N 1010int map[N][N], dis[N];bool vis[N];int n, m;int dijkstra(){for (int i = 2; i <= n; i++){int minx = INF, mini;for (int j = 1; j <= n; j++)if (!vis[j] && dis[j] < minx) minx = dis[mini = j];vis[mini] = true;for (int j = 1; j <= n; j++)if (!vis[j]) dis[j] = min(dis[mini] + map[mini][j], dis[j]);}return dis[1];}int main(){scanf("%d%d", &m, &n);memset(map, 0x7f, sizeof(map));int a, b, w;for (int i = 1; i <= m; i++){scanf("%d%d%d", &a, &b, &w);if (w < map[a][b]) map[a][b] = map[b][a] = w;}for (int i = 1; i <= n; i++) dis[i] = map[n][i];dis[n] = 0;memset(vis, false, sizeof(vis));vis[n] = true;printf("%d\n", dijkstra());return 0;}
0 0
- poj 2387-Til the Cows Come Home-dijkstra
- POJ 2387 Til the Cows Come Home 最短路-Dijkstra
- POJ 2387 Til the Cows Come Home (Dijkstra)
- POJ 2387 Til the Cows Come Home(Dijkstra简单题)
- Til the Cows Come Home - POJ 2387 Dijkstra
- POJ 2387 Til the Cows Come Home(Dijkstra判重边)
- POJ 2387 || Til the Cows Come Home(最短路,dijkstra
- POJ 2387 Til the Cows Come Home (dijkstra)
- Dijkstra-POJ-2387-Til the Cows Come Home
- poj 2387 Til the Cows Come Home(dijkstra算法)
- 2387 poj Til the Cows Come Home【dijkstra,经典&&基础】
- POJ 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home(dijkstra)
- poj 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home dijkstra
- POJ - 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home dijkstra
- POJ 2387 Til the Cows Come Home (Dijkstra)
- HTTP协议学习笔记
- 自定义控件之DrawerLayout实现侧滑
- 国际C混乱码大赛
- Android问题集锦之四十九:Can't add XStream file dependency to Android Studio project
- Android Studio 开发使用总结
- POJ 2387 Til the Cows Come Home (Dijkstra)
- 泛型
- Android LayoutInflater详解
- Course学习之旅--UW的Machine Learning Foundations: A Case Study Approach--Lesson 2,3,4,5
- Android 获取系统图库的图片
- 菜鸟的安卓之路。2016.06.11
- java.util.concurrent学习—Executor框架
- Jquery自带的弹出框效果
- 数据结构:数组+链表(巧妙!)