poj-2387 Til the Cows Come Home（最短路-spfa）

Til the Cows Come Home

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 57297		Accepted: 19472

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

Hint

INPUT DETAILS: 

There are five landmarks. 

OUTPUT DETAILS: 

Bessie can get home by following trails 4, 3, 2, and 1.

题目大意：一头奶牛要从谷仓（坐标为1的点）出发，前往一个点（坐标为n的点）去吃苹果，会给出T条双向路，两点之间只有有路奶牛才可以走到；因为她想尽可能多的睡觉，所以她从谷仓到终点走的路要尽可能的短，问你最短的路径是多少。

题目思路：本题就是一个经典的单源最短路问题，可以用dijkstra 或者 spfa 来解决。本文是利用spfa来解决的。代码如下：

#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
#define FIN freopen("in.txt","r",stdin)
#define fuck(x) cout<<'['<<x<<']'<<endl
using namespace std;
typedef pair<int, int>pii;
typedef long long LL;
const int MX = 1000 + 10;
const int maxn = 2000 + 10;

struct edge {
    int v, len;
    int nxt;
} E[maxn << 1];//注意边是双向边，所以数组得开两倍，不然会RE；
int head[MX], tot;

void init() {
    memset(head, -1, sizeof(head));
    tot = 0;
}

void add(int u, int v, int len) {
    E[tot].v = v;
    E[tot].len = len;
    E[tot].nxt = head[u];
    head[u] = tot++;
}

int dis[MX], vis[MX];

void spfa(int s) {
    memset(vis, 0, sizeof(vis));
    memset(dis, 0x3f, sizeof(dis));
    queue<int>Q;
    Q.push(s);
    dis[s] = 0;//将起点的耗时初始为0，从起点向终点更新。

    while(!Q.empty()) {
        int u = Q.front();
        Q.pop();
        vis[u] = 0;//此处为spfa与dijkstra最大的不同，每次拿出一个点，要将该点的标记清空，以便下次可以用来更新其他点；
        for(int i = head[u]; ~i; i = E[i].nxt) {
            int v = E[i].v;
            if(dis[v] > dis[u] + E[i].len) {//不断的用父节点来更新起点到子节点的最短路径；
                dis[v] = dis[u] + E[i].len;
                if(!vis[v]) {
                    vis[v] = 1;
                    Q.push(v);//如果该点不在队内，就入队；
                }
            }
        }
    }
}

int n, T;

int main() {
    //FIN;
    while(~scanf("%d%d", &T, &n)) {
        init();
        for(int i = 0; i < T; i++) {
            int u, v, len;
            scanf("%d%d%d", &u, &v, &len);
            add(u, v, len);
            add(v, u, len);//邻接表建立双向边；
        }
        spfa(n);
        printf("%d\n", dis[1]);
    }
    return 0;
}