hdu 3172(并查集+字典树映射)

/*
*  并查集+字典树 
*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>

using namespace std;

const int N = 21;
const int M = 200005;

int cs;
int parent[M];
char strA[N], strB[N];
struct node {
    int c;
    node *child[52];
    node() {
        c = 0;
        for (int i=0; i<52; ++i) child[i] = NULL;
    }
}*root;

int insert(char str[]) {//字典树功能：将名字映射成代表该名字的一个整数 
    node *p = root;
    int len = strlen(str);
    for (int k,i=0; i<len; ++i, p=p->child[k]) {
        if (str[i]>='a' && str[i]<='z') k = str[i] - 'a';
        else k = str[i] - 'A' + 26;
        if (!p->child[k]) p->child[k] = new node();
//        else if (i==len-1 && p->child[k]->c>0) return p->child[k]->c;
    }
    if (p->c) return p->c;
    return p->c = ++cs;
}

void UFset() {
    for (int i=1; i<M; ++i) parent[i] = -1;
}

int Find(int x) {
    int s;
    for (s=x; parent[s]>0; s=parent[s]);
    while (s != x) {//路径压缩 
        int tmp = parent[x];
        parent[x] = s;
        x = tmp;
    }
    return s;
//    if (parent[x] > 0) parent[x] = Find(parent[x]);
}

int Union(int r1, int r2) {
    int tmp = parent[r1] + parent[r2];
    if (parent[r1] > parent[r2]) parent[r1] = r2, parent[r2] = tmp;
    else parent[r2] = r1, parent[r1] = tmp;
    return tmp;
}

void del(node *p) {
    for (int i=0; i<52; ++i) {
        if (p->child[i]) del(p->child[i]);
    }
    delete p;
    p = NULL;
}

int main() {
    int t;
    while (scanf ("%d", &t) != EOF) {
        while (t--) {
            int n;
            scanf ("%d", &n);
            cs = 0;
            UFset();
            root = new node();
            while (n--) {
                scanf ("%s%s", strA, strB);
                int a = insert(strA);
                int b = insert(strB);
                int r1 = Find(a);
                int r2 = Find(b);
                if (r1 != r2) printf ("%d\n", abs(Union(r1, r2)));    
                else printf ("%d\n", abs(parent[r1]));
            }
            del(root);
        }
    }
    return 0;
}