hdoj 3631 Shortest Path

类型：最短路

题目：http://acm.hdu.edu.cn/showproblem.php?pid=3631

来源：2010 Asia Regional Tianjin Site —— Online Contest

思路：n <= 300，使用floyd算法求最短路，这样查询时间为O(1)，时间复杂度为300^3【思路一定要开阔！！！】

// hdoj 3631 Shortest Path
// ac 296MS 856K
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;

#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(i = (a); i > (b); --i)
#define FORDE(i,a,b) for(i = (a); i >= (b); --i)
#define max(a,b) ((a) > (b)) ? (a) : (b)
#define min(a,b) ((a) < (b)) ? (a) : (b)
#define clr(a,b) memset(a,b,sizeof(a))
#define PB(x) push_back(x)

const int MAXN = 500;
const int MAXM = 200000;
const int hash_size = 25000002;
const int INF = 0x7f7f7f7f;

int n, m, q;
bool vis[MAXN];
int dd[MAXN], dist[MAXN], cnt0[MAXN];
int mp[MAXN][MAXN];
int cnt;

void Floyd(int x,int n) {
    int k, i, j;

    FOR(k, 0, n) FOR(j, 0, n)
        if( mp[k][x] != INF && mp[x][j] != INF && mp[k][j] > mp[k][x] + mp[x][j] )
            mp[k][j] = mp[k][x] + mp[x][j];
}

int main()
{
    int i, j, u, v, w;
    int cas = 1;

    while(scanf("%d %d %d", &n, &m, &q) == 3) {
        if(n == 0 && m == 0 && q == 0)
            break;
        while(1) {
            if(n == 0 && m == 0 && q == 0)
                break;
            FOR(i, 0, n) FOR(j, 0, n)
                mp[i][j] = INF;
            clr(dd, 0);
            FOR(i, 0, m) {
                scanf("%d %d %d", &u, &v, &w);
                if(mp[u][v] != 0)
                    mp[u][v] = min(mp[u][v], w);
                else
                    mp[u][v] = w;
            }
            FOR(i, 0, n)
                mp[i][i] = 0;
            printf("Case %d:\n", cas++);
            FOR(i, 0, q) {
                scanf("%d %d", &u, &v);
                if(u == 0) {
                    if(dd[v] == 0) {
                        dd[v] = 1;
                        Floyd(v, n);
                    }
                    else
                        printf("ERROR! At point %d\n", v);
                }
                else {
                    scanf("%d", &w);
                    if(dd[v] == 0 || dd[w] == 0)
                        printf("ERROR! At path %d to %d\n", v, w);
                    else {
                        if(mp[v][w] == INF)
                            printf("No such path\n");
                        else
                            printf("%d\n", mp[v][w]);
                    }
                }
            }
            scanf("%d %d %d", &n, &m, &q);
            if(!(n == 0 && m == 0 && q == 0))
                printf("\n");
        }
        if(n == 0 && m == 0 && q == 0)
            break;
    }
    return 0;
}