hdu 2860 Regroup（并查集）

int n,k,m;
int fa[100005], ability[100005];



int findFa(int x){
    if(fa[x]==x)
        return fa[x];
    int t=fa[x];
    fa[x]=findFa(fa[x]);
    ability[x] = min( ability[x],ability[t] );
    return fa[x];
}


int main(){

    while(scanf("%d%d%d",&n,&k,&m)!=EOF){
        rep(i,0,n-1){
            fa[i]=i;
            ability[i]=inf;
        }

        rep(i,1,k){
            int rate,belongTo;
            scanf("%d%d",&rate,&belongTo);
            ability[belongTo]=min( ability[belongTo],rate );
        }
        while(m--){
            char ope[5];
            scanf("%s",ope);
            if(ope[0]==‘A‘){
                int x,y;
                scanf("%d%d",&x,&y);
                int faTemp=findFa(y);
                if(y!=faTemp){
                    puts("Reject");
                }else{
                    ability[faTemp]=min( ability[faTemp],x );
                    puts("Accept");
                }
            }
            else if(ope[0]==‘M‘){
                int x,y;
                scanf("%d%d",&x,&y);
                int fx=findFa(x);
                int fy=findFa(y);
                if(fx!=x || fy!=y || fx==fy){
                    puts("Reject");
                }else{
                    ability[fx]=min( ability[fx],ability[fy] );
                    fa[fy]=fx;
                    puts("Accept");
                }
            }
            else{
                int x;
                scanf("%d",&x);
                int fx=findFa(x);
                if(x!=fx){
                    printf("Company %d is a part of company %d.\n",x,fx);
                }
                else{
                    if(ability[x]==inf){
                        printf("Company %d is empty.\n",x);
                    }else{
                        printf("Lowest rate: %d.\n",ability[x]);
                    }
                }
            }
        }
        puts("");

    }

    return 0;
}