Til the Cows Come Home [最短路模板题]

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.

#include
#include
#include

using namespace std;

typedef pair <int, int> pii;
const int N = (int) 1e5 + 11;
const int M = (int) 1e6 + 11;
const int INF = (int) 0x3f3f3f3f;

struct Edge {
    int to, val, next;
    Edge () {}
    Edge (int _to, int _val, int _next) {
        to = _to; val = _val; next = _next;
    }
}edge[M << 1];

int n, m; // n是图中点数， m是图中边数 
int head[N], top;

void init (int n) {
    memset(head, -1, sizeof (int) * (n + 1));
    top = 0;
}

void Add (int u, int v, int val) {
    edge[top] = Edge (v, val, head[u]);
    head[u] = top ++;
}

void getmap(int m) {
    int u, v, val;
    while (m --) {
        scanf ("%d %d %d", &u, &v, &val);
        Add(u, v, val);
        Add(v, u, val);
    }
}

int dis[N];

void djk (int st, int ed) {
    memset (dis, 0x3f, sizeof (int) * (n + 1));
    priority_queue vector, greater > que;
    dis[st] = 0; que.push(make_pair(0, st));
    while (!que.empty()) {
        pii p = que.top(); que.pop();
        int v = p.second;
        if (dis[v] < p.first) continue;
        for (int i = head[v]; ~i; i = edge[i].next) {
            Edge e = edge[i];
            if (dis[e.to] > dis[v] + e.val) {
                dis[e.to] = dis[v] + e.val;
                que.push(make_pair(dis[e.to], e.to));
            }
        }
    }
    printf ("%d\n", dis[ed] == INF ? -1 : dis[ed]);
}

int main () {
    int T;
    scanf ("%d %d", &T, &n);
    init (n);
    getmap (T);
    djk (n, 1);
    return 0;
}