二维树状数组 ---- codeforces341D

题目链接

---

题目大意：给你一个矩阵初始值全是0
现在有两个操作：
$1.询问(x0,y0)到(x1,y1)这个矩阵内部的异或和$
$2.将(x0,y0)到(x1,y1)这个矩阵内部异或上x$

---

解题思路：首先我们先看一维的情况的xor的区间修改和区间查询
1.首先我们知道区间修改的$[l,r]$,我们会在$l$位置异或上$x$,在$r+1$的位置再异或一个$x$
2.但是有个问题是在求区间xor和的时候假如说你$l$是奇数位那么在后面只有奇数位是有效的因为异或具有可消性所以我们要对区间位置按照奇偶性分成两个树状数组去维护$tr[2][maxn]$
3.现在是一个二维矩阵那么我们看一下假如说我们在某个$(x_0,y_0)$xor一个$x$那么在区间查询的时候它对上面的影响是哪个位置?,就是和$(x_0,y_0)$同奇偶的位置

---

#include<bits/stdc++.h>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define hash Hash
#define next Next
#define pb push_back
#define f first
#define s second
#define y1 Y
using namespace std;
const int N = 1e7 + 10, mod = 1e9 + 7;
const int maxn = 4e5 + 10;
const long double eps = 1e-5;
const int EPS = 500 * 500;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
const int BUF=30000000;
char Buf[BUF],*buf=Buf;
template<typename T> void read(T &a)
{
     for(a=0;*buf<48;buf++);
    while(*buf>47) a=a*10+ *buf++ -48;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
   read(first);
   read(args...);
}
ll n, m;
ll tr[2][2][1100][1100];
inline void add(int x, int y, int val) {
    for(int i = x; i <= 1000; i += lowbit(i))
       for(int j = y; j <= 1000; j += lowbit(j))
        tr[x & 1][y & 1][i][j] ^= val;
}

inline ll get(int x, int y) {
    ll res = 0;
    for(int i = x; i; i -= lowbit(i))
      for(int j = y; j; j -= lowbit(j))
        res ^= tr[x & 1][y & 1][i][j];
    return res;
}

int main()
{
    fread(Buf,1,BUF,stdin);
    read(n,m);
    while(m --) {
        ll op, x, y, x0, y0, val;
        read(op);
        if(op == 2) {
            read(x,y,x0,y0,val);
            add(x,y,val);
            add(x,y0+1,val);
            add(x0+1,y,val);
            add(x0+1,y0+1,val);
        } else {
            ll val = 0;
            read(x,y,x0,y0);
            val ^= get(x0,y0);
            val ^= get(x-1,y0);
            val ^= get(x0,y-1);
            val ^= get(x-1,y-1);
            printf("%lld\n",val);
        }
        
    }
    return 0;
}