Mobile phones 【POJ - 1195】【二维线段树】

题目链接

---

  关于这道题，我用了二维线段树来做的，但是，我这里又一个疑问，就是我用了个四叉树的线段树的代码却是始终过不了一直在WA，若恰好有大佬经过，能帮小生看一下我不成器的代码吗？

  先放上讨论哪里错的代码供大家讨论，帮我修改，谢谢！

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1024;
int Mem, N, op;
int tree[maxN*maxN<<2];
bool yezi[maxN*maxN<<2];
void buildTree(int rt, int xl, int yl, int xr, int yr)
{
    if(xl == xr && yl == yr)
    {
        tree[rt] = Mem;
        return;
    }
    int mid_x = (xl + xr)>>1, mid_y = (yl + yr)>>1;
    buildTree((rt<<2)-2, xl, yl, mid_x, mid_y);
    if(yl != yr) buildTree((rt<<2)-1, xl, mid_y+1, mid_x, yr);
    else { tree[(rt<<2)-1]=0; yezi[(rt<<2)-1]=true; }
    if(xl != xr) buildTree((rt<<2), mid_x+1, yl, xr, mid_y);
    else { tree[(rt<<2)]=0; yezi[(rt<<2)]=true; }
    if(xl!=xr && yl!=yr) buildTree((rt<<2)+1, mid_x+1, mid_y+1, xr, yr);
    else { tree[(rt<<2)+1]=0; yezi[(rt<<2)+1]=true; }
    tree[rt] = tree[(rt<<2)-2] + tree[(rt<<2)-1] + tree[(rt<<2)] + tree[(rt<<2)+1];
}
void update(int rt, int xl, int yl, int xr, int yr, int qx, int qy, int val)
{
    if(yezi[rt]) return;
    if(xl == xr && yl == yr) { tree[rt]+=val; return; }
    int mid_x = (xl + xr)>>1, mid_y = (yl + yr)>>1;
    if(qx<=mid_x && qy<=mid_y) update((rt<<2)-2, xl, yl, mid_x, mid_y, qx, qy, val);
    else if(qx<=mid_x && qy>mid_y) update((rt<<2)-1, xl, mid_y+1, mid_x, yr, qx, qy, val);
    else if(qx>mid_x && qy<=mid_y) update((rt<<2), mid_x+1, yl, xr, mid_y, qx, qy, val);
    else if(qx>mid_x && qy>mid_y) update((rt<<2)+1, mid_x+1, mid_y+1, xr, yr, qx, qy, val);
    tree[rt] = tree[(rt<<2)-2] + tree[(rt<<2)-1] + tree[(rt<<2)] + tree[(rt<<2)+1];
}
int query(int rt, int xl, int yl, int xr, int yr, int qlx, int qly, int qrx, int qry)
{
    if(yezi[rt]) return 0;
    if(qlx<=xl && qly<=yl && qrx>=xr && qry>=yr) return tree[rt];
    int mid_x = (xl + xr)>>1, mid_y = (yl + yr)>>1;
    int ans = 0;
    if(qlx<=mid_x && qly<=mid_y) ans+=query((rt<<2)-2, xl, yl, mid_x, mid_y, qlx, qly, qrx, qry);
    if(qlx<=mid_x && qry>mid_y) ans+=query((rt<<2)-1, xl, mid_y+1, mid_x, yr, qlx, qly, qrx, qry);
    if(qrx>mid_x && qly<=mid_y) ans+=query((rt<<2), mid_x+1, yl, xr, mid_y, qlx, qly, qrx, qry);
    if(qrx>mid_x && qly>mid_y) ans+=query((rt<<2)+1, mid_x+1, mid_y+1, xr, yr, qlx, qly, qrx, qry);
    return ans;
}
int main()
{
    while(scanf("%d%d", &Mem, &N)!=EOF)
    {
        memset(yezi, false, sizeof(yezi));
        buildTree(1, 0, 0, N-1, N-1);
        while(scanf("%d", &op) && op!=3)
        {
            if(op == 1)
            {
                int e1, e2, e3;
                scanf("%d%d%d", &e1, &e2, &e3);
                update(1, 0, 0, N-1, N-1, e1, e2, e3);
            }
            else
            {
                int e1, e2, e3, e4;
                scanf("%d%d%d%d", &e1, &e2, &e3, &e4);
                printf("%d\n", query(1, 0, 0, N-1, N-1, e1, e2, e3, e4));
            }
        }
    }
    return 0;
}

---

然后再附上正确代码供大家参阅，有些想法之后也拜托大家帮我看一下上面的代码，毕竟可能是我写死了。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1024;
int Res, N, tree[maxN<<2][maxN<<2], op;
void build_In(int rt, int X0, int l, int r, bool flag)
{
    if(l == r)
    {
        if(flag) tree[X0][rt] = Res;
        else tree[X0][rt] = tree[X0<<1][rt] + tree[X0<<1|1][rt];
        return;
    }
    int mid = (l + r)>>1;
    build_In(rt<<1, X0, l, mid, flag);
    build_In(rt<<1|1, X0, mid+1, r, flag);
    tree[X0][rt] = tree[X0][rt<<1] + tree[X0][rt<<1|1];
}
void build_Out(int rt, int l, int r)
{
    if(l == r)
    {
        build_In(1, rt, 0, N-1, true);
        return;
    }
    int mid = (l + r)>>1;
    build_Out(rt<<1, l, mid);
    build_Out(rt<<1|1, mid+1, r);
    build_In(1, rt, 1, N, false);
}
void update_In(int rt, int X0, int l, int r, int qy, int val, bool flag)
{
    if(l == r)
    {
        if(flag) tree[X0][rt] += val;
        else tree[X0][rt] = tree[X0<<1][rt] + tree[X0<<1|1][rt];
        return;
    }
    int mid = (l + r)>>1;
    if(qy<=mid) update_In(rt<<1, X0, l, mid, qy, val, flag);
    else update_In(rt<<1|1, X0, mid+1, r, qy, val, flag);
    tree[X0][rt] = tree[X0][rt<<1] + tree[X0][rt<<1|1];
}
void update_Out(int rt, int l, int r, int qx, int qy, int val)
{
    if(l == r)
    {
        update_In(1, rt, 0, N-1, qy, val, true);
        return;
    }
    int mid = (l + r)>>1;
    if(qx<=mid) update_Out(rt<<1, l, mid, qx, qy, val);
    else update_Out(rt<<1|1, mid+1, r, qx, qy, val);
    update_In(1, rt, 0, N-1, qy, val, false);
}
int query_In(int rt, int X0, int l, int r, int ql, int qr)
{
    if(ql<=l && qr>=r) return tree[X0][rt];
    int mid = (l + r)>>1;
    if(ql>mid) return query_In(rt<<1|1, X0, mid+1, r, ql, qr);
    else if(qr<=mid) return query_In(rt<<1, X0, l, mid, ql, qr);
    else
    {
        int ans = query_In(rt<<1|1, X0, mid+1, r, ql, qr);
        ans += query_In(rt<<1, X0, l, mid, ql, qr);
        return ans;
    }
}
int query_Out(int rt, int l, int r, int qlx, int qly, int qrx, int qry)
{
    if(qlx<=l && qrx>=r) return query_In(1, rt, 0, N-1, qly, qry);
    int mid = (l + r)>>1;
    if(qlx>mid) return query_Out(rt<<1|1, mid+1, r, qlx, qly, qrx, qry);
    else if(qrx<=mid) return query_Out(rt<<1, l, mid, qlx, qly, qrx, qry);
    else
    {
        int ans = query_Out(rt<<1|1, mid+1, r, qlx, qly, qrx, qry);
        ans += query_Out(rt<<1, l, mid, qlx, qly, qrx, qry);
        return ans;
    }
}
int main()
{
    while(scanf("%d%d", &Res, &N)!=EOF)
    {
        build_Out(1, 0, N-1);
        while(scanf("%d", &op) && op!=3)
        {
            if(op == 1)
            {
                int e1, e2, e3;
                scanf("%d%d%d", &e1, &e2, &e3);
                update_Out(1, 0, N-1, e1, e2, e3);
            }
            else
            {
                int e1, e2, e3, e4;
                scanf("%d%d%d%d", &e1, &e2, &e3, &e4);
                printf("%d\n", query_Out(1, 0, N-1, e1, e2, e3, e4));
            }
        }
    }
    return 0;
}