Til the Cows Come Home
来源:互联网 发布:达内java视频百度网盘 编辑:程序博客网 时间:2024/06/05 12:06
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.
* Line 1: Two integers: T and N
5 5
1 2 20
2 3 30
3 4 20
4 5 20
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 5
1 2 20
2 3 30
3 4 20
4 5 20
1 5 100
90
模板题,需要注意的是判断重边,对于同一条路,取权值最小的
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>const int N = 1010;const int INF = 0x3f3f3f3f;int g[N][N];int d[N];bool vis[N];int t, n;void Dijkstra(int s){memset(d, 0x3f, sizeof(d));memset(vis, 0, sizeof(vis));d[s] = 0;for(int i = 0; i < n; i++){int u = -1, MIN = INF;for(int j = 1; j <= n; j++){if(!vis[j] && d[j] < MIN){u = j;MIN = d[j];}}if(u == -1) return;vis[u] = 1;for(int v = 1; v <= n; v++){if(g[u][v] != INF && !vis[v] && d[u] + g[u][v] < d[v])d[v] = d[u] + g[u][v];}}}int main(){int u, v, w;memset(g, 0x3f, sizeof(g));scanf("%d%d", &t, &n);while(t--){scanf("%d%d%d", &u, &v, &w);if(w < g[u][v]) //判断重边,取最小权值边 g[u][v] = g[v][u] = w;}Dijkstra(n);printf("%d", d[1]);return 0;}
阅读全文
0 0
- 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
- PKU2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- Xbrowser远程登录Ubuntu闪退问题的解决方案
- Mac下解决sublime text 2中文乱码
- 401. Binary Watch
- HDU 6085 Rikka with Candies
- Unity如何利用Mapbox在游戏中实现真实地图?
- Til the Cows Come Home
- 安卓实现类似连续点击5次进入开发者模式的功能
- openssl制作证书全过程(windows) + 部分修改
- webpack 学习记录
- springboot 定时任务
- 我想我们都没太在意
- 每日一题(36)—— 什么是预编译 , 何时需要预编译?
- Spring aop 原理及各种应用场景
- python实例(复制列表)