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 100Sample Output
90Hint
INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.迪杰斯特拉优化版本板子(注意有向图和无向图来判断要不要双向建边):
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <list>
#include <set>
#include <istream>
#include <sstream>
#include <iomanip>
#include <numeric>
#define rep(i,j) for(int i = 1;i <= j;i++)
#define gao(x) cerr << #x << "->" << x << endl
#define gen(x) x##_
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
using namespace std;
int t, n;
struct edge {
int v, w;
edge(int v,int w):v(v),w(w){}
};
vector<edge>mp[2020];
int dis[2020];
bool vis[2020];
struct node {
int v, dis;
node(int v,int dis):v(v),dis(dis){}
const bool operator < (const node &a) const {
return a.dis < dis;
}
};
priority_queue<node> q;
void stra() {
for (register int i = 1; i <= n; i++) {
dis[i] = INF;
}
dis[1] = 0;
q.push(node(1, 0));
while (!q.empty()) {
node cur = q.top();
q.pop();
if (vis[cur.v]) continue;
vis[cur.v] = true;
for (register int i = 0; i < mp[cur.v].size(); i++) {
edge to = mp[cur.v][i];
if (vis[to.v]) continue;
if (dis[to.v] > to.w + dis[cur.v]) {
dis[to.v] = to.w + dis[cur.v];
q.push(node(to.v, dis[to.v]));
}
}
}
cout << dis[n] << endl;
return;
}
void solve() {
cin >> t >> n;
while (t--) {
int u, v, w;
cin >> u >> v >> w;
mp[u].push_back(edge(v, w));
mp[v].push_back(edge(u, w));
}
stra();
return;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
return 0;
}
/*
*/