hdu 3172

#include <iostream>
#include <cstdio>
#include <string>
#include <map>
#include <cstdlib>

using namespace std;

int k=0;
const int M = 100005;
int a[M];
int b[M];
map<string,int> G;

void reinit()
{
	if(!G.empty()) G.clear();
	k=0;
    memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
}

int finds(string s)
{
	if(G.find(s)!=G.end())
		return G[s];
	else {G[s]=k;return k;}
}
int findG(int r)
{
	int i=r;
	while(a[i]!=i)
	{
		i = a[i];
	}

	/*int aa = r;
	int bb = r;
	while(a[aa]!=aa)
	{
		bb = a[aa];
		a[aa]=i;
		aa = bb; 
	}*/
	return i;
}
void unions(int aindex,int bindex)
{
	a[bindex]=aindex;
	if(aindex!=bindex)b[aindex]+=b[bindex];//这里本来没判断，额错了，让我把所有的cout,cin全换了。。。。！！
	printf("%d\n",b[aindex]);
}
void init()
{
	int test;
	while(scanf("%d",&test)!=EOF)
	{
		for(int j=0;j<test;j++){
		int n;
		scanf("%d",&n);
		reinit();

		for(int i=0;i<n;i++)
		{
			string st,str;
			char sst[25],sstr[25];
			scanf("%s%s",sst,sstr);
			st = sst;
			str = sstr;

			int aindex = finds(st);
			if(aindex==k) {a[aindex]=aindex;b[aindex]=1;k++;}
			int bindex = finds(str);
			if(bindex==k){a[bindex]=bindex;b[bindex]=1;k++;}

			int ast = findG(aindex);
			int bstr = findG(bindex);

			unions(ast,bstr);

		}
		}
	}
}
int main()
{
	init();
	return 0;
}