【Codeforces 19 D. Points】 线段树

CF 19 D
题意是嫖过来的
给你一个笛卡尔坐标系，现在要支持三种操作，
第一种操作是添加一个点(x,y),
第二种操作是删除一个点(x,y),
第三种操作是查询严格在点(x,y)右上角的点中，横坐标最小的点，如果有多个点，选择纵坐标最小的那个。
这个题加点 删点 想到了set
然后怎么找严格右上角呢？想到了线段树去找右边区间的maxx大于y+1的那个最左坐标
我们用横坐标当线段树节点 节点存该横坐标下纵坐标的最大值 借助了set 的rbegin实现
代码跑的1500ms 应该有再优化的地方 不过能A就不错了 数组开小RE两发

/*
给你一个笛卡尔坐标系，现在要支持三种操作，
第一种操作是添加一个点(x,y),
第二种操作是删除一个点(x,y),
第三种操作是查询严格在点(x,y)右上角的点中，横坐标最小的点，如果有多个点，选择纵坐标最小的那个。
*/
/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 200025;
int x[MAX_N],y[MAX_N],b[MAX_N<<1],maxx[MAX_N<<3],ans[MAX_N][2];
char str[MAX_N][10];
set<int > st[MAX_N<<1];
map<int ,int > mp;
int Max(int a,int b){if(a>b) return a;return b;}
void up(int rt)
{
    maxx[rt] = Max(maxx[rt<<1],maxx[rt<<1|1]);
}
void build(int rt,int l,int r)
{
    maxx[rt] = -1;
    if(l==r)
    {
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void update(int rt,int l,int r,int x,int v)
{
    if(l==r)
    {
        if(v==1)
        {
            maxx[rt] = *st[x].rbegin();
        }
        else
        {
            if(st[x].empty()) maxx[rt] = -1;
            else maxx[rt] = *st[x].rbegin();
        }
        return ;
    }
    if(x<=mid) update(rt<<1,l,mid,x,v);
    else update(rt<<1|1,mid+1,r,x,v);
    up(rt);
}
int query(int rt,int l,int r,int x,int y,int v)
{
    if(maxx[rt]<v) return -1;
    if(l==r)
    {
        return l;
    }
    int ans = -1;
    if(x<=mid)
    {
        ans = query(rt<<1,l,mid,x,y,v);
        if(ans!=-1) return ans;
    }
    return query(rt<<1|1,mid+1,r,x,y,v);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,cnt = 0,N = 400000,CNT=1;
    scanf("%d",&n);
    mp[-1] = -1;
    for(int i = 1;i<=n;++i)
    {
        scanf("%s",str[i]);
        scanf("%d%d",&x[i],&y[i]);
        b[++cnt] = x[i];b[++cnt] = y[i];
    }
    sort(b+1,b+1+cnt);
    int sz = unique(b+1,b+1+cnt)-b-1;
    for(int i = 1;i<=n;++i)
    {
        int tmp;
        tmp = lower_bound(b+1,b+1+sz,x[i])-b;
        mp[tmp] = x[i];
        x[i] = tmp;
        tmp = lower_bound(b+1,b+1+sz,y[i])-b;
        mp[tmp] = y[i];
        y[i] = tmp;
    }
    build(1,1,N);
    for(int i = 1;i<=n;++i)
    {
        if(str[i][0]=='a')
        {
            st[x[i]].insert(y[i]);
            update(1,1,N,x[i],1);
        }
        else if(str[i][0]=='f')
        {
            int tmp = query(1,1,N,x[i]+1,N,y[i]+1);
            ans[CNT][0] = mp[tmp];
            if(ans[CNT][0]!=-1)
            {
                set<int>::iterator xb = st[tmp].upper_bound(y[i]);
                ans[CNT][1] = mp[*xb];
            }
            CNT++;
        }
        else if(str[i][0]=='r')
        {
            st[x[i]].erase(y[i]);
            update(1,1,N,x[i],-1);
        }
    }
    for(int i = 1;i<CNT;++i)
    {
        printf("%d",ans[i][0]);
        if(ans[i][0]==-1) printf("\n");
        else
        {
                printf(" %d\n",ans[i][1]);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}