BNU 51275 道路修建 Large 并查集

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long LL;
const int N=1e5+5;
int fa[N],r[N],p[N],vis[N],n;
void init()
{
   for(int i=1;i<=n;++i)
   {
      fa[i]=i;
      p[i]=r[i]=0;
      vis[i]=-1;
   }
}
int find(int x)
{
    if(x==fa[x])return x;
    return find(fa[x]);
}
bool Union(int u,int v,int t)
{
    u=find(u);
    v=find(v);
    if(u==v)return false;
    if(r[u]>r[v])
    {
       fa[v]=u;
       p[v]=t;
    }
    else
    {
       fa[u]=v;
       p[u]=t;
       if(r[u]==r[v])++r[v];
    }
    return true;
}
int getans(int u,int v)
{
    int now=0,x=u,ans;
    while(1)
    {
       vis[x]=now;
       if(x==fa[x])break;
       now=max(now,p[x]);
       x=fa[x];
    }
    x=v,now=0;
    while(1)
    {
       if(vis[x]!=-1)
       {
           now=max(now,vis[x]);
           ans=now;
           break;
       }
       now=max(now,p[x]);
       x=fa[x];
    }
    x=u;
    while(1)
    {
       vis[x]=-1;
       if(x==fa[x])break;
       x=fa[x];
    }
    return ans;
}
int main()
{
    int T,la,m;
    scanf("%d",&T);
    while(T--)
    {
       scanf("%d%d",&n,&m);
       init(),la=0;
       int op,u,v,blk=n;
       for(int i=1;i<=m;++i)
       {
          scanf("%d%d%d",&op,&u,&v);
          u^=la,v^=la;
          if(op)
          {
              int x=find(u);
              int y=find(v);
              if(x!=y)
                  la=0;
              else la=getans(u,v);
              printf("%d\n",la);
          }
          else
          {
              if(Union(u,v,i))blk--;
              la=blk;
              printf("%d\n",la);
          }
       }
    }
    return 0;
}