LA 3027 - X-Plosives

题目：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1645
分析：k个对应k个，要立即反应为环，随时加边，则可用并查集判环。
代码：

#include <cstdio>
#include <algorithm>
using namespace std;
const int Tmax=100005;
int fa[Tmax];
long long int ans;
int find(int x)
{
    return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main()
{
    int i,x,y,fx,fy;
    while(scanf("%d",&x)==1){
        ans=0;
        for(i=0;i<=Tmax;i++) fa[i]=i;
        while(x!=-1){
            scanf("%d",&y);
            fx=find(x);
            fy=find(y);
            if(fx==fy) ans++;
            else fa[fx]=fy;
            scanf("%d",&x);
        } 
        printf("%lld\n",ans);
    }
    return 0;
}