POJ - 2155 Matrix 二维线段树 / 树状数组

题目链接：https://vjudge.net/problem/POJ-2155#author=0

题意：给定 n* n 矩阵A，其元素为0或1. A [i][j] 表示第i行和第j列中的数字。最初全为0.

我们有两个操作:

1. C x1 y1 x2 y2（1 <= x1 <= x2 <= n，1 <= y1 <= y2 <= n）将左上角为(x1,y1)，右下角为(x2,y2)的矩阵翻转（0变成1，1变成0）。

2. Q x y（1 <= x，y <= n）查询A [x][y]，输出答案。

题解：

树状数组：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define lowbit(x) (x & (-x))
const int N = 1010;
int n, m;
int sum[N][N];
void update(int x, int y) {
	for(int i = x; i <= 1000; i += lowbit(i))
		for(int j = y; j <= 1000; j += lowbit(j))
			sum[i][j] ^= 1;
}
int query(int x, int y) {
	int res = 0;
	for(int i = x; i >= 1; i -= lowbit(i))
		for(int j = y; j >= 1; j -= lowbit(j))
			res ^= sum[i][j];
	return res;
}
int main() {
	int T;
	char op[2];
	int x1, x2, y1, y2;
	scanf("%d", &T);
	while(T--) {
		scanf("%d %d", &n, &m);
		memset(sum, 0, sizeof(sum));
		for(int i = 1; i <= m; i++) {
			scanf("%s %d %d", op, &x1, &y1);
			if(op[0] == 'C') {
				scanf("%d %d", &x2, &y2);
				update(x1, y1);
				update(x1, y2 + 1);
				update(x2 + 1, y1);
				update(x2 + 1, y2 + 1);
			} else {
				printf("%d\n", query(x1, y1));
			}
		}
		if(T) printf("\n");
	}
	return 0;
}

线段树：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define lowbit(x) (x & (-x))
const int N = 1010;
int n, m;
int sum[N << 2][N << 2];
void updatey(int ly, int ry, int l, int r, int cur, int p) {
	if(ly <= l && r <= ry) {
		sum[p][cur] ^= 1;
		return;
	}
	int mid = (l + r) >> 1;
	if(ly <= mid) updatey(ly, ry, l, mid, cur << 1, p);
	if(ry > mid) updatey(ly, ry, mid + 1, r, cur << 1 | 1, p);
}

void updatex(int lx, int rx, int ly, int ry, int l, int r, int cur) {
	if(lx <= l && r <= rx) {
		updatey(ly, ry, 1, n, 1, cur);
		return;
	}
	int mid = (l + r) >> 1;
	if(lx <= mid) updatex(lx, rx, ly, ry, l, mid, cur << 1);
	if(rx > mid) updatex(lx, rx, ly, ry, mid + 1, r, cur << 1 | 1);
}
int queryy(int y, int l, int r, int cur, int p) {
	int res = sum[p][cur];
	if(l == r) return res;
	int mid = (l + r) >> 1;
	if(y <= mid) res ^= queryy(y, l, mid, cur << 1, p);
	else res ^= queryy(y, mid + 1, r, cur << 1 | 1, p);
	return res;
}
int queryx(int x, int y, int l, int r, int cur) {
	int res = queryy(y, 1, n, 1, cur);
	if(l == r) return res;
	int mid = (l + r) >> 1;
	if(x <= mid) res ^= queryx(x, y, l, mid, cur << 1);
	else res ^= queryx(x, y, mid + 1, r, cur << 1 |1); 
	return res;
}
int main() {
	int T;
	char op[2];
	int x1, x2, y1, y2;
	scanf("%d", &T);
	while(T--) {
		scanf("%d %d", &n, &m);
		memset(sum, 0, sizeof(sum));
		for(int i = 1; i <= m; i++) {
			scanf("%s %d %d", op, &x1, &y1);
			if(op[0] == 'C') {
				scanf("%d %d", &x2, &y2);
				updatex(x1, x2, y1, y2, 1, n, 1);
				
			} else {
				printf("%d\n", queryx(x1, y1, 1, n, 1));
			}
		}
		if(T) printf("\n");
	}
	return 0;
}