POJ 2387 Til the Cows Come Home
来源:互联网 发布:企业版域名注册通 编辑:程序博客网 时间:2024/06/07 18:35
Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 56018 Accepted: 19004
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题目大意是
一个很普通很简单的入门的最短路题目。用的是dijkstra算法。
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int inf=0x3f3f3f3f;int map[1010][1010];int dis[1010];int book[1010];int t,n;void dijkstra(){for(int i=1;i<=n;i++) dis[i]=map[n][i];memset(book,0,sizeof(book));book[n]=1;for(int i=1;i<=n-1;i++){int min=inf,flag;for(int j=1;j<=n;j++){if(!book[j]&&dis[j]<min){min=dis[j];flag=j;}}book[flag]=1;for(int j=1;j<=n;j++){if(!book[j]&&dis[j]>dis[flag]+map[flag][j]){dis[j]=dis[flag]+map[flag][j];}}}}int main(){while(~scanf("%d%d",&t,&n)){memset(map,inf,sizeof(map));while(t--){int x,y,time;cin>>x>>y>>time;if(map[x][y]>time){map[x][y]=map[y][x]=time;}}dijkstra();cout<<dis[1]<<endl;}}
阅读全文
0 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
- 索引与优化
- 理解gluPerspective和gluLookAt的关系
- Java 并发专题 :FutureTask 实现预加载数据 在线看电子书、浏览器浏览网页等
- openstack attach volume过程详解
- 机器学习笔记——逻辑回归模型及其代价函数推导
- POJ 2387 Til the Cows Come Home
- ES6学习笔记:迭代器与生成器
- 每日MySQL之008:MySQL权限简介
- 基于Windows安装配置Apache、Tomcat、IIS服务器,Apache、Tomcat、IIS服务器对比
- 谜题1:奇偶性
- CCF认证201403第三题(提交未通过)
- Java 并发专题 : Timer的缺陷 用ScheduledExecutorService替代
- 【安卓基础】06 SQLiteHelper 对安卓数据库操作
- ruby02