Til the Cows Come Home
来源:互联网 发布:微信公众号seo 编辑:程序博客网 时间:2024/06/01 07:55
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.
* 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.
* 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.
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
单源最短路模板题
#include<stdio.h>#include<string.h>#include<queue>#define maxn 1005#define maxe 2005#define inf 0x3f3f3f3fusing namespace std;int head[maxn],dis[maxn],cnt,t,n;bool vis[maxn];struct Edge{int v,w,next;}edge[maxe*2];struct list{int p,d;list() {}list(int _p,int _d){p=_p;d=_d;}friend bool operator <(struct list a,struct list b){return a.d>b.d;}};void add_edge(int u,int v,int w){edge[cnt].v=v;edge[cnt].w=w;edge[cnt].next=head[u];head[u]=cnt++;}void dijkstra(int s){memset(dis,inf,sizeof(dis));memset(vis,0,sizeof(vis));priority_queue<struct list> q;dis[s]=0;q.push(list(s,0));while(!q.empty()){struct list Q=q.top();q.pop();if(vis[Q.p])continue;vis[Q.p]=true;for(int i=head[Q.p];i!=-1;i=edge[i].next){int to=edge[i].v;if(dis[to]>dis[Q.p]+edge[i].w){dis[to]=dis[Q.p]+edge[i].w;q.push(list(to,dis[to]));}}}}int main(){scanf("%d%d",&t,&n);cnt=0;memset(head,-1,sizeof(head));while(t--){int u,v,w;scanf("%d%d%d",&u,&v,&w);add_edge(u,v,w);add_edge(v,u,w);}dijkstra(1);printf("%d",dis[n]);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
- 我的第一篇博客
- EXGCD
- 快速幂之二进制
- ubuntu win10双系统
- 关于Charles的用法总结
- Til the Cows Come Home
- hdu-2570-迷障(贪心)
- C中注释转化为C++中注释类型
- elasticsearch 启动时,指定jdk的版本
- 数据结构实验之图论九:最小生成树
- U—boot的启动步骤笔记
- 关于Joseph problem(约瑟夫环)问题的解法汇总
- etl工具nifi使用系列(二):简单数据处理processor的使用
- Q_learning在自然语言生成中的应用思考