1899-Virtual Friends(map+并查集) ZCMU

最新推荐文章于 2022-04-08 22:38:03 发布

原创最新推荐文章于 2022-04-08 22:38:03 发布 · 522 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#map #并查集

练习专栏收录该内容

160 篇文章

订阅专栏

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

Fred Barney

Barney Betty

Betty Wilma

Sample Output

代码

#include<bits/stdc++.h>
const int MAX=100005;
using namespace std;
int farther[MAX],fri[MAX];
//fri[i]为编号为i的人的朋友圈人数
map<string,int> mark; //map记录每个人的编号
//初始化
void init()
{
    for(int i=1;i<=MAX;i++)
    {
        farther[i]=i; fri[i]=1; //每个人初始的朋友圈都是1，因为只有自己
    }
    mark.clear();
}
//并查集找父亲
int getfarther(int x)
{
    if(x!=farther[x])
        farther[x]=getfarther(farther[x]);
    return farther[x];
}
void union_set(int x,int y)
{
    x=getfarther(x);
    y=getfarther(y);
    if(x==y) //如果两人已经是朋友，那么只要输出一个人的朋友圈就可
        printf("%d\n",fri[x]);
    else ////结交了朋友圈外的朋友的时候，直接指定一个人的朋友圈为最后要输出的朋友圈，然后输出他们两个的朋友圈之和
    {
        farther[x]=y;
        fri[y]+=fri[x];
        printf("%d\n",fri[y]);
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,num=1;
        string p1,p2;
        scanf("%d",&n); init();
        for(int i=1;i<=n;i++)
        {
            cin>>p1>>p2;
            if(!mark[p1])
                mark[p1]=num++;
            if(!mark[p2])
                mark[p2]=num++;
            union_set(mark[p1],mark[p2]);
        }
    }
    return 0;
}