62. 少林功夫

题目链接

点此跳转

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

#define LL long long
#define mem(a, b) memset(a, b, sizeof a)
#define lowbit(x) (-x&x)
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define endl '\n'
#define rev(x) reverse(x.begin(), x.end())

using namespace std;

const int N = 5000010;

struct Node {
	int l, r;
	int key, val;
	int num, size;
}tr[N];

int id[N];
int rt, idx;

void solve();
int newnode(int val);
void pushup(int p);
void zig(int &p);
void zag(int &p);
void insert(int &p, int val);
int getval(int p, int val);
int getrank(int p, int val);

int main() {
	IOS;
	
	solve();
	
	return 0;
}

void solve() {
	int n, a, b;
	while (cin >> n, n) {
		mem(id, 0);
		
		insert(rt, 100000);
		id[100000] = 1;
		
		for (int i = 0; i < n; i ++ ) {
			cin >> a >> b;
			id[b] = a;
			insert(rt, b);
			
			int ans;
			int k = getrank(rt, b);
			int ans1 = getval(rt, k - 1), ans2 = getval(rt, k + 1);
			if (!ans1) ans = ans2;
			else if (!ans2) ans = ans1;
			else {
				if (b - ans1 <= ans2 - b) ans = ans1;
				else ans = ans2;
			}
			
			cout << a << ' ' << id[ans] << endl;
		}
		
	}
	
}

int newnode(int val) {  //创建新节点
	int x = ++ idx;
	tr[x].l = tr[x].r = 0;
	tr[x].key = rand();
	tr[x].val = val;
	tr[x].num = tr[x].size = 1;
	return x;
}

void pushup(int p) {  //更新父节点
	tr[p].size = tr[tr[p].l].size + tr[tr[p].r].size + tr[p].num;
}

void zig(int &p) {  //右旋
	int q = tr[p].l;
	tr[p].l = tr[q].r;
	tr[q].r = p;
	tr[q].size = tr[p].size;
	pushup(p);
	p = q;
}

void zag(int &p) {  //左旋
	int q = tr[p].r;
	tr[p].r = tr[q].l;
	tr[q].l = p;
	tr[q].size = tr[p].size;
	pushup(p);
	p = q;
}

void insert(int &p, int val) {  //插入
	if (!p) {
		p = newnode(val);
		return ;
	}
	
	tr[p].size ++ ;
	if (val == tr[p].val) {
		tr[p].num ++ ;
		return;
	} else if (val < tr[p].val) {
		insert(tr[p].l, val);
		if (tr[tr[p].l].key > tr[p].key) zig(p);
	} else {
		insert(tr[p].r, val);
		if (tr[tr[p].r].key > tr[p].key) zag(p);
	}
}

int getval(int p, int k) {  //获取第 k 大
	if (!p) return 0;
	
	int cnt = tr[tr[p].l].size;
	if (k <= cnt) {
		return getval(tr[p].l, k);
	} else if (k <= cnt + tr[p].num) {
		return tr[p].val;
	} else {
		return getval(tr[p].r, k - cnt - tr[p].num);
	}
}

int getrank(int p, int val) {  //获取排名
	if (!p) return 0;
	else if (val == tr[p].val) return tr[tr[p].l].size + 1;
	else if (val < tr[p].val) return getrank(tr[p].l, val);
	else return getrank(tr[p].r, val) + tr[tr[p].l].size + tr[p].num;
}