2562. Virtual Friends

单点时限: 5.0 sec

内存限制: 256 MB

These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends, their friends’ friends, their friends’ friends’ friends, and so on), has become an addictive hobby. Just as some people collect stamps, other people collect virtual friends.

Your task is to observe the interactions on such a website and keep track of the size of each person’s network.

Assume that every friendship is mutual. If Fred is Barney’s friend, then Barney is also Fred’s friend.

输入格式

The first line of input contains one integer specifying the number of test cases to follow. Each test case begins with a line containing an integer $F$, the number of friendships formed, which is no more than $100~000$. Each of the following $F$ lines contains the names of two people who have just become friends, separated by a space. A name is a string of $1$ to $20$ letters (uppercase or lowercase).

输出格式

Whenever a friendship is formed, print a line containing one integer, the number of people in the social network of the two people who have just become friends.

样例

Input
1
3
Fred Barney
Barney Betty
Betty Wilma
Output
2
3
4

246 人解决,296 人已尝试。

424 份提交通过,共有 1185 份提交。

2.4 EMB 奖励。

创建: 11 年,4 月前.

修改: 2 年,10 月前.

最后提交: 1 周前.

来源: Waterloo local 2008

题目标签