Til the Cows Come Home
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 61545 | Accepted: 20880 |
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 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.
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
Source
题目概述:
单源最短路问题,输入 T 和 N 分别代表边数和顶点数,然后 接下来 T 行输入三个整数 分别代表起点,终点,权值,求出从顶点1 到 顶点 n 的最短路;
用G++交代码时 会有下面的报错信息:
F:\temp\18017574.134493\Main.cc: In function 'void Dijkstra(int)': F:\temp\18017574.134493\Main.cc:33: error: 'q' was not declared in this scope F:\temp\18017574.134493\Main.cc:33: error: '>>' should be '> >' within a nested template argument list
错误原因是:
priority_queue<P, vector<P>, greater<P>> que; 这样的代码里带有 >> 如果 GNU编译器把>>识别成 C++的输入表达式了 所以编译不过, 如果把 >> 改成 > > 也就是中间加个括号就可以了.
AC 代码 :
#define _CRT_SBCURE_NO_DEPRECATE
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define INF 0x7fffffff
#define ll long long
#define MAX_V 1005
struct edge {
int to, cost;
edge() {}
edge(int a, int b) {
to = a;
cost = b;
}
};
typedef pair<int, int> P;
vector<edge> G[MAX_V];
int d[MAX_V];
int v, n, m;
void Dijkstra(int st) {
priority_queue<P, vector<P>, greater<P> > que;
for (int i = 0; i <= n; i++) {
d[i] = INF;
}
v = - 1;
que.push(P(0,st));
d[st] = 0;
while (que.size()) {
P num = que.top(); que.pop();
v = num.second;
if (d[v] < num.first)
continue;
for (int i = 0; i < G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main() {
#ifdef LOCAL
freopen("Text.txt", "r", stdin);
#endif
int a, b, c;
while (~scanf("%d%d", &m, &n) && n && m) {
for (int i = 0; i < m; i++) {
scanf("%d%d%d", &a, &b, &c);
G[a].push_back(edge(b, c));
G[b].push_back(edge(a, c));
}
Dijkstra(1);
printf("%d\n", d[n]);
}
return 0;
}