【POJ2387】【Til the Cows Come Home】【dij模板题】
来源:互联网 发布:linux怎么退出全屏 编辑:程序博客网 时间:2024/04/30 15:36
Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 35962 Accepted: 12222
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
Hint
INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
Source
USACO 2004 November
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)#define per(i,a,n) for (int i=n-1;i>=a;i--)#define mp push_backint T,N;const int MAX = 2010;const int INF = 0x3f3f3f3f;int g[MAX][MAX];int d[MAX];bool ok[MAX];int dij(){memset(ok,0,sizeof(ok));memset(d,INF,sizeof(d));d[0] = 0;for(int i=0;i<N-1;i++){int p=-1,dmin=INF;for(int j=0;j<N;j++){if(!ok[j] && d[j] < dmin){p=j,dmin=d[j];}}ok[p] = true;for(int j=0;j<N;j++){if(!ok[j] && g[p][j] != INF && d[p] + g[p][j] < d[j]){d[j] = d[p] + g[p][j];}}}return d[N-1];}int main(){ while(scanf("%d%d",&T,&N) != EOF){memset(g,INF,sizeof(g));for(int i=0;i<T;i++){int u,v,w;scanf("%d%d%d",&u,&v,&w);u --;v --;g[u][v] = min(g[u][v],w);g[v][u] = g[u][v];}printf("%d\n",dij());} return 0;}
0 0
- 【POJ2387】【Til the Cows Come Home】【dij模板题】
- poj2387 Til the Cows Come Home—Dijkstra模板
- POJ2387---Til the Cows Come Home (最短路模板)
- poj2387- Til the Cows Come Home
- poj2387- Til the Cows Come Home
- POJ2387 Til the Cows Come Home
- POJ2387 Til the Cows Come Home【Dijkstra】
- POJ2387----Til the Cows Come Home(dijkstra)
- POJ2387---Til the Cows Come Home
- POJ2387 Til the Cows Come Home
- [poj2387] Til the Cows Come Home
- poj2387 Til the Cows Come Home
- poj2387 Til the Cows Come Home
- poj2387 Til the Cows Come Home
- POJ2387 Til the Cows Come Home
- POJ2387 Til the Cows Come Home
- Poj2387- Til the Cows Come Home
- POJ2387 Til the Cows Come Home
- Window下使用Xshell连接VirtualBox中CentOS SSH最佳实践
- Mac 安装jabberd 和adium通信
- freerdp和xrdp资料
- 使用div创建textArea无滚动条高度自适应
- Struts1和Struts2的区别和对比(完整版)
- 【POJ2387】【Til the Cows Come Home】【dij模板题】
- 虚拟机桥接方式上网
- 基于 Quartz 开发企业级任务调度应用
- 骗子
- 自动生成Mybatis类文件
- Introduction to Java Programming编程题5.17<01矩阵>
- opencv 手动调整照片颜色小工具 对比度 亮度 BGR 各通道
- 黑马程序员-----异常
- POJ 1463