UVA - 247 - Calling Circles（floyd算法）

题意：输出所有电话圈（电话圈：要求两个人直接或间接互相接通）

用floyd算法求出传递闭包，即把所有间接接通的两个人都找出来并且标记

然后再用并查集维护

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<list>
typedef long long ll;
typedef unsigned long long llu;
const int MAXN = 100 + 10;
const int MAXT = 10000 + 10;
const int INF = 0x3f3f3f3f;
const double pi = acos(-1.0);
const double EPS = 1e-6;
using namespace std;

int n, lur, m, g[MAXN][MAXN], fa[MAXN];

void floyd(){
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}

int find(int v){
    return fa[v] = fa[v] == v ? v : find(fa[v]);
}

void merge(int x, int y){
    int a = find(x), b = find(y);
    if(a < b)  fa[b] = a;
    else  fa[a] = b;
}

map<string, int> id;
map<int, string> id2;

int getid(string &s){
    if(id.count(s))  return id[s];
    id[s] = ++lur;
    id2[lur] = s;
    return lur;
}

int main(){
    int ca = 0;
    while(scanf("%d%d", &n, &m) == 2 && (n || m)){
        memset(g, INF, sizeof g);
        id.clear();
        id2.clear();
        for(int i = 0; i <= n + 1; ++i)  fa[i] = i;
        lur = 0;
        string tmp1, tmp2;
        int id1, id3;
        for(int i = 0; i < m; ++i){
            cin >> tmp1 >> tmp2;
            id1 = getid(tmp1);
            id3 = getid(tmp2);
            g[id1][id3] = 1;
        }
        floyd();
        if(ca)  printf("\n");
        printf("Calling circles for data set %d:\n", ++ca);
        for(int i = 1; i <= n; ++i)
            for(int j = i + 1; j <= n; ++j)
                if(g[i][j] != INF && g[j][i] != INF)  merge(i, j);
        set<int> f;
        for(int i = 1; i <= n; ++i){
            f.insert(find(i));
        }
        for(set<int>::iterator i = f.begin(); i != f.end(); ++i){
            int father = *i;
            bool flag = false;
            for(int j = 1; j <= n; ++j){
                if(find(j) != father)  continue;
                if(flag)  printf(", ");
                flag = true;
                cout << id2[j];
            }
            cout << endl;
        }
    }
    return 0;
}