XJOI网上同步训练DAY2 T2

  1 #include<algorithm>
  2 #include<cstdio>
  3 #include<cmath>
  4 #include<cstring>
  5 #include<iostream>
  6 int ch[500005][2],rev[500005],sum[500005],o[500005];
  7 int fa[500005];
  8 int c[500005][3],st[500005],ans;
  9 int n,m,tot;
 10 int read(){
 11     int t=0,f=1;char ch=getchar();
 12     while (ch<‘0‘||ch>‘9‘){if (ch==‘-‘) f=-1;ch=getchar();}
 13     while (‘0‘<=ch&&ch<=‘9‘){t=t*10+ch-‘0‘;ch=getchar();}
 14     return t*f;
 15 }
 16 bool isroot(int x){
 17     return ch[fa[x]][0]!=x&&ch[fa[x]][1]!=x;
 18 }
 19 void pushdown(int x){
 20     int l=ch[x][0],r=ch[x][1];
 21     if (rev[x]){
 22         rev[x]^=1;
 23         rev[l]^=1;rev[r]^=1;
 24         std::swap(ch[x][0],ch[x][1]);
 25     }
 26 }
 27 void updata(int x){
 28     int l=ch[x][0],r=ch[x][1];
 29     sum[x]=o[x]^sum[l]^sum[r];
 30 }
 31 void rotate(int x){
 32     int y=fa[x],f=ch[y][0]!=x;
 33     if (ch[y][f]=ch[x][f^1]) fa[ch[y][f]]=y;
 34     fa[x]=fa[y];if (!isroot(y)) ch[fa[y]][ch[fa[y]][0]!=y]=x;
 35     updata(ch[fa[y]=x][f^1]=y);
 36 }
 37 void splay(int x){
 38     int top=0;st[++top]=x;
 39     for (int i=x;!isroot(i);i=fa[i])
 40      st[++top]=fa[i];
 41     for (int i=top;i;i--) pushdown(st[i]);
 42     while (!isroot(x)){
 43         int y=fa[x],z=fa[y];
 44         if (!isroot(y)){
 45             if (ch[y][0]==x^ch[z][0]==y) rotate(x);
 46             else rotate(y);
 47         }
 48         rotate(x);
 49     } 
 50     updata(x);
 51 }
 52 void access(int x){
 53     for (int t=0;x;t=x,x=fa[x]){
 54         splay(x);
 55         o[x]^=sum[t]^sum[ch[x][1]];
 56         ch[x][1]=t;
 57         updata(x);
 58     }
 59 }
 60 void makeroot(int x){
 61     access(x);splay(x);rev[x]^=1;
 62 }
 63 void link(int x,int y){
 64     makeroot(x);makeroot(y);fa[x]=y;o[y]^=sum[x];updata(y);
 65 }
 66 void cut(int x,int y){
 67     makeroot(y);access(y);
 68     splay(x);
 69     fa[x]=0;o[y]^=sum[x];updata(y);
 70 }
 71 void add(int x,int y){
 72     access(x);
 73     splay(x);
 74     o[x]^=y;
 75     updata(x);
 76 }
 77 int main(){
 78     int Id=read();
 79     n=read();m=read();
 80     srand(std::abs(n-m)*3+138);
 81     for (int i=1;i<n;i++){
 82         int x=read(),y=read();
 83         link(x,y);
 84     }
 85     while (m--){
 86         int type=read();
 87         if (type==1){
 88             int x=read(),y=read(),u=read(),v=read();
 89             cut(x,y);link(u,v);
 90         }else if (type==2){
 91             tot++;
 92             c[tot][0]=read();c[tot][1]=read();int z=rand();
 93             while (!z) z=rand();
 94             c[tot][2]=z;
 95             add(c[tot][0],z);add(c[tot][1],z);ans^=z;
 96         }else if (type==3){
 97             int k=read();
 98             add(c[k][0],c[k][2]);
 99             add(c[k][1],c[k][2]);
100             ans^=c[k][2];
101         }else{
102             int x=read(),y=read();
103             makeroot(x);access(y);
104             if (o[x]==ans&&o[y]==ans) puts("YES");
105             else puts("NO");
106         }
107     }
108 }