POJ 2155 Matrix

二维入门题。树状数组和线段树都可以，看过论文的话二维树状数组就应该能懂，而二维线段树就要麻烦一些，时刻想着树套树。

二维树状数组

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<cmath>
#include<map>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", s)
#define PC(n) printf("Case %d: ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1e9+7;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 1111;
const int M = N << 2;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

int c[N][N], n, m;

void add(int x, int y)
{
    for(int i = x; i <= n; i += i & (-i))
        for(int j = y; j <= n; j += j & (-j))
            c[i][j] ^= 1;
}

int sum(int x, int y)
{
    int s = 0;
    for(int i = x; i > 0; i -= i & (-i))
        for(int j = y; j > 0; j -= j & (-j))
            s += c[i][j];
    return s & 1;
}

int main()
{
    //freopen("input.txt", "r", stdin);

    int t, x1, x2, y1, y2;
    char op[5];
    RI(t);
    while(t--)
    {
        RII(n, m);
        CLR(c, 0);
        while(m--)
        {
            RS(op);
            if(op[0] == 'Q')
            {
                RII(x1, y1);
                PI(sum(x1, y1));
            }
            else
            {
                RIV(x1, y1, x2, y2);
                add(x1, y1);
                add(x1, y2 + 1);
                add(x2 + 1, y1);
                add(x2 + 1, y2 + 1);
            }
        }
        if(t)puts("");
    }
    return 0;
}

二维线段树

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
#define PC(n) printf("Case %d:\n", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 9901;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const int N = 1111;
const int M = N << 2;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

bool num[M][M];
int x1, x2, y1, y2, ans, n, m;

void update2(int x0, int l, int r, int rt)
{
    if(y1 <= l && r <= y2)
    {
        num[x0][rt] ^= 1;
        return;
    }
    int m = (l + r) >> 1;
    if(y1 <= m)update2(x0, lson);
    if(y2 > m)update2(x0, rson);
}

void update1(int l, int r, int rt)
{
    if(x1 <= l && r <= x2)
    {
        update2(rt, 1, n, 1);
        return;
    }
    int m = (l + r) >> 1;
    if(x1 <= m)update1(lson);
    if(x2 > m)update1(rson);
}

void query2(int x0, int l, int r, int rt)
{
    ans ^= num[x0][rt];
    if(l == r)return ;
    int m = (l + r) >> 1;
    if(y1 <= m)query2(x0, lson);
    else query2(x0, rson);
}

void query1(int l, int r, int rt)
{
    query2(rt, 1, n, 1);
    if(l == r)return;
    int m = (l + r) >> 1;
    if(x1 <= m) query1(lson);
    else query1(rson);
}

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int t;
    char op[5];
    RI(t);
    while(t--)
    {
        RII(n, m);
        CLR(num, 0);
        while(m--)
        {
            RS(op);
            if(op[0] == 'Q')
            {
                RII(x1, y1);
                ans = 0;
                query1(1, n, 1);
                PI(ans);
            }
            else
            {
                RIV(x1, y1, x2, y2);
                update1(1, n, 1);
            }
        }
        if(t)puts("");
    }
    return 0;
}