bzoj2049: [Sdoi2008]Cave 洞穴勘测

lct入门题？

得换根了吧TAT

这大概不是很成熟的版本..

 #include<iostream>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<cstdio>
 using namespace std;
 
 const int Maxn = ;
 
 int ch[Maxn][],p[Maxn],flip[Maxn];
 int n,m;
 
 const int D=;
 char in[D],out[*],*I=in,*O=out;
 #define gc (*I++)
 #define pc(x) ((*O++)=x)
 template <typename Q>
 void gt(Q&x) {
     static char c,f;
     for(c=gc,f=;!isdigit(c);c=gc)if(c=='-') f=;
     for(x=;isdigit(c);c=gc) x=x*+c-'';
     f && (x=-x);
 }
 
 template <typename Q>
 void pt(Q x){
     static char stk[];
     static int top;
     top=;
     if(x==) pc('');
     for(;x;x/=) stk[++top] = x%+'';
     for(;top;top--) pc(stk[top]);
 }
 
 void down(int x){
     if(flip[x]) {
         swap(ch[x][],ch[x][]);
         flip[ch[x][]]^=;
         flip[ch[x][]]^=;
         flip[x]=;
     }
 }
 
 bool isroot(int x){
     return ch[p[x]][]!=x && ch[p[x]][]!=x;
 }
 
 void rotate(int x) {
     int y=p[x],z=p[y];
     int l=ch[y][]==x,r=l^;
     if(!isroot(y)) ch[z][ch[z][]==y]=x;
     p[ch[x][r]]=y;
     p[y]=x;
     p[x]=z;
 
     ch[y][l]=ch[x][r];
     ch[x][r]=y;
 }
 
 int stk[Maxn],top;
 void splay(int x){
     stk[top=]=x;
     for(int t=x;!isroot(t);t=p[t]) stk[++top]=p[t];
     for(;top;top--) down(stk[top]);
 
     for(;!isroot(x);){
         int y=p[x],z=p[y];
         if(!isroot(y)){
             if( (ch[y][]==x)^(ch[z][]==y) )
                 rotate(x);else rotate(y);
         }
         rotate(x);
     }
 }
 
 void access(int x){
     for(int t=;x;x=p[t=x]){
         splay(x);
         ch[x][]=t;
     }
 }
 
 int getroot(int x){
     for(access(x),splay(x);ch[x][];x=ch[x][]);
     return x;
 }
 
 void newroot(int x) {
     access(x);
     splay(x);
     flip[x]^=;
 }
 
 void cut(int x){
     access(x);
     splay(x);
     p[ch[x][]]=;
     ch[x][]=;
 }
 
 void combine(int x,int y) {
     newroot(x);
     p[x]=y;
 }
 
 void work() {
     gt(n),gt(m);
     char c;
     int a,b;
     for(int i=;i<=m;i++) {
         for(;c=gc,c!='Q' && c!='C' &&c!='D';);
         gt(a),gt(b);
         if(c=='Q') printf("%s\n",getroot(a)==getroot(b)?"Yes" : "No");
         else if(c=='C') combine(a,b);
         else newroot(a),cut(b);
     }
 }
 
 int main() {
 #ifdef DEBUG
     freopen("in.txt","r",stdin);
     freopen("out.txt","w",stdout);
 #endif
     fread(in,,D,stdin);
 
     work();
 
     return printf(out),;
 }