BZOJ 1180 CROATIAN2009 OTOCI Link-Cut-Tree

题目大意：给定一座森林，每个点上有权值，支持以下操作：

1.询问两个点是否联通，若不连通则链接一条无向边

2.修改某个点的权值

3.询问两点间路径上点权之和，若不连通输出impossible

一道很裸的LCT，打了发模板，权当练练NOILinux的熟练度了

尼玛'p'写成'g'WA了一下午……明明LCT都没写错居然在这种逗B的位置出错……

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define M 30300
using namespace std;
struct abcd{
	abcd *fa,*ls,*rs;
	int num,sum;
	bool rev_mark;
	abcd(int x);
	void Push_Up();
	void Push_Down();
	void Reverse();
}*null=new abcd(0),*tree[M];
abcd :: abcd(int x)
{
	fa=ls=rs=null;
	num=sum=x;
	rev_mark=0;
}
void abcd :: Push_Up()
{
	sum=ls->sum+rs->sum+num;
}
void abcd :: Push_Down()
{
	if(fa->ls==this||fa->rs==this)
		fa->Push_Down();
	if(rev_mark)
	{
		ls->Reverse();
		rs->Reverse();
		rev_mark=0;
	}
}
void abcd :: Reverse()
{
	swap(ls,rs);
	rev_mark^=1;
}
void Zig(abcd *x)
{
	abcd *y=x->fa;
	y->ls=x->rs;
	x->rs->fa=y;
	x->rs=y;
	x->fa=y->fa;
	if(y->fa->ls==y)
		y->fa->ls=x;
	else if(y->fa->rs==y)
		y->fa->rs=x;
	y->fa=x;
	y->Push_Up();
}
void Zag(abcd *x)
{
	abcd *y=x->fa;
	y->rs=x->ls;
	x->ls->fa=y;
	x->ls=y;
	x->fa=y->fa;
	if(y->fa->ls==y)
		y->fa->ls=x;
	else if(y->fa->rs==y)
		y->fa->rs=x;
	y->fa=x;
	y->Push_Up();
}
void Splay(abcd *x)
{
	x->Push_Down();
	while(x->fa->ls==x||x->fa->rs==x)
	{
		abcd *y=x->fa,*z=y->fa;
		if(x==y->ls)
		{
			if(y==z->ls)
				Zig(y);
			Zig(x);
		}
		else
		{
			if(y==z->rs)
				Zag(y);
			Zag(x);
		}
	}
	x->Push_Up();
}
void Access(abcd *x)
{
	abcd *y=null;
	while(x!=null)
	{
		Splay(x);
		x->rs=y;
		x->Push_Up();
		y=x;
		x=x->fa;
	}
}
void Move_To_Root(abcd *x)
{
	Access(x);
	Splay(x);
	x->Reverse();
}
abcd* Find_Root(abcd *x)
{
	while(x->fa!=null)
		x=x->fa;
	return x;
}
void Link(abcd *x,abcd *y)
{
	Move_To_Root(x);
	x->fa=y;
}
void Cut(abcd *x,abcd *y)
{
	Move_To_Root(x);
	Access(y);
	Splay(y);
	x->fa=null;
	y->ls=null;
	y->Push_Up();
}
int n,m;
int main()
{
	
	//freopen("1180.in","r",stdin);
	//freopen("1180.out","w",stdout);
	
	int i,x,y;
	char p[100];
	cin>>n;
	for(i=1;i<=n;i++)
		scanf("%d",&x),tree[i]=new abcd(x);
	cin>>m;
	for(i=1;i<=m;i++)
	{
		scanf("%s%d%d",p,&x,&y);
		if(p[0]=='b')
		{
			if(Find_Root(tree[x])==Find_Root(tree[y]))
				puts("no");
			else
				puts("yes"),Link(tree[x],tree[y]);
		}
		else if(p[0]=='p')
		{
			Splay(tree[x]);
			tree[x]->num=y;
			tree[x]->Push_Up();
		}
		else
		{
			if(Find_Root(tree[x])!=Find_Root(tree[y]))
				puts("impossible");
			else
			{
				Move_To_Root(tree[x]);
				Access(tree[y]);
				Splay(tree[y]);
				printf("%d\n",tree[y]->sum);
			}
		}
	}
	return 0;
}