[最短路]pku2387-Til the Cows Come Home
来源:互联网 发布:诺基亚E71 软件下载 编辑:程序博客网 时间:2024/05/22 14:24
http://acm.pku.edu.cn/JudgeOnline/problem?id=2387
Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8663 Accepted: 2864
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
题目大意:给出一个无向图(可能有重边),求点n到点1的最短路径。
分析:简单题。不过,本题有很猥琐的地方:先输入边数,再输入点数.不注意的话就会re了。
codes:
- [最短路]pku2387-Til the Cows Come Home
- PKU2387 Til the Cows Come Home
- 最短路----Til the Cows Come Home
- Til the Cows Come Home 【最短路】
- Til the Cows Come Home 【最短路】
- POJ 2387Til the Cows Come Home(最短路)
- Til the Cows Come Home(最短路)
- POJ 2387 Til the Cows Come Home 最短路-Dijkstra
- Til the Cows Come Home poj2387的最短路题目
- 最短路 (Dijstra) Til the Cows Come Home
- POJ 2387 || Til the Cows Come Home(最短路,dijkstra
- poj 2387 Til the Cows Come Home(最短路)
- poj2387- Til the Cows Come Home (最短路)
- poj 2387 Til the Cows Come Home -- 最短路dijstra
- poj2387~Til the Cows Come Home(最短路dijkstra)
- POJ 2387 Til the Cows Come Home 最短路
- POJ 2387 Til the Cows Come Home【最短路】
- POJ 2387 Til the Cows Come Home (最短路)
- struts2+spring+hibernate+json+jquery+flexigrid开发笔记-封装视图层增删改查
- 中国Internet与网民生活的变迁
- 负向零宽断言 备忘录
- 百度划词查询小工具
- C++0x尝鲜:用lambda表达式模拟Ruby的过程对象
- [最短路]pku2387-Til the Cows Come Home
- 夜空为什么是黑暗的?
- oracle忘记sys密码解决
- HOME --2 future sketches
- RFT 8.1
- [原创]为单位编写的航空货物进港管理系统(VB6.0)
- 关于e.Item.Cells的问题,VS2008的GridView VS. VS2003的DataGrid
- 想找一份Ruby on rails的工作,我应该知道哪些知识?
- 关于二级指针的使用测试小例子,仅供测试--参数传递的时候用指针最好,因为压栈的时候指针,只是压入一个地址的值,最多4个字节(32位机上),提供的3个测试例子,基于VC6.0的环境。