HDU 3172 Virtual Friends 并查集+字典树

点击打开链接题目链接

Virtual Friends

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4611    Accepted Submission(s): 1299

Problem 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

Input file contains multiple test cases. 
The first line of each case indicates the number of test friendship nest.
each friendship nest begins with a line containing an integer F, the number of friendships formed in this frindship nest, 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

  

   1
3
Fred Barney
Barney Betty
Betty Wilma
  

 

Sample Output

  

   2
3
4
  

 

用字典树存放和查找每个代表字符串的数字

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
struct node
{
    int a;
    int next[52];
}tire[100010];
int head;
int xxx;
int father[100010];
int sum[100010];
int tree_add(char *s)
{
    int now=0;
    int i,l,id;
    l=strlen(s);
    for(i=0;i<l;i++)
    {
        if(s[i]<='z'&&s[i]>='a')
            id=s[i]-'a';
        else id=s[i]-'A'+26;
        if(tire[now].next[id]==-1)
        {
            tire[now].next[id]=++head;
        }
        now=tire[now].next[id];
    }
    if(tire[now].a)
        return tire[now].a;
    else
    {
        return tire[now].a=++xxx;
    }
}
int find(int x)
{
    if(x!=father[x])
        father[x]=find(father[x]);
    return father[x];
}
void unionn(int x,int y)
{
    father[x]=y;
    sum[x]=sum[x]+sum[y];
    sum[y]=sum[x];
}
int main()
{
    int t,n;
    char s1[25],s2[26];
    int i,j;
    while(scanf("%d",&t)!=EOF)
    {
        while(t--)
        {
            scanf("%d",&n);
            head=0;
            xxx=0;
            for(i=0;i<100010;i++)
            {
                father[i]=i;
                tire[i].a=0;
                sum[i]=1;
                for(j=0;j<52;j++)
                {
                    tire[i].next[j]=-1;
                }
            }
            while(n--)
            {
                scanf("%s %s",s1,s2);
                int x=tree_add(s1);
                int y=tree_add(s2);
                int nx=find(x);
                int ny=find(y);
                if(nx!=ny)
                {
                    unionn(nx,ny);
                }
                printf("%d\n",sum[nx]);
            }
        }
    }
    return 0;
}