poj 2155 Matrix(二维树状数组)

http://poj.org/problem?id=2155

　　二维树状数组【区间更新，单点查询】，一道简单题！

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 1005;
struct BIT2D {
    int size;
    bool val[maxn][maxn];

    void init() {
        memset(val, false, sizeof(val));
    }

    void addArea(int x, int y) {
        for (; x > 0; x -= (-x) & x) {
            for (int j = y; j > 0; j -= (-j) & j) {
                val[x][j] = !val[x][j];
            }
        }
    }

    bool getPoint(int x, int y) {
        bool ans = false;

        for (; x <= size; x += (-x) & x) {
            for (int j = y; j <= size; j += (-j) & j) {
                ans ^= val[x][j];
            }
        }

        return ans;
    }

    void print() {
        for (int i = 1; i <= size; i++) {
            for (int j = 1; j <= size; j++) {
                printf("%d ", val[i][j]);
            }
            puts("");
        }
        puts("~~~");
    }
} bit;

void deal(int op) {
    char buf[3];
    int x1, x2, y1, y2;

    bit.init();
    while (op--) {
        scanf("%s", buf);
        if (buf[0] == 'Q') {
            scanf("%d%d", &x1, &y1);
//            printf("hell?? %d %d\n", x1, y1);
            printf("%d\n", bit.getPoint(x1, y1));
        } else {
            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
            bit.addArea(x1 - 1, y1 - 1);
            bit.addArea(x1 - 1, y2);
            bit.addArea(x2, y1 - 1);
            bit.addArea(x2, y2);
        }
//        bit.print();
    }
    puts("");
}

int main() {
    int T;

//    freopen("in", "r", stdin);
    scanf("%d", &T);
    while (T--) {
        int op;

        scanf("%d%d", &bit.size, &op);
        deal(op);
    }

    return 0;
}

——written by Lyon