uva 11503 Virtual Friends

#include<bits/stdc++.h>
using namespace std;
int par[200005],ar[200005],a,b;
int Find(int v)
{
    if(par[v]==v)return v;
    return par[v]=Find(par[v]);
}
union_set(int u,int v)
{
    int a,b;
    a=Find(u);
    b=Find(v);
    if(a!=b)
    {
        par[b]=a;
        ar[a]+=ar[b];
    }
}
int main()
{
    int t;
    cin>>t;
    while(t>0)
    {
        t--;
        int n,k=1;;
        cin>>n;
        string a,b;
        map<string,int>mp;
        for(int i=0;i<n;i++)
        {
            cin>>a>>b;
            if(mp.find(a)==mp.end())
            {
                mp[a]=k;
                par[k]=k;
                ar[k]=1;
                k++;
            }
            if(mp.find(b)==mp.end())
            {
                mp[b]=k;
                par[k]=k;
                ar[k]=1;
                k++;
            }
            union_set(mp[a],mp[b]);
            cout<<ar[Find(mp[a])]<<endl;
        }
        memset(ar,0,sizeof(ar));
    }
    return 0;
}