uva793

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int par[500005];
int g[500005];
int find_par(int x)
{
    return x==par[x]?x:find_par(par[x]);
}
void union_(int x,int y)
{
    int a=find_par(x);
    int b=find_par(y);
    par[a]=b;
}
int success;
int unsuccess;
int main()
{
    int cases;
    scanf("%d",&cases);
    int n;
    int a,b;
    while(cases--)
    {
        success=0;
        unsuccess=0;
        scanf(" %d\n",&n);
        memset(g,0,sizeof(g));
        for(int i=1; i<=n; i++)
            par[i]=i;
        while(1)
        {
            char s=getchar();
            if(s!='c' && s!='q') break;
            if(s=='c')
            {
                scanf("%d%d",&a,&b);
                getchar();
                union_(a,b);
            }
            else
            {
                 scanf("%d%d",&a,&b);
                getchar();
                if(find_par(a)==find_par(b))
                    success++;
                else
                    unsuccess++;
            }
        }
        cout<<success<<","<<unsuccess<<endl;
        if(cases) cout<<endl;
    }
    return 0;
}

注意这里用getchar()处理数据