[BZOJ2648]SJY摆棋子 k-dtree

好久以前尝试写的题，突然发现还没有写过
回来把坑补了

诶看到题没想太多觉得cdq分治可做就直接上了
想把原问题拆成四个三维偏序，cdq分治+树状数组就能求
两个log，TLE成傻逼
实测大概要向下卡十倍常数，今天WC刚刚学了底层优化然并卵

诶算了没关系就当复习了一遍cdq分治模板吧，一边和舍友扯淡一边写的，写了有点久。
k-dtree硬上真优美

p.s.今天GEOTCBRL跑来房间里吐槽了我两件事儿：
1、为什么用下划线当变量名（不是挺好的么）
2、为什么在写代码的时候电脑放过年，还是单曲循环（不是也挺好的么）

TLEcode

/**************************************************************
    Problem: 2648
    User: di4CoveRy
    Language: C++
    Result: Time_Limit_Exceed
****************************************************************/

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

#define N 1000050

using namespace std;

struct Query{ int t,x,y,r,ans; }Q[N];
int cnt,d[N],e[N],n,m;
bool cmpx(Query p1,Query p2) { return p1.x < p2.x; }
bool cmpr(Query p1,Query p2) { return p1.r < p2.r; }
bool cmpe(int p1,int p2) { return Q[p1].y < Q[p2].y; }

inline void ut(int &x,int y) { x = min(x,y); }

struct BIT{
    int tr[N];
    inline int lowbit(int x) { return x & -x; }
    void add(int x,int v) {
        for (int i=x;i<=cnt;i+=lowbit(i)) tr[i] = max(tr[i],v);
    }
    int ask(int x) {
        int ret = -(1<<29);
        for (int i=x;i>=1;i-=lowbit(i)) ret = max(tr[i],ret);
        return ret;
    }
    void clean(int x) {
        for (int i=x;i<=cnt;i+=lowbit(i)) tr[i] = -(1<<29);
    }
}T;

void cdq(int l,int r) {
    if (l == r) return ;
    int mid = (l + r) >> 1;
    cdq(l,mid); 
    cdq(mid+1,r);

    int p = l-1;
    for (int i=mid+1;i<=r;i++) {
        while (p+1 <= mid && Q[p+1].x <= Q[i].x) {
            if (!Q[p+1].t)T.add( Q[p+1].y , Q[p+1].x+d[ Q[p+1].y ] );
            p++;
        }
        if (Q[i].t) ut(Q[i].ans , Q[i].x+d[ Q[i].y ]-T.ask( Q[i].y ));
    }
    for (int i=l;i<=mid;i++) T.clean( Q[i].y );

    sort(Q+l,Q+r+1,cmpx);
}

void lsh() {
    int tp = 0;
    for (int i=1;i<=cnt;i++) e[i] = i;
    sort(e+1,e+cnt+1,cmpe);
    for (int i=1;i<=cnt;i++) 
        if ( Q[ e[i] ].y == d[tp] ) 
            Q[ e[i] ].y = tp;
        else
            d[++tp] = Q[ e[i] ].y , Q[ e[i] ].y = tp;
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("1.in","r",stdin);
    #endif
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++) {
        ++cnt;
        scanf("%d%d",&Q[cnt].x,&Q[cnt].y);
        Q[cnt].r = cnt;
    }
    for (int i=1;i<=m;i++) {
        ++cnt;
        scanf("%d%d%d",&Q[cnt].t,&Q[cnt].x,&Q[cnt].y);
        Q[cnt].t = (Q[cnt].t & 1) ^ 1;
        Q[cnt].r = cnt;
        Q[cnt].ans = (1<<30);
    }


    memset(T.tr,-127/3,sizeof(T.tr));
    lsh();
    sort(Q+1,Q+cnt+1,cmpr); 
    cdq(1,cnt);

    sort(Q+1,Q+cnt+1,cmpr);
    for (int i=1;i<=cnt;i++) Q[i].x = -Q[i].x;
    cdq(1,cnt);

    sort(Q+1,Q+cnt+1,cmpr);
    for (int i=1;i<=cnt/2;i++) swap(d[i],d[cnt-i+1]);
    for (int i=1;i<=cnt;i++) d[i] = -d[i];
    for (int i=1;i<=cnt;i++) Q[i].y = cnt-Q[i].y+1;
    cdq(1,cnt);

    sort(Q+1,Q+cnt+1,cmpr);
    for (int i=1;i<=cnt;i++) Q[i].x = -Q[i].x;
    cdq(1,cnt);

    sort(Q+1,Q+cnt+1,cmpr);
    for (int i=1;i<=cnt;i++) if (Q[i].t) printf("%d\n",Q[i].ans);
    return 0;
}


ACcode

/**************************************************************
    Problem: 2648
    User: di4CoveRy
    Language: C++
    Result: Accepted
    Time:16184 ms
    Memory:32556 kb
****************************************************************/

#include <bits/stdc++.h>
#define N 1000050
#define INF (1<<30)

#define mid ( (l + r) >> 1 )
#define each for (int  _=0;_<=1;_++)

using namespace std;
int n,m,ans,D,rt;
struct Node{ int a[2],b[2],r[2]; };
bool operator<(Node p1,Node p2) { return p1.r[D] < p2.r[D]; }

struct k_dtree{

    Node tr[N],id;
    int L[N],R[N],x[2];

    inline void ut(int &x,int y) { x = min(x,y); }
    inline int Abs(int x) { return x<0 ? -x : x; }

    inline int dis(Node tmp) {
        int ret = 0;
        each ret += Abs( tmp.r[_] - x[_] );
        return ret;
    }
    int get(int k){
        if (!k) return INF;
        int ret = 0;
        each 
            ret += max(0,tr[k].b[_]-x[_]),
            ret += max(0,x[_]-tr[k].a[_]);
        return ret;
    }

    inline void color(int t) {
        each tr[t].a[_] = tr[t].b[_] = tr[t].r[_];
    }

    inline void maintain(int t) {
        color(t);
        each 
            tr[t].a[_] = max( tr[t].a[_] , max( tr[ L[t] ].a[_] , tr[ R[t] ].a[_] ) ), 
            tr[t].b[_] = min( tr[t].b[_] , min( tr[ L[t] ].b[_] , tr[ R[t] ].b[_] ) );
    }

    int build(int l,int r,int d) {
        if (l > r) return 0;
        each tr[mid].a[_] = tr[mid].b[_] = tr[mid].r[_];
        D=d , nth_element(tr+l,tr+mid,tr+r+1);
        if (l == r) return mid;
        L[mid] = build(l,mid-1,d^1) , R[mid] = build(mid+1,r,d^1);
        maintain(mid);
        return mid;
    }

    void insert(int t,int d) {
        if (tr[n].r[d] <= tr[t].r[d]) 
            L[t] ? insert(L[t],d^1) : (void)(L[t] = n);
        else
            R[t] ? insert(R[t],d^1) : (void)(R[t] = n);
        maintain(t);
    }

    int query(int t,int d) {
        if (!t) return 0;
        ut(ans , dis(tr[t]));
        int dl = get(L[t]) , dr = get(R[t]);
        if (dl < dr) 
            dl<ans ? query(L[t],d^1) : 0 , dr<ans ? query(R[t],d^1) : 0 ; 
        else
            dr<ans ? query(R[t],d^1) : 0 , dl<ans ? query(L[t],d^1) : 0 ;
        return 0;
    }

}T;

int main() {
    #ifndef ONLINE_JUDGE
        freopen("1.in","r",stdin);
    #endif
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++) scanf("%d%d",&T.tr[i].r[0],&T.tr[i].r[1]);
    for (int i=1;i<=n;i++) T.color(i);
    each T.tr[0].a[_] = -INF , T.tr[0].b[_] = INF;
    rt = T.build(1,n,1);
    while (m--) {
        int cmd = 0;
        scanf("%d%d%d",&cmd,&T.x[0],&T.x[1]);
        if (cmd == 1) {
            ++n;
            each T.tr[n].r[_] = T.x[_];
            T.color(n);
            T.insert(rt,1);
        }
        else
            ans = INF , T.query(rt,1) , printf("%d\n",ans);
    }
    return 0;
}