POJ 2387 Til the Cows Come Home dijkstra算法 用邻接表和邻接矩阵
来源:互联网 发布:js日历控件 编辑:程序博客网 时间:2024/05/18 18:44
题目如下:
Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 27726 Accepted: 9353
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.
求最短路,经典的dijkstra算法直接解决了,分别用邻接表和邻接矩阵存图。
邻接矩阵版:
邻接表版:
- POJ 2387 Til the Cows Come Home dijkstra算法 用邻接表和邻接矩阵
- POJ 2378. Til the Cows Come Home [dijkstra模版] [邻接矩阵]
- poj 2387 Til the Cows Come Home(dijkstra算法)
- POJ 2387 Til the Cows Come Home(Dijkstra算法)
- POJ 2387 Til the Cows Come Home(Dijkstra算法)
- Til the Cows Come Home(poj 2387 Dijkstra算法)
- poj2387 Til the Cows Come Home(邻接矩阵,邻接表 )
- poj 2387-Til the Cows Come Home-dijkstra
- POJ 2387 Til the Cows Come Home 最短路-Dijkstra
- POJ 2387 Til the Cows Come Home (Dijkstra)
- POJ 2387 Til the Cows Come Home(Dijkstra简单题)
- Til the Cows Come Home - POJ 2387 Dijkstra
- POJ 2387 Til the Cows Come Home(Dijkstra判重边)
- POJ 2387 || Til the Cows Come Home(最短路,dijkstra
- POJ 2387 Til the Cows Come Home (dijkstra)
- Dijkstra-POJ-2387-Til the Cows Come Home
- 2387 poj Til the Cows Come Home【dijkstra,经典&&基础】
- POJ 2387 Til the Cows Come Home(Dijkstra)
- 一周完成的小项目-某银行短信发送
- 64位win8.1系统 安装plsql
- 如何在网上获取国际、国内的学术会议消息
- 英文缩写
- 科技博客的价值
- POJ 2387 Til the Cows Come Home dijkstra算法 用邻接表和邻接矩阵
- 什么是asp.net三层架构?
- 小编带给你一些在停车场驾驶的秘籍和诀窍
- 线程同步(synchronized)
- 电子商务创业失败的总结
- Qt中设置win7的系统时间
- LeetCode: Letter Combinations of a Phone Number [018]
- opensession 和getcurrentsession区别
- Ubuntu下MPI配置以及Codeblock配置