[题解]LuoGu2286：[HNOI2004]宠物收养场

原题传送门
$splay$
很显然按照特点值建一棵Splay
然后需要在宠物与人之间切换
维护$type$表示当前splay类型
做法：

• 当前Splay为空，直接$insert$，并将type赋为当前类型（宠物/人）
• 类型与当前splay相同，直接插入
• 类型不同，讨论splay中元素个数
  只剩1个：统计ans，删除元素，type变为2
  还剩多个：先find一个跟自己最接近的，并选到根，然后根据找到的数在当前数的左/右边，找到当前根的后继/前驱，再比较，统计ans

坑点：

• 别忘了取模
• key[0]=inf，因为我懒的加入哨兵inf,-inf，直接把0的key改成无穷大，防止pre到0节点

Code：

#include <bits/stdc++.h>
#define maxn 80010
using namespace std;
int rt, sz, size[maxn], key[maxn], type;
int son[maxn][2], f[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void clear(int x){
	f[x] = key[x] = size[x] = son[x][0] = son[x][1] = 0;
}

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

void update(int x){
	if (x){
		size[x] = 1;
		if (son[x][0]) size[x] += size[son[x][0]];
		if (son[x][1]) size[x] += size[son[x][1]];
	}
}

void connect(int x, int y, int z){
	if (x) f[x] = y;
	if (y) son[y][z] = x;
}

void rotate(int x){
	int fa = f[x], ffa = f[fa], m = get(x), n = get(fa);
	connect(son[x][m ^ 1], fa, m);
	connect(fa, x, m ^ 1);
	connect(x, ffa, n);
	update(fa); update(x);
}

void splay(int x, int goal){
	while (f[x] != goal){
		int fa = f[x];
		if (f[fa] != goal) rotate(get(x) == get(fa) ? fa : x);
		rotate(x);
	}
	if (!goal) rt = x;
}

void insert(int x){
	int now = rt, fa = 0;
	while (1){
		if (!now){
			now = ++sz;
			key[now] = x, size[now] = 1, f[now] = fa;
			son[now][0] = son[now][1] = 0;
			if (fa) son[fa][x > key[fa]] = now;
			update(fa); splay(now, 0);
			return;
		} 
		fa = now, now = son[now][x > key[now]];
	}
}

int find(int x){
	int now = rt, fa = 0;
	while (1){
		if (key[now] == x){
			splay(now, 0);
			return now;
		}
		fa = now, now = son[now][x > key[now]];
		if (!now){
			splay(fa, 0);
			return fa;
		}
	}
}

int pre(){
	int x = son[rt][0];
	while (son[x][1]) x = son[x][1];
	return x;
}

int nxt(){
	int x = son[rt][1];
	while (son[x][0]) x = son[x][0];
	return x;
}

void del(int x){
	splay(x, 0);
	if (!son[rt][0] && !son[rt][1]){
		clear(rt); rt = 0; return;
	}
	if (!son[rt][0]){
		int tmp = rt;
		f[rt = son[rt][1]] = 0;
		clear(tmp); return;
	}
	if (!son[rt][1]){
		int tmp = rt;
		f[rt = son[rt][0]] = 0;
		clear(tmp); return;
	}
	int left = pre(), tmp = rt;
	splay(left, 0);
	connect(son[tmp][1], left, 1);
	clear(tmp); update(left);
}

int main(){
	int M = read();
	type = read();
	int x = read(); insert(x);
	--M;
	int ans = 0;
	key[0] = 1e9;
	while (M--){
		int opt = read(), x = read();
		if (type == 2){
			type = opt;
			insert(x);
		} else
		if (type == opt) insert(x); else{
			int a = find(x);
			if (size[rt] == 1){
				ans += abs(key[rt] - x); ans %= 1000000;
				del(rt);
				rt = 0, type = 2;
			} else{
				if (key[a] <= x){
					int b = nxt();
					if (abs(key[a] - x) <= abs(key[b] - x)){
						ans += abs(key[a] - x); ans %= 1000000;
						del(a);
					} else{
						ans += abs(key[b] - x); ans %= 1000000;
						del(b);
					}
				} else{
					int b = pre();
					if (abs(key[b] - x) <= abs(key[a] - x)){
						ans += abs(key[b] - x); ans %= 1000000;
						del(b);
					} else{
						ans += abs(key[a] - x); ans %= 1000000;
						del(a);
					}
				}
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

fhq Treap也是可以的哟
跟上面一样的做法
Code：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <ctime>
#define maxn 100010
#define qy 1000000
using namespace std;
int rt, sz, val[maxn], key[maxn], size[maxn], son[maxn][2];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

int addnode(int x){
	++sz;
	val[sz] = x, key[sz] = rand() * rand(), size[sz] = 1;
	return sz;
}

void pushup(int x){ size[x] = size[son[x][0]] + size[son[x][1]] + 1; }

void split(int now, int w, int &u, int &v){
	if (!now) u = v = 0; else{
		if (val[now] <= w) u = now, split(son[now][1], w, son[u][1], v); else
		v = now, split(son[now][0], w, u, son[v][0]);
		pushup(now);
	}
}

int merge(int u, int v){
	if (!u || !v) return u + v;
	if (key[u] >= key[v]){
		son[u][1] = merge(son[u][1], v);
		pushup(u);
		return u;
	} else{
		son[v][0] = merge(u, son[v][0]);
		pushup(v);
		return v;
	}
}

int kth(int now, int k){
	if (!now) return 0;
	while (1){
		if (size[son[now][0]] >= k) now = son[now][0]; else
		if (size[son[now][0]] + 1 >= k) return now; else
		k -= size[son[now][0]] + 1, now = son[now][1];
	}
}

void insert(int w){
	int x, y;
	split(rt, w, x, y);
	rt = merge(merge(x, addnode(w)), y);
}

void del(int w){
	int x, y, z;
	split(rt, w, x, y);
	split(x, w - 1, x, z);
	rt = merge(merge(x, merge(son[z][0], son[z][1])), y);
}

int main(){
	srand(time(0));
	val[0] = 1e9;
	int M = read(), type = 2, ans = 0;
	while (M--){
		int opt = read(), k = read();
		if (type == 2){
			type = opt; insert(k);
		} else
		if (type == opt) insert(k); else{
			int x, y;
			split(rt, k, x, y);
			int w1 = val[kth(x, size[x])], w2 = val[kth(y, 1)];
			if (abs(k - w1) <= abs(k - w2)) (ans += abs(k - w1)) %= qy; else
			w1 = w2, (ans += abs(k - w1)) %= qy;
			rt = merge(x, y);
			if (size[rt] == 1) type = 2;
			del(w1);
		}
	}
	printf("%d\n", ans);
	return 0;
}