poj 2387 Til the Cows Come Home
来源:互联网 发布:数据库爆破工具 编辑:程序博客网 时间:2024/06/18 09:10
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
Hint
INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
注意
可能出现重边
代码
#include <iostream>#include <vector>#include <map>#include <math.h>#include<algorithm>#include<iostream>#include<cstring>#include <cstdio>#include <string.h>#include <stdio.h>#define maxdist 0xfffffff#define N 1005using namespace std;int a[N][N],dist[N],s[N];int t,n;void Dijkstra(){ int i,j,k,u,w; memset(s,0,sizeof(s)); for(i=1;i<=n;i++){ dist[i]=a[1][i]; } dist[1]=0; s[1]=1; int mind; for(i=1;i<=n;i++){ mind=maxdist; for(j=1;j<=n;j++){ if(s[j]==0&&dist[j]<mind){ u=j; mind=dist[j]; } } s[u]=1; for(k=1;k<=n;k++){ w=a[u][k]; if(s[k]==0&&w<maxdist&&dist[u]+w<dist[k]){ dist[k]=dist[u]+w; } } } cout<<dist[n]<<"\n"; }int main(){ //freopen("in.txt","r",stdin); int i,j; while(scanf("%d %d",&t,&n)!=EOF){ for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ a[i][j]=maxdist; } } for(i=1;i<=t;i++){ int x,y,d; cin>>x>>y>>d; if(a[x][y]>d){ a[x][y]=a[y][x]=d;//考虑重边 } } Dijkstra(); } return 0;}
- POJ 2387 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
- POJ 2387 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
- poj 2387 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
- poj 2387 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
- POJ 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- 面向对象编程思想
- uva 1357 - Cells(dfs)
- Oracle序列nextval以及currval的区别
- react-native试玩(15)-滚动视图
- JBoss 系列二:使用Apache httpd(mod_cluster)和JBoss构架高可用集群环境
- poj 2387 Til the Cows Come Home
- 零基础学python-12.2 关键字pass,else,break,continue
- Android通过注解来初始化控件
- BookKeeper
- Comparator比较器的使用,Map排序
- 嵌入式设备时间同步管理
- 带我家小子学编程 02
- Tcl文件操作---gets需注意的一小点
- 工作中遇到的SQL( 满足连续状态要求 )