bzoj2683/4066 简单题

传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=2683

http://www.lydsy.com/JudgeOnline/problem.php?id=4066

【题解】

学习了一发kdtree

感觉十分神奇

用一个类似于平衡树的来维护平面。

然后由于可能出现复杂度退化，大约10000个点就重构一次。

我这么傻逼把nth_element(...)的t+l打成t+1也是没谁了。。。

upd: 5/5又写了一遍怎么又达成+1了啊。。。。。。。

nth_element(t+l, t+mid, t+r+1);

2683:

# include <stdio.h>
# include <string.h>
# include <algorithm>
// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int M = 2e5 + ;
const int mod = 1e9+;

# define FO_OPEN
# define RG register
# define ST static

inline void gmin(int &x, int y) {if(x > y) x = y;}
inline void gmax(int &x, int y) {if(x < y) x = y;}

inline bool in(int x1, int y1, int x2, int y2, int xx1, int yy1, int xx2, int yy2) {
    return x1 <= xx1 && xx2 <= x2 && y1 <= yy1 && yy2 <= y2;
}

inline bool out(int x1, int y1, int x2, int y2, int xx1, int yy1, int xx2, int yy2) {
    return x1 > xx2 || x2 < xx1 || y1 > yy2 || y2 < yy1;
}

int D;
struct node {
    int d[], mi[], mx[], l, r;
    ll v, s;
    friend bool operator == (node a, node b) {
        return a.d[] == b.d[] && a.d[] == b.d[];
    }
    friend bool operator < (node a, node b) {
        return a.d[D] < b.d[D];
    }
}t[M];

# define ls T[x].l
# define rs T[x].r

struct KDT {
    node T[M], tmp;
    int siz, rt;
    inline void set() {
        siz = rt = ;
    }
    inline void up(int x) {
        for (int i=; i<; ++i) {
            T[x].mx[i] = T[x].mi[i] = T[x].d[i];
            if(ls) gmin(T[x].mi[i], T[ls].mi[i]);
            if(rs) gmin(T[x].mi[i], T[rs].mi[i]);
            if(ls) gmax(T[x].mx[i], T[ls].mx[i]);
            if(rs) gmax(T[x].mx[i], T[rs].mx[i]);
        }
        T[x].s = T[x].v + T[ls].s + T[rs].s;
    }
    inline void insert(int &x, int d) {
        if(!x) {
            x = ++siz;
            T[x].d[] = T[x].mi[] = T[x].mx[] = tmp.d[];
            T[x].d[] = T[x].mi[] = T[x].mx[] = tmp.d[];
        }
        if(T[x] == tmp) {
            T[x].v += tmp.v;
            T[x].s += tmp.v;
            return ;
        }
        if(tmp.d[d] < T[x].d[d]) insert(ls, d^);
        else insert(rs, d^);
        up(x);
    }
    inline ll query(int x, int x1, int y1, int x2, int y2) {
        if(!x) return ;
        ll ret = ;
        if(in(x1, y1, x2, y2, T[x].mi[], T[x].mi[], T[x].mx[], T[x].mx[])) return T[x].s;
        if(out(x1, y1, x2, y2, T[x].mi[], T[x].mi[], T[x].mx[], T[x].mx[])) return ;
        if(in(x1, y1, x2, y2, T[x].d[], T[x].d[], T[x].d[], T[x].d[])) ret += T[x].v;
        return query(ls, x1, y1, x2, y2) + query(rs, x1, y1, x2, y2) + ret;
    }
    inline int rebuild(int l, int r, int d) {
        if(l>r) return ;
        int mid = l+r>>;
        D = d; nth_element(t+l, t+mid, t+r+);
        T[mid] = t[mid];
        T[mid].l = rebuild(l, mid-, d^);
        T[mid].r = rebuild(mid+, r, d^);
        up(mid);
        return mid;
    }
}T;

# undef ls
# undef rs

int REBUILD_SIZE = ;

int main() {
    scanf("%*d"); T.set();
    int opt, x1, y1, x2, y2;
    while() {
        scanf("%d", &opt); if(opt == ) break;
        if(opt == ) {
            scanf("%d%d%d", &x1, &y1, &x2);
            T.tmp.d[] = T.tmp.mx[] = T.tmp.mi[] = x1;
            T.tmp.d[] = T.tmp.mx[] = T.tmp.mi[] = y1;
            T.tmp.v = x2, T.tmp.s = x2;
            T.insert(T.rt, );
            if(T.siz == REBUILD_SIZE) {
                for (int i=; i<=T.siz; ++i) t[i] = T.T[i];
                T.rt = T.rebuild(, T.siz, );
                REBUILD_SIZE += ;
            }
        }
        if(opt == ) {
            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
            printf("%lld\n", T.query(T.rt, x1, y1, x2, y2));
        }
    }
    return ;
}

4066:

# include <cctype>
# include <stdio.h>
# include <string.h>
# include <algorithm>
// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int M = 2e5 + ;
const int mod = 1e9+;

# define RG register
# define ST static

inline ll read() {
    ll x = , f = ; char ch = getchar();
    while(!isdigit(ch)) {
        if(ch == '-') f = -;
        ch = getchar();
    }
    while(isdigit(ch)) {
        x = x*+ch-'';
        ch = getchar();
    }
    return x*f;
}

inline void gmax(int &x, int y) {
    if(x < y) x = y;
}
inline void gmin(int &x, int y) {
    if(x > y) x = y;
}

inline bool in(int x1, int y1, int x2, int y2, int xx1, int yy1, int xx2, int yy2) {
    return x1 <= xx1 && xx2 <= x2 && y1 <= yy1 && yy2 <= y2;
}

inline bool out(int x1, int y1, int x2, int y2, int xx1, int yy1, int xx2, int yy2) {
    return x1 > xx2 || x2 < xx1 || y1 > yy2 || y2 < yy1;
}

int D;
struct node {
    int d[], mx[], mi[], l, r;
    ll v, s;
    friend bool operator == (node a, node b) {
        return a.d[] == b.d[] && a.d[] == b.d[];
    }
    friend bool operator < (node a, node b) {
        return a.d[D] < b.d[D];
    }
}t[M];

# define ls T[x].l
# define rs T[x].r

node tmp;
struct KDTree {
    node T[M];
    int rt, siz;
    inline void set() {
        siz = ; rt = ;
    }
    inline void up(int x) {
        for (int i=; i<; ++i) {
            T[x].mi[i] = T[x].mx[i] = T[x].d[i];
            if(ls) gmin(T[x].mi[i], T[ls].mi[i]);
            if(rs) gmin(T[x].mi[i], T[rs].mi[i]);
            if(ls) gmax(T[x].mx[i], T[ls].mx[i]);
            if(rs) gmax(T[x].mx[i], T[rs].mx[i]);
        }
        T[x].s = T[x].v + T[ls].s + T[rs].s;
    }
    inline void insert(int &x, int d) {
        if(!x) {
            x = ++siz;
            T[x].d[] = T[x].mi[] = T[x].mx[] = tmp.d[];
            T[x].d[] = T[x].mi[] = T[x].mx[] = tmp.d[];
        }
        if(tmp == T[x]) {
            T[x].v += tmp.v;
            T[x].s += tmp.v;
            return ;
        }
        if(tmp.d[d] < T[x].d[d]) insert(ls, d^);
        else insert(rs, d^);
        up(x);
    }
    inline ll query(int x, int x1, int y1, int x2, int y2) {
        if(!x) return 0ll;
        ll ret = ;
        if(in(x1, y1, x2, y2, T[x].mi[], T[x].mi[], T[x].mx[], T[x].mx[])) return T[x].s;
        if(out(x1, y1, x2, y2, T[x].mi[], T[x].mi[], T[x].mx[], T[x].mx[])) return 0ll;
        if(in(x1, y1, x2, y2, T[x].d[], T[x].d[], T[x].d[], T[x].d[])) ret += T[x].v;
        ret += query(ls, x1, y1, x2, y2) + query(rs, x1, y1, x2, y2);
        return ret;
    }
    inline int rebuild(int l, int r, int d) {
        if(l>r) return ;
        int mid = l+r>>; D = d;
        nth_element(t+l, t+mid, t+r+);
        T[mid] = t[mid];
        T[mid].l = rebuild(l, mid-, d^);
        T[mid].r = rebuild(mid+, r, d^);
        up(mid);
        return mid;
    }
}T;

# undef ls
# undef rs

int REBUILD_SIZE = ;

int main() {
    int opt, x1, y1, x2, y2;
    T.set();
    ll lst = ;
    scanf("%*d");
    while() {
        opt = read();if(opt == ) break;
        if(opt == ) {
            x1 = read() ^ lst, y1 = read() ^ lst, x2 = read() ^ lst;
            tmp.d[] = x1, tmp.d[] = y1, tmp.v = tmp.s = x2;
            T.insert(T.rt, );
            if(T.siz == REBUILD_SIZE) {
                for (int i=; i<=T.siz; ++i) t[i] = T.T[i];
                T.rt = T.rebuild(, T.siz, );
                REBUILD_SIZE += ;
            }
        }
        if(opt == ) {
            x1 = read() ^ lst, y1 = read() ^ lst, x2 = read() ^ lst, y2 = read() ^ lst;
            lst = T.query(T.rt, x1, y1, x2, y2);
            printf("%lld\n", lst);
        }
    }
    return ;
}