hdu 3172 Virtual Friends

http://acm.hdu.edu.cn/showproblem.php?pid=3172

#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <algorithm>
#define maxn 200010
using namespace std;

int f[maxn],num[maxn];
int n;
int ans;

int find1(int x)
{
    if(x==f[x]) return x;
    return f[x]=find1(f[x]);
}

void merge1(int a,int b)
{
    int fa=find1(a);
    int fb=find1(b);
    if(fa!=fb)
    {
        f[fa]=fb;
        num[fb]+=num[fa];
    }
}

void inti()
{
    for(int i=1; i<maxn; i++)
    {
        f[i]=i;
        num[i]=1;
    }
}

int main()
{
    int t;
    while(scanf("%d",&t)!=EOF)
    {
        while(t--)
        {
            inti();
            char str1[maxn],str2[maxn];
            map<string,int>q;
            scanf("%d",&n);
            ans=1;
            for(int i=0; i<n; i++)
            {
                scanf("%s %s",str1,str2);
                if(q[str1]==0) q[str1]=ans++;
                if(q[str2]==0) q[str2]=ans++;
                //printf("####%d %d
",q[str1],q[str2]);
                merge1(q[str1],q[str2]);
                int f1=find1(q[str1]);
                printf("%d
",num[f1]);
            }
        }
    }
    return 0;
}