loj#6038 「雅礼集训 2017 Day5」远行

分析

代码

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define _(x) int x
#define mp make_pair
#define pr pair<int,int>
int fa[],son[][],a[],siz[],r[];
inline void up(int x){siz[x]=siz[son[x][]]+siz[son[x][]]+;return;}
inline void rev(int x){swap(son[x][],son[x][]);r[x]^=;return;}
inline void pd(int x){if(r[x]){for(_(i)=;i<;i++)if(son[x][i])rev(son[x][i]);r[x]=;}return;}
inline int notroot(int x){return x==son[fa[x]][]||x==son[fa[x]][];}
inline void pushall(int x){if(notroot(x))pushall(fa[x]);pd(x);return;}
inline int gs(int x){return x==son[fa[x]][];}
inline void rot(int x){
    int y=fa[x],z=fa[y],b=gs(x),c=gs(y),d=son[x][!b];
    if(notroot(y))son[z][c]=x;
    fa[x]=z;if(d)fa[d]=y;
    son[y][b]=d,son[x][!b]=y;
    fa[y]=x;up(y),up(x);return;
}
inline void splay(int x){
    pushall(x);
    while(notroot(x)){
      int y=fa[x],z=fa[y];
      if(notroot(y)){
        if(gs(x)==gs(y))rot(y);
          else rot(x);
      }
      rot(x);
    }
    return;
}
inline void access(int x){for(int y=;x;y=x,x=fa[x])splay(x),son[x][]=y,up(x);return;}
inline void makeroot(int x){access(x),splay(x),rev(x);return;}
inline void spt(int x,int y){makeroot(x),access(y),splay(y);return;}
inline void link(int x,int y){makeroot(x);fa[x]=y;return;}
pr d[];
int n,m,q,f[],p1,p2,mx;
inline int sf(int x){return f[x]==x?x:f[x]=sf(f[x]);}
inline void work(int x,int y){
    spt(x,y);int res=siz[y]-;
    if(res>mx)mx=res,p1=x,p2=y;
    return;
}
inline void mer(int x,int y){
    pr a=d[sf(x)],b=d[sf(y)];
    mx=;link(x,y);
    work(a.fi,a.se),work(b.fi,b.se);
    work(a.fi,b.fi),work(a.fi,b.se);
    work(a.se,b.fi),work(a.se,b.se);
    f[sf(x)]=sf(y);d[sf(y)]=mp(p1,p2);
    return;
}
inline int que(int x){
    pr a=d[sf(x)];
    int res=;
    spt(a.fi,x),res=max(res,siz[x]-);
    spt(a.se,x),res=max(res,siz[x]-);
    return res;
}
int main(){
    int i,j,k,la=,opt,x,y;
    scanf("%d%d%d",&opt,&n,&q);
    for(i=;i<=n;i++)f[i]=i,d[i]=mp(i,i),siz[i]=;
    while(q--){
      scanf("%d",&k);
      if(k==)scanf("%d%d",&x,&y);
        else scanf("%d",&x);
      x^=(la*opt),y^=(la*opt);
      if(k==)mer(x,y);
        else printf("%d\n",la=que(x));
    }
    return ;
}