题目1100：最短路径（最短路径问题进阶dijkstra算法）

题目链接：http://ac.jobdu.com/problem.php?pid=1100

详细链接：https://github.com/zpfbuaa/JobduInCPlusPlus

参考代码：

//
//  1100 最短路径.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 19/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#define MAX_SIZE 110

using namespace std;

int tree[MAX_SIZE];
int deep[MAX_SIZE];
int len[MAX_SIZE][MAX_SIZE];

int findRoot(int x){
    if(x != tree[x])
        tree[x] = findRoot(tree[x]);
    return tree[x];
}
void init(int n){
    for(int i =  ; i < n ; i++){
        deep[i] = ;
        tree[i] = i;
        len[i][i] = ;
    }
}

void unionTree(int a, int b){
    a = findRoot(a);
    b = findRoot(b);
    if(a==b) return ;
    if(deep[a] >= deep[b])
    {
        deep[a] += deep[b];
        tree[b] = a;
    }
    else
    {
        deep[b] += deep[a];
        tree[a] = b;
    }
}

int myPow(int a, int b)//取模
{
    int ret = ;
    while(b--)
        ret = (ret*a)%;
    return ret;
}

int n,m;

int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        init(n);
        int a, b;
        int x, y;
        int dist;
        for(int i =  ; i < m ; i++){
            scanf("%d%d",&x,&y);
            a = findRoot(x);
            b = findRoot(y);
            if(a==b) continue;
            dist = myPow(,i);
            for(int j =  ; j < n ; j++){
                if(a!=findRoot(j)) continue;
                for(int k =  ; k < n ; k++){
                    if(b!=findRoot(k)) continue;
                    len[j][k] = len[k][j] = (len[j][x]+dist+len[y][k])%;
                }
            }
            unionTree(x, y);
        }
        x = findRoot();
        for(int i =  ; i < n ; i++){
            if(findRoot(i) != x)
                printf("-1\n");
            else
                printf("%d\n", len[][i]);
        }
    }
    return ;
}

/**************************************************************
    Problem: 1100
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:10 ms
    Memory:1568 kb
****************************************************************/