bzoj2049

lct 模版题

辣鸡玩意  回我一天青春

#include <stack>
#include <cstdio>

using namespace std;

int st[10010],tp;
int m,n;

int fa[10010],ch[10010][2],lazy[10010];

int read_int () {
	char c = getchar();
	int re = 0;
	for(;c > '9' || c < '0';c = getchar());
	for(;c >=  '0' && c <= '9';c = getchar())
		re = re * 10 + c - '0';
	return re;
}

void swp (int &a,int &b) {
	int t = a;
	a = b;
	b = t;
}

void pd (int u) {
	if(!lazy[u])
		return;
	int v = ch[u][0];
	swp(ch[v][0],ch[v][1]);
	lazy[v] ^= 1;
	v = ch[u][1];
	swp(ch[v][0],ch[v][1]);
	lazy[v] ^= 1;
	lazy[u] = 0;
}

void rot (int u,int d) {
	ch[fa[u]][d ^ 1] = ch[u][d];
	if(ch[u][d])
		fa[ch[u][d]] = fa[u];
	int t = fa[fa[u]];
	ch[u][d] = fa[u];
	fa[fa[u]] = u;
	fa[u] = t;
	
	if(!t)
		return;

	if(ch[t][0] == ch[u][d])
		ch[t][0] = u;
	else {
		if(ch[t][1] == ch[u][d])
			ch[t][1] = u;
	}
}

void splay (int u) {
	int t = u;
	tp = 1;
	st[tp] = t;
	while(ch[fa[t]][0] == t || ch[fa[t]][1] == t) {
		t = fa[t];
		st[++tp] = t;
	}
	while(tp) {
		t = st[tp];
		pd(t);
		--tp;
	}
	
	while(ch[fa[u]][0] == u || ch[fa[u]][1] == u) {
		if(ch[fa[fa[u]]][0] != fa[u] && ch[fa[fa[u]]][1] != fa[u]) {
			if(ch[fa[u]][0] == u)
				rot(u,1);
			else rot(u,0);
		}
		else {
			int d = ch[fa[fa[u]]][0] == fa[u];
			if(ch[fa[u]][d] == u) {
				rot(u,d ^ 1);
				rot(u,d);
			}
			else {
				rot(u,d);
				rot(u,d);
			}
		}
	}
}

void reverse (int u) {
	int t = ch[u][0];
	ch[u][0] = ch[u][1];
	ch[u][1] = t;
	lazy[u] ^= 1;
}

void access (int u) {
	int v = 0;
	while(u) {
		splay(u);
		ch[u][1] = v;
		v = u;
		u = fa[v];
	}
}

void mtr (int u) {
	access(u);
	splay(u);
	reverse(u);
}

int fr (int u) {
	access(u);
	splay(u);
	int t = u;
	while(ch[t][0])
		t = ch[t][0];
	return t;
}

int main () {
	n = read_int();
	m = read_int();
	
	char C;
	int u,v;
	for(int i = 1;i <= m;++i) {
		scanf(" %c",&C);
		u = read_int();
		v = read_int();
		if(C == 'Q') {
			u = fr(u);
			v = fr(v);
			if(u == v)
				printf("Yes\n",i);
			else printf("No\n",i);
		}
		else {
			if(C == 'C') {
				mtr(u);
				mtr(v);
				fa[v] = u;
			}
			else {
				mtr(u);
				access(v);
				splay(v);
				ch[v][0] = fa[u] = 0;
			}
		}
	}
}