BZOJ 3729: Gty的游戏

题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=3729

题解：阶梯博弈+splay树维护dfs序列

因为splay操作被tle到死

code：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <map>

const int maxn = 100005;
const int inf = 0x3f3f3f3f;
typedef long long ll;

using namespace std;

int sz,rt,ynum,dfc,mod;
int f[maxn<<1];
int ch[maxn<<1][2]; int sg[maxn<<1][2];
int val[maxn<<1];
int Size[maxn<<1];
int in[maxn<<1],out[maxn<<1];
int deep[maxn],type[maxn<<1];
int a[maxn];
int eul[maxn<<1];

vector<int> G[maxn];
map<int,int> id;

int get(int x){
	return ch[f[x]][1] == x;
}

// 更新子树
void update(int x){
	if (x){
		int l=ch[x][0];
		int r=ch[x][1];
		sg[x][0]=sg[l][0]^sg[r][0];
		sg[x][1]=sg[l][1]^sg[r][1];
		sg[x][type[x]]^=val[x];
	}
}

// 将x旋转到父节点上
void rotate(int x){
	int y = f[x];
	int z = f[y];
	int k = get(x);
	ch[y][k] = ch[x][k ^ 1]; f[ch[y][k]] = y;
	f[y] = x; ch[x][k ^ 1] = y;
	f[x] = z;
	if (z) ch[z][ch[z][1] == y] = x;
	update(y);
	update(x);
}

void rotate(int x,int &k)
{
	int y=f[x],z=f[y],l,r;
	l=(ch[y][1]==x);r=l^1;
	if(y==k)k=x;
	else ch[z][ch[z][1]==y]=x;
	f[ch[x][r]]=y;f[y]=x;f[x]=z;
	ch[y][l]=ch[x][r];ch[x][r]=y;
	update(y);update(x);
}

// 基本操作 将x旋转到根 注意分共线与非共线情况讨论
void splay(int x){
	int y;
	int z;
	while (y = f[x]) {
		z = f[y];
		if (z) {
			if (get(x) == get(y)) rotate(y);
			else rotate(x);
		}
		rotate(x);
	}
	rt = x;
}

void splay(int x,int fx){
    int y,z;
    while(f[x]!=fx){
		y=f[x];
        z=f[y];
        if(z&&z!=fx){
            if(get(x)==get(y)) rotate(y);
            else rotate(x);
        }
        rotate(x);
    }
	if(!fx) rt=x;
}

void insert(int u,int v,int num){
	splay(in[u]);
	int t=ch[rt][1];
	while(ch[t][0]) t=ch[t][0];
	int t1=++dfc;
	int t2=++dfc;
	in[v]=t1;out[v]=t2;
	f[t1]=t; f[t2]=t1;
	ch[t][0]=t1;ch[t1][1]=t2;
	val[t1]=num; type[t1]=type[t2]=deep[v];
	update(t2); update(t1);
	splay(t2);
} // insert


int build(int l, int r, int fa){
	if(l>r) return 0;
	int mid = (l + r) >> 1;
	if(eul[mid]>0) val[mid]=a[eul[mid]];
	f[mid]=fa;
	type[mid]=deep[abs(eul[mid])];
	if(l<mid) ch[mid][0]=build(l,mid-1,mid);
	if(r>mid) ch[mid][1]=build(mid+1,r,mid);
	update(mid);
	return mid;
}

void dfs(int u){
	in[u] = ++dfc;
	eul[dfc] = u;
	for (int i = 0; i < G[u].size(); ++i) {
		int v = G[u][i];
		deep[v] = deep[u] ^ 1;
		dfs(v);
	}
	out[u] = ++dfc;
	eul[dfc] = -u;
}

void query(int x){
    splay(in[x]);
    splay(out[x],in[x]);
	if(sg[ch[out[x]][0]][deep[x]^1]){
		ynum++;
		puts("MeiZ");
	}else puts("GTY");
}

int main(){
	//    freopen("in.txt","r",stdin);
	int n, L;
	scanf("%d%d", &n, &L);
	mod=L+1;
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		a[i]%=mod;
		id[i] = i;
	}
	for (int i = 1; i < n; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		G[u].push_back(v);
	}
	dfs(1);
	//	cout<<"dfs ok\n";
	rt = build(1, dfc, 0);
	//	cout<<"build ok\n";
	int m;
	scanf("%d", &m);
	int opt,u,v,x;
	while (m--) {
		scanf("%d", &opt);
//		cout<<m<<' '<<opt<i<endl;
		if (opt == 1) {
			scanf("%d",&v);
			v^=ynum;
			query(id[v]);
		} else if (opt == 2) {
			scanf("%d%d",&x,&v);
			x^=ynum;   v=(v^ynum)%mod;
			x=id[x];
			splay(in[x]);   val[rt]=v;
			update(rt);
		} else if (opt == 3) {
			scanf("%d%d%d",&u,&v,&x);
			u^=ynum; v^=ynum; x^=ynum;
			u=id[u];    id[v]=++n;
			deep[n]=deep[u]^1;  insert(u,n,x%mod);
		}
	}
	return 0;
} // main