BZOJ 1513: [POI2006]Tet-Tetris 3D

/**************************************************************
    Problem: 1513
    User: BeiYu
    Language: C++
    Result: Accepted
    Time:14660 ms
    Memory:143344 kb
****************************************************************/
 
#include <bits/stdc++.h>
using namespace std;
 
#define mid ((l+r)>>1)
#define lc (o<<1)
#define rc (o<<1|1)
const int M = 1005;
 
inline int in(int x=0,char ch=getchar()) { while(ch>‘9‘ || ch<‘0‘) ch=getchar();
    while(ch>=‘0‘ && ch<=‘9‘) x=x*10+ch-‘0‘,ch=getchar();return x; }
 
int D,S,N;
int d,s,w,x,y;
int ql,qr,qx,qy;
 
struct Node {
    int d[M*3],g[M*3];
     
    void Change(int o,int l,int r,int L,int R,int v) {
        d[o]=max(d[o],v);
        if(L<=l && r<=R) return void( g[o]=max(g[o],v) );
        if(L<=mid) Change(lc,l,mid,L,R,v);
        if(R>mid) Change(rc,mid+1,r,L,R,v);
    }
    int Query(int o,int l,int r,int L,int R) {
        if(L<=l && r<=R) return d[o];
        int res=g[o];
        if(L<=mid) res=max(res,Query(lc,l,mid,L,R));
        if(R>mid) res=max(res,Query(rc,mid+1,r,L,R));
        return res;
    }
};
 
struct Seg {
    Node d[M*3],g[M*3];
    void Change(int o,int l,int r,int L,int R,int v) {
        d[o].Change(1,1,S,qx,qy,v);
        if(L<=l && r<=R) return void( g[o].Change(1,1,S,qx,qy,v) );
        if(L<=mid) Change(lc,l,mid,L,R,v);
        if(R>mid) Change(rc,mid+1,r,L,R,v);
    }
    int Query(int o,int l,int r,int L,int R) {
        if(L<=l && r<=R) return d[o].Query(1,1,S,qx,qy);
        int res=g[o].Query(1,1,S,qx,qy);
        if(L<=mid) res=max(res,Query(lc,l,mid,L,R));
        if(R>mid) res=max(res,Query(rc,mid+1,r,L,R));
        return res;
    }
}py;
int main() {
    for(D=in(),S=in(),N=in();N--;) {
        d=in(),s=in(),w=in(),x=in(),y=in();
        ql=x+1,qr=x+d,qx=y+1,qy=y+s;
        int tmp=py.Query(1,1,D,ql,qr);
        py.Change(1,1,D,ql,qr,tmp+w);
    }
    qx=1,qy=S;
    printf("%d\n",py.Query(1,1,D,1,D));
    return 0;
}