算法分析与复杂性理论 第三题 Til the Cows Come Home
来源:互联网 发布:云计算技术应用实例 编辑:程序博客网 时间:2024/05/22 22:04
- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
- 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. - 输入
- * 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. - 输出
- * Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
- 样例输入
5 51 2 202 3 303 4 204 5 201 5 100
- 样例输出
90
- 提示
- INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1. - 来源
- USACO 2004 November
#include <iostream>#include <cstdio>#include <limits.h>using namespace std;int n, t;int trail[1010][1010];int minDistance[1010];bool isVisited[1010];void dijstra(int root){ isVisited[root] = true; int visitedNum = 1; int nowVisited = root; minDistance[root] = 0; while(visitedNum <= n) { int minDis = INT_MAX; int nextVisited = -1; for(int i = 1; i <= n; i++) { if(i == nowVisited || i == root) continue; if(!isVisited[i] && trail[nowVisited][i] != INT_MAX && minDistance[i] > minDistance[nowVisited] + trail[nowVisited][i]) { minDistance[i] = minDistance[nowVisited] + trail[nowVisited][i]; } if(!isVisited[i] && minDistance[i] < minDis) { minDis = minDistance[i]; nextVisited = i; } } isVisited[nextVisited] = true; visitedNum ++; nowVisited = nextVisited; }}int main(){ for(int i = 0; i < 1010; i++) { for(int j = 0; j < i; j++) trail[i][j] = trail[j][i] = INT_MAX; trail[i][i] = 0; minDistance[i] = INT_MAX; isVisited[i] = false; } cin >> t >> n; for(int i = 0; i < t; i++) { int x, y, d; cin >> x >> y >> d; if(trail[x][y] > d) trail[x][y] = trail[y][x] = d; } dijstra(1); cout << minDistance[n] << endl; return 0;}
阅读全文
0 0
- 算法分析与复杂性理论 第三题 Til the Cows Come Home
- POJ2387--Til the Cows Come Home--Dijkstra算法裸题
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- poj 2387 Til the Cows Come Home(Dijskra算法)
- poj 2387 Til the Cows Come Home(dijkstra算法)
- POJ2387--Til the Cows Come Home(dijkstra算法)
- JAVA面向对象学习笔记(一)
- ContentProvider 使用方法详解
- 反射重要
- 记一次node编写爬虫的经历
- 轮播banner(自带小圆点)
- 算法分析与复杂性理论 第三题 Til the Cows Come Home
- 如何学习javaee在2017年
- mybatis的简单使用步骤
- 0915 星际旅行 砍树 超级树
- 帮我理解下这个静态的代码块吧java
- HDU 6199 dp
- 2017.9.15 清除浮动的原理和方法
- 面试题(6)
- vector用法1