poj1195 Mobile phones 二维线段树入门

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define MS0(a) memset(a,0,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

using namespace std;

typedef long long ll;
const int maxn=1500;
const int INF=1e9+10;

int n;
int op;
int x,y,z;
int xt1,yt1,xt2,yt2;
struct NodeY
{
    int l,r;
    int cnt;
};
struct NodeX
{
    int l,r;
    int cnt;
    NodeY ty[maxn<<2];
    void up(int rt)
    {
        ty[rt].cnt=ty[rt<<1].cnt+ty[rt<<1|1].cnt;
    }
    void build(int l,int r,int rt)
    {
        ty[rt].l=l;ty[rt].r=r;
        ty[rt].cnt=0;
        if(l==r) return;
        int m=(l+r)>>1;
        build(lson);
        build(rson);
        up(rt);
    }
    void update(int p,int c,int l,int r,int rt)
    {
        if(l==r){
            ty[rt].cnt+=c;
            return;
        }
        int m=(l+r)>>1;
        if(p<=m) update(p,c,lson);
        else update(p,c,rson);
        up(rt);
    }
    int query(int L,int R,int l,int r,int rt)
    {
        if(L<=l&&r<=R) return ty[rt].cnt;
        int m=(l+r)>>1;
        int res=0;
        if(L<=m) res+=query(L,R,lson);
        if(R>m) res+=query(L,R,rson);
        return res;
    }
};NodeX tx[maxn<<2];

void up(int rt)
{
    tx[rt].cnt=tx[rt<<1].cnt+tx[rt<<1|1].cnt;
}

void build(int l,int r,int rt)
{
    tx[rt].l=l;tx[rt].r=r;
    tx[rt].cnt=0;
    tx[rt].build(1,n,1);
    if(l==r) return;
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    up(rt);
}

void update(int x,int y,int c,int l,int r,int rt)
{
    tx[rt].update(y,c,1,n,1);
    if(l==r) return;
    int m=(l+r)>>1;
    if(x<=m) update(x,y,c,lson);
    else update(x,y,c,rson);
    up(rt);
}

int query(int xL,int xR,int yL,int yR,int l,int r,int rt)
{
    if(xL<=l&&r<=xR) return tx[rt].query(yL,yR,1,n,1);
    int m=(l+r)>>1;
    int res=0;
    if(xL<=m) res+=query(xL,xR,yL,yR,lson);
    if(xR>m) res+=query(xL,xR,yL,yR,rson);
    return res;
}

int main()
{
    freopen("in.txt","r",stdin);
    scanf("%d%d",&op,&n);
    build(1,n,1);
    while(~scanf("%d",&op)&&op!=3){
        if(op==1){
            scanf("%d%d%d",&x,&y,&z);
            x++;y++;
            update(x,y,z,1,n,1);
        }
        else{
            scanf("%d%d%d%d",&xt1,&yt1,&xt2,&yt2);
            xt1++;yt1++;xt2++;yt2++;
            printf("%d\n",query(xt1,xt2,yt1,yt2,1,n,1));
        }
    }
    return 0;
}