BZOJ1513 [POI2006]Tet-Tetris 3D

裸的二维线段树。。。求矩形最大值和矩形覆盖

板子敲起来比较麻烦QAQ

/**************************************************************
    Problem: 1513
    User: rausen
    Language: C++
    Result: Accepted
    Time:24884 ms
    Memory:127268 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
 
using namespace std;
 
inline int read();
 
int n, m;
 
struct segx {
    segx *ls, *rs;
    int mx, tag;
     
    segx() {
        ls = rs = NULL, mx = tag = 0;
    }
     
    #define Len (1 << 16)
    inline void* operator new(size_t) {
        static segx *mempool, *c;
        if (c == mempool)
            mempool = (c = new segx[Len]) + Len;
        *c = segx();
        return c++;
    }
    #undef Len
     
    #define mid (l + r >> 1)
    void build(int l, int r) {
        if (l == r) return;
        ls = new()segx, rs = new()segx;
        ls -> build(l, mid), rs -> build(mid + 1, r);
    }
     
    void modify(int l, int r, int L, int R, int v) {
        mx = max(mx, v);
        if (L <= l && r <= R) {
            tag = max(tag, v);
            return;
        }
        if (L <= mid) ls -> modify(l, mid, L, R, v);
        if (mid < R) rs -> modify(mid + 1, r, L, R, v);
    }
     
    int query(int l, int r, int L, int R) {
        if (L <= l && r <= R) return mx;
        int res = tag;
        if (L <= mid) res = max(res, ls -> query(l, mid, L, R));
        if (mid < R) res = max(res, rs -> query(mid + 1, r, L, R));
        return res;
    }
    #undef mid
};
 
struct segy {
    segy *ls, *rs;
    segx *mx, *tag;
     
    segy() {
        ls = rs = NULL, mx = tag = NULL;
    }
     
    #define Len (1 << 16)
    inline void* operator new(size_t) {
        static segy *mempool, *c;
        if (c == mempool)
            mempool = (c = new segy[Len]) + Len;
        *c = segy();
        return c++;
    }
    #undef Len
     
    #define mid (l + r >> 1)
    void build(int l, int r) {
        mx = new()segx, tag = new()segx;
        mx -> build(1, m), tag -> build(1, m);
        if (l == r) return;
        ls = new()segy, rs = new()segy;
        ls -> build(l, mid), rs -> build(mid + 1, r);
    }
     
    void modify(int l, int r, int L, int R, int x, int y, int v) {
        mx -> modify(1, m, x, y, v);
        if (L <= l && r <= R) {
            tag -> modify(1, m, x, y, v);
            return;
        }
        if (L <= mid) ls -> modify(l, mid, L, R, x, y, v);
        if (mid < R) rs -> modify(mid + 1, r, L, R, x, y, v);
    }
     
    int query(int l, int r, int L, int R, int x, int y) {
        if (L <= l && r <= R) return mx -> query(1, m, x, y);
        int res = tag -> query(1, m, x, y);
        if (L <= mid) res = max(res, ls -> query(l, mid, L, R, x, y));
        if (mid < R) res = max(res, rs -> query(mid + 1, r, L, R, x, y));
        return res;
    }
    #undef mid
} *T;
 
int main() {
    int x, y, dx, dy, h, Tot;
    n = read(), m = read(), Tot = read();
    T = new()segy;
    T -> build(1, n);
    while (Tot--) {
        dx = read(), dy = read(), h = read(), x = read(), y = read();
        T -> modify(1, n, x + 1, x + dx, y + 1, y + dy, T -> query(1, n, x + 1, x + dx, y + 1, y + dy) + h);
    }
    printf("%d
", T -> query(1, n, 1, n, 1, m));
    return 0;
}
 
inline int read() {
    static int x;
    static char ch;
    x = 0, ch = getchar();
    while (ch < '0' || '9' < ch)
        ch = getchar();
    while ('0' <= ch && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}