Codeforces 19D-Points

Points

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0, 0) is located in the bottom-left corner, Ox axis is directed right, Oy axis is directed up. Pete gives Bob requests of three types: 

• add x y — on the sheet of paper Bob marks a point with coordinates (x, y). For each request of this type it's guaranteed that point (x, y) is not yet marked on Bob's sheet at the time of the request. 
• remove x y — on the sheet of paper Bob erases the previously marked point with coordinates (x, y). For each request of this type it's guaranteed that point (x, y) is already marked on Bob's sheet at the time of the request. 
• find x y — on the sheet of paper Bob finds all the marked points, lying strictly above and strictly to the right of point (x, y). Among these points Bob chooses the leftmost one, if it is not unique, he chooses the bottommost one, and gives its coordinates to Pete. 

Bob managed to answer the requests, when they were 10, 100 or 1000, but when their amount grew up to 2·105, Bob failed to cope. Now he needs a program that will answer all Pete's requests. Help Bob, please!

Input

The first input line contains number n (1 ≤ n ≤ 2·105) — amount of requests. Then there follow n lines — descriptions of the requests. add x y describes the request to add a point, remove x y — the request to erase a point, find x y — the request to find the bottom-left point. All the coordinates in the input file are non-negative and don't exceed 109.

Output

For each request of type find x y output in a separate line the answer to it — coordinates of the bottommost among the leftmost marked points, lying strictly above and to the right of point (x, y). If there are no points strictly above and to the right of point (x, y), output -1.

Examples

input

7
add 1 1
add 3 4
find 0 0
remove 1 1
find 0 0
add 1 1
find 0 0

output

1 1
3 4
1 1

input

13
add 5 5
add 5 6
add 5 7
add 6 5
add 6 6
add 6 7
add 7 5
add 7 6
add 7 7
find 6 6
remove 7 7
find 6 6
find 4 4

output

7 7
-1
5 5

题意：有n次操作，操作分三种：

1.add(x,y)将这个点加入二维坐标系

2.remove(x,y)将这个点从二维坐标系移除

3.find(x,y)找到(x,y)右上角的第一个点

解题思路：线段树，先对坐标进行离散化，然后按x轴进行建树，维护区间y的最大值，用set维护每个x坐标有哪些y值即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int ma[200009 * 4], xx[200009], yy[200009];
char ch[200009][10];
int x[200009], y[200009], n, m, mm;
set<int>s[200009];

void update(int k, int l, int r, int p, int val)
{
	if (l == r) { ma[k] = val; return; }
	int mid = (l + r) >> 1;
	if (p <= mid) update(k << 1, l, mid, p, val);
	else update(k << 1 | 1, mid + 1, r, p, val);
	ma[k] = max(ma[k << 1], ma[k << 1 | 1]);
}

int query(int k, int l, int r, int ll, int p)
{
	if (l == r) return l;
	int mid = (l + r) >> 1, ans = -1;
	if (ll <= mid&&ma[k << 1] > p) ans = query(k << 1, l, mid, ll, p);
	if (ans != -1) return ans;
	if (ma[k << 1 | 1] > p) ans = query(k << 1 | 1, mid + 1, r, ll, p);
	return ans;
}

int main()
{
	while (~scanf("%d", &n))
	{
		m = 0;
		for (int i = 1; i <= n; i++)
		{
			scanf("%s%d%d", ch[i], &x[i], &y[i]);
			xx[m++] = x[i], yy[mm++] = y[i];
		}
		sort(xx, xx + m);
		m = unique(xx, xx + m) - xx;
		memset(ma, 0, sizeof ma);
		for (int i = 0; i <= m; i++) s[i].clear();
		for (int i = 1; i <= n; i++)
		{
			if (ch[i][0] == 'f')
			{
				int p = upper_bound(xx, xx + m, x[i]) - xx;
				if (p == m) { printf("-1\n"); continue; }
				int k = query(1, 0, m - 1, p, y[i]);
				if (k == -1) printf("-1\n");
				else printf("%d %d\n", xx[k], *(s[k].upper_bound(y[i])));
			}
			else
			{
				int p = lower_bound(xx, xx + m, x[i]) - xx;
				if (ch[i][0] == 'a') s[p].insert(y[i]);
				else s[p].erase(y[i]);
				update(1, 0, m - 1, p, s[p].empty() ? 0 : *(--s[p].end()));
			}
		}
	}
	return 0;
}