Silver Cow Party（最短路 很有意思的题）

Silver Cow Party

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 3268

Description

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires T_i (1 ≤ T_i ≤ 100) units of time to traverse.

Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route with the shortest time. A cow's return route might be different from her original route to the party since roads are one-way.

Of all the cows, what is the longest amount of time a cow must spend walking to the party and back?

Input

Line 1: Three space-separated integers, respectively:  N,  M, and  X 
Lines 2.. M+1: Line  i+1 describes road  i with three space-separated integers:  A_i,  B_i, and  T_i. The described road runs from farm  A_i to farm  B_i, requiring  T_i time units to traverse.

Output

Line 1: One integer: the maximum of time any one cow must walk.

 

求两次最短路，第一次求x到其余各点的最短路，第二次求各点到x的最短路。前者易于解决，直接应用spfa或其他最短路算法即可，后者要先将邻接矩阵转置再执行最短路算法。

为什么进行矩阵转置？比如u（u ！= x）到x的最短路为<u,v1>,<v1,v2>,<v2,v3>,...,<vi, x>，这条路径在转置邻接矩阵后变成<x,vi>,...,<v3,v2>,<v2, v1>,<v1,u>.于是乎，在转置邻接矩阵后，执行最短路算法求出x到u的最短路<x,vi>,...,<v3,v2>,<v2, v1>,<v1,u>即可得到转置前u到x的最短路。

#include <iostream>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
const int INF = 0x3fffffff;
int n, m, x;
int map[1005][1005];
int visited[1005];
int dis1[1005];
int dis2[1005];
    //模板函数，对数组引用
template<size_t N>
void spfa(int (&d)[N]) {
    queue<int> que;
    que.push(x);
    d[x] = 0;
    visited[x] = 1;
    int cur;
    while (!que.empty()) {
        cur = que.front();
        que.pop();
        visited[cur] = 0;
        for (int i = 1; i <= n; ++i) {
            if (map[cur][i] + d[cur] < d[i]) {
                d[i] = map[cur][i] + d[cur];
                if (!visited[i]) {
                    visited[i] = 1;
                    que.push(i);
                }
            }
        }
    }
}
void transform() {
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= i; ++j) {
            swap(map[i][j], map[j][i]);
        }
    }
}
int main() {
        //freopen("in.txt", "r", stdin);
    while (cin >> n >> m >> x) {
            //initialize
        for (int i = 1; i <= n; ++i) {
            dis1[i] = dis2[i] = INF;
            visited[i] = 0;
            for (int j = 1; j <= n; ++j) {
                map[i][j] = (i == j) ? 0 : INF;
            }
        }
        int x, y, z;
        for (int i = 0; i < m; ++i) {
            cin >> x >> y >> z;
            map[x][y] = z;
        }
        spfa(dis1);
        transform();
        spfa(dis2);
        int ans = -1;
        for (int i = 1; i <= n; ++i) {
            if (dis1[i] != INF && dis2[i] != INF) {
                ans = max(dis1[i] + dis2[i], ans);
            }
        }
        cout << ans << endl;
    }
}