POJ-2387 Til the Cows Come Home 【最短路+Dijkstra】

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

---

 Dijkstra模板题

---

Code:

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<string>

using namespace std;
#define INF 0x3f3f3f3f
const int maxn = 2000 + 5;

struct Edge {
    int from, to, dist;
};

struct Node {
    int d, u;
    bool operator < (const Node& rhs) const {
        return d > rhs.d;
    }
};

struct Dijkstra {
    int n, m;
    vector<Edge> edges; //保存边信息
    vector<int> G[maxn]; //出边表
    int d[maxn];
    bool done[maxn];

    void init(int n) {
        this->n = n;
        memset(done, 0, sizeof(done));
        memset(d, INF, sizeof(d));
        for (int i = 0; i <= n; ++i)
            G[i].clear();
        edges.clear();
    }

    void AddEdge(int from, int to, int dist) {
        edges.push_back((Edge){from, to, dist});
        m = edges.size();
        G[from].push_back(m-1);
    }

    void dijkstra(int s) {
         priority_queue<Node> Q;
         d[s] = 0;
         Q.push((Node){d[s], s});
         while(!Q.empty()) {
             Node x = Q.top(); Q.pop();
             int u = x.u;
             if (done[u]) continue;
             done[u] = true;
             int len = G[u].size();
             for (int i = 0; i < len; ++i) {
                 Edge &e = edges[G[u][i]];
                 if (d[e.to] > d[u] + e.dist) {
                    d[e.to] = d[u] + e.dist;
                    Q.push((Node){d[e.to], e.to});
                 }
             }
         }
    }

};

Dijkstra di;

int main() {
    int n, m, a, b, c;
    while(cin>>m>>n) {
        di.init(n);
        while(m--) {
            cin>>a>>b>>c;
            di.AddEdge(a, b, c);
            di.AddEdge(b, a, c);
        }
        di.dijkstra(1);
        cout<<di.d[n]<<endl;
    }

    return 0;
}