记录编号	156855	评测结果	AAAAAAAAAA
题目名称	[SDOI 2008]Cave 洞穴勘测	最终得分	100
用户昵称	ztx	是否通过	通过
代码语言	C++	运行时间	0.417 s
提交时间	2015-04-06 17:29:49	内存使用	0.45 MiB

/****************************************\
* Author : ztx
* Title  : [bzoj] 2049: [Sdoi2008]Cave 洞穴勘测
* ALG    : LCT复习
* CMT    :
* Time   :
\****************************************/

#include <cstdio>
#define Rep(i,l,r) for(i=(l);i<=(r);i++)
#define Rev(i,r,l) for(i=(r);i>=(l);i--)
typedef long long ll ;

inline int GETCHAR() {
	static const int LEN = 1<<15 ;
	static char BUF[LEN] , *S = BUF , *T = BUF ;
	if (S == T) {
		T = (S=BUF)+fread(BUF , 1 , LEN , stdin) ;
		if (S == T) return EOF ;
	}
	return *S ++ ;
}

int CH , NEG ;
template <typename TP>inline void read(TP& ret) {
    ret = NEG = 0 ; while (CH=GETCHAR() , CH<'!') ;
    if (CH == '-') NEG = true , CH = GETCHAR() ;
    while (ret = ret*10+CH-'0' , CH=GETCHAR() , CH>'!') ;
    if (NEG) ret = -ret ;
}
template <typename TP>inline void reads(TP& ret) {
	while (ret=GETCHAR() , ret<'!') ;
	while (CH=GETCHAR() , CH>'!') ;
}

#define  maxn  10010LL

int fa[maxn] = {0} , ch[maxn][2] = {0} ;
bool rev[maxn] = {0} ;

#define  null     0LL
#define  left(u)  ch[u][0]
#define  right(u) ch[u][1]

inline void Exchange(int&a,int&b) {int c=a;a=b;b=c;}
inline bool Isrt(int u) { return !fa[u] || (left(fa[u])!=u&&right(fa[u])!=u) ; }
inline void Clear(int u) {
	if (!u) return ;
	if (rev[u]) {
		rev[u] = false ;
		Exchange(left(u),right(u)) ;
		rev[left(u)] ^= true ;
		rev[right(u)] ^= true ;
	}
}

inline void Rot(int x,bool d) {
	int y = fa[x] , z = fa[y] ;
	if (left(z) == y) left(z) = x ;
	else if (right(z) == y) right(z) = x ;
	fa[x] = z , fa[ch[x][d]] = y , ch[y][!d] = ch[x][d] ;
	ch[x][d] = y , fa[y] = x ;
//	Maintain(y);
}
inline void Splay(int x){
	int y , z ;
	Clear(x) ;
	while (!Isrt(x)) {
		y = fa[x] , z = fa[y] ;
		Clear(z) , Clear(y) , Clear(x) ;
		if (Isrt(y)) Rot(x,ch[y][0]==x) ;
		else if(ch[z][0] == y) {
			if (ch[y][0] == x) Rot(y,1) ;
			else Rot(x,0) ; Rot(x,1) ;
		} else {
			if(ch[y][1] == x) Rot(y,0) ;
			else Rot(x,1) ; Rot(x,0) ;
		}
	}
	//Maintain(x) ;
}

inline void Access(int u) {
	for (int v=null ; u ; right(u)=v,v=u,u=fa[u]) Splay(u) ;
}

inline void MakeRoot(int u) {
	Access(u) , Splay(u) , rev[u] ^= true ;
}

inline void Link(int u , int v) {
	MakeRoot(u) , fa[u] = v ;
}

inline void Cut(int u , int v) {
	MakeRoot(u) , Access(v) , Splay(v) , fa[u]=left(v)=null ;
}

inline int GetRoot(int u) {
	for (Access(u),Splay(u) ; Clear(u),left(u) ; u=left(u)) ; return u ;
}

inline void Query(int u , int v) {
	puts(GetRoot(u)==GetRoot(v) ? "Yes" : "No") ;
}

int n , m , cmd , u , v ;

int main() {
	#define READ
	#ifdef  READ
		freopen("sdoi2008_cave.in" ,"r",stdin ) ;
		freopen("sdoi2008_cave.out","w",stdout) ;
	#endif
	read(n) , read(m) ;
	while (m --> 0) {
		reads(cmd) , read(u) , read(v) ;
		if (cmd == 'C') Link(u,v) ;
		if (cmd == 'D') Cut(u,v) ;
		if (cmd == 'Q') Query(u,v) ;
	}
	#ifdef  READ
		fclose(stdin) ; fclose(stdout) ;
	#else
		getchar() ; getchar() ;
	#endif
	return 0 ;
}