逃离魔爪---二维树状数组求区间和-板子题

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define int long long
const int N = 2010,mod = 1e9+7;

int tr1[N][N],tr2[N][N],tr3[N][N],tr4[N][N];
int n,m,q;
int lowbit(int x){return x&-x;}
void tr_add(int x,int y,int v)
{
    for(int i=x;i<=n;i+=lowbit(i))
        for(int j=y;j<=m;j+=lowbit(j))
        {
            tr1[i][j]+=v;
            tr2[i][j]+=x*v;
            tr3[i][j]+=y*v;
            tr4[i][j]+=x*y*v;
        }
}
void add(int x1,int y1,int x2,int y2,int v)
{
    tr_add(x1,y1,v);
    tr_add(x1,y2+1,-v);
    tr_add(x2+1,y1,-v);
    tr_add(x2+1,y2+1,v);
}

int sum_query(int x,int y)
{
	int res=0;
	for(int i=x;i;i-=lowbit(i))
		for(int j=y;j;j-=lowbit(j))
			res+=(x+1)*(y+1)*tr1[i][j]-(y+1)*tr2[i][j]-(x+1)*tr3[i][j]+tr4[i][j];
	return res;
}

int query(int x1,int y1,int x2,int y2)
{
	return sum_query(x2,y2)-sum_query(x2,y1-1)-sum_query(x1-1,y2)+sum_query(x1-1,y1-1);
}

signed main()
{
	cin>>n>>m>>q;
	while(q--)
	{
		int op,x1,x2,y1,y2;
		cin>>op>>x1>>y1>>x2>>y2;
		if(op==1)add(x1,y1,x2,y2,1);
		else cout<<query(x1,y1,x2,y2)%2<<'\n';
	}
}