poj 1988 &&poj 2524

#include<iostream>
using namespace std;
#include<cstdio>

const int maxn=50005;
int pre[maxn],num[maxn],ans[maxn];

void init()
{
    int i;
    for(i=0;i<maxn;i++){
        pre[i]=i;
        num[i]=1;
        ans[i]=0;
    }
}

int find(int x)
{
    if(x==pre[x]) return x;
    else {
        int t=pre[x];
        pre[x]=find(t);
        ans[x]+=ans[t];
        return pre[x];
    }
}

void Union(int a,int b)
{
    int fa=find(a);
    int fb=find(b);
    if(fa!=fb){
        pre[fa]=fb;
        ans[fa]=+num[fb];//cube下面数目的更新
        num[fb]+=num[fa];//cube数目的更新
        return ;
    }
}

int main()
{
    int n;
    char str[5];
    while(~scanf("%d",&n)){
    init();
    int x,y,fx,fy;
    while(n--){
        scanf("%s",str);
       if(str[0]=='M'){
           scanf("%d%d",&x,&y);
           Union(x,y);
       }
       else{
           scanf("%d",&x);
           fx=find(x);
           printf("%d\n",ans[x]);
       }
    }
    }
    return 0;
}

#include<iostream>
using namespace std;
#include<cstdio>
const int maxn=50010;
int pre[maxn];

int find(int x)
{
    return x==pre[x]?x:pre[x]=find(pre[x]);
}

void Union(int x,int y)
{
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy)
      pre[fx]=fy;
}

int main()
{
    int n,m,a,b;
    int ncase=1;
    while(scanf("%d%d",&n,&m),n+m){
        for(int i=0;i<maxn;i++)
          pre[i]=i;
        while(m--){
            scanf("%d%d",&a,&b);
            Union(a,b);
        }
        int ans=0;
        for(int i=1;i<=n;i++){
            if(pre[i]==i)
              ans++;
        }
        printf("Case %d: %d\n",ncase++,ans);
    }
    return 0;
}