ZCMU—1766

1766: Virtual Friends

Time Limit: 5 Sec   Memory Limit: 128 MB
[ Submit][ Status][ Web Board]

Description

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.

Input

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).

Output

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.

Sample Input

13

Fred Barney

Barney Betty

Betty Wilma

Sample Output

2

3

4

【分析】

没什么大问题...用map给每个人编号，然后并查集就可以了

并查集主要三个部分,join,find,merge

【代码】

#include <stdio.h>
#include <map>
#include <iostream>
using namespace std;
map<string,int> a;
int father[100010];
int num[100010];


int find(int x)
{
    int i=x;
    while(i!=father[i])
    {
        i=father[i];
    }
    int j=x;
    while(j!=i)
    {
        int xx=father[j];
        father[j]=i;
        j=xx;
    }
    return i;
}


int main()
{
    int pp;scanf("%d",&pp);
    while (pp--)
    {
        int n;scanf("%d",&n);
        for (int i=0;i<=100000;i++)
        {
            father[i]=i;
            num[i]=1;
        }
        a.clear();
        int flag=1;
        for (int i=0;i<n;i++)
        {
            string s1,s2;
            cin>>s1>>s2;
            if (a[s1]==0)
            {
                a[s1]=flag;
                flag++;
            }
            if (a[s2]==0)
            {
                a[s2]=flag;
                flag++;
            }
            int x=find(a[s1]);
            int y=find(a[s2]);
            if (x!=y)
            {
                father[x]=y;
                num[y]+=num[x];
            }
            printf("%d\n",num[y]);
        }
    }
}