bzoj1208.宠物收养所(splay)

有一些小猫和领养者，他们都有一个特征值 a，领养者想领走与他的特征值最相似的小猫(即他们差的绝对值最小的)，而小猫也愿意和其特征值最相似的人走，如果有相似度相同的，选择靠前的人或猫。问这些差的最小值是多少。

和 bzoj1588 一样，只多了一个产出操作

#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_N = 80005, mod = 1000000;

int tr[MAX_N][2], val[MAX_N], f[MAX_N];
int n, R, siz = 0, ans = 0, t1, t2, typ;

void tree_rot(int x, int &k)
{
	int y = f[x], z = f[y], l, r;
	if (tr[y][0] == x) l = 0; else l = 1;
	r = l ^ 1;
	if (k == y) k = x;
	else { if (tr[z][0] == y) tr[z][0] = x; else tr[z][1] = x; }
	f[y] = x; f[x] = z; f[tr[x][r]] = y;
	tr[y][l] = tr[x][r]; tr[x][r] = y;
}

void tree_splay(int &k, int x)
{
	int y, z;
	while (x != k){
		y = f[x]; z = f[y];
		if (y != k){
			if ((tr[y][0] == x) ^ (tr[z][0] == y)) tree_rot(x, k);
			else tree_rot(y, k);
		}
		tree_rot(x, k);
	}
}

void tree_ins(int &k, int x, int last)
{
	if (k == 0){
		siz ++; k = siz; val[k] = x; f[k] = last;
		tree_splay(R, k); return; 
	}
	if (x < val[k]) tree_ins(tr[k][0], x, k);
		else tree_ins(tr[k][1], x, k);
}

void tree_del(int x)
{
	tree_splay(R, x);
	if (tr[x][0] * tr[x][1] == 0) R = tr[x][0] + tr[x][1];
	else {
		int k = tr[x][1];
		while (tr[k][0]) k = tr[k][0];
		tr[k][0] = tr[x][0]; f[tr[x][0]] = k;
		R = tr[x][1];
	}
	f[R] = 0;
}

void get_pre(int &k, int x)
{
	if (k == 0) return;
	if (x >= val[k]) { t1 = k; get_pre(tr[k][1], x); }
		else get_pre(tr[k][0], x);
}

void get_next(int &k, int x)
{
	if (k == 0) return;
	if (x <= val[k]) { t2 = k; get_next(tr[k][0], x); }
		else get_next(tr[k][1], x);
}

void init()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++){
		int flag, x; scanf("%d%d", &flag, &x);
		if (!R) typ = flag, tree_ins(R, x, 0);
		else if (typ == flag) tree_ins(R, x, 0);
		else {
			t1 = t2 = -1;
			get_pre(R, x); get_next(R, x);
			if (t1 == -1) ans = (ans + val[t2] - x) % mod, tree_del(t2);
			else if (t2 == -1) ans = (ans + x - val[t1]) % mod, tree_del(t1);
			else {
				if (x - val[t1] <= val[t2] - x) ans = (ans + x - val[t1]) % mod, tree_del(t1);
				else ans = (ans + val[t2] - x) % mod, tree_del(t2);
			} 
		}
	}
}

void doit()
{
	printf("%d\n", ans);
}

int main()
{
	init();
	doit();
	return 0;
}