【洛谷P3801】红色的幻想乡【树状数组】

$Problemlink$

分析：

树状数组维护迷雾数量 横坐标开一个 纵坐标开一个 这样就可以存区间的迷雾
用异或记录抵消 抵消了就$-1$ 否则$+1$

最后统计答案 即横坐标迷雾数$\times$长度$+$纵坐标迷雾数$\times$ 长度 再减去重复的

CODE：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define reg register
using namespace std;
typedef long long ll;
const int N=1e5+5;
ll n,m,Q;
ll c[N],c2[N];
bool a[N],b[N];
ll lowbit(ll x){return x&(-x);} 
void addx(ll x,ll k)
{
	for(;x<=n;x+=lowbit(x)) c[x]+=k;
}
void addy(ll x,ll k)
{
	for(;x<=m;x+=lowbit(x)) c2[x]+=k;
}
ll askx(ll x)
{
	ll res=0;
	for(;x;x-=lowbit(x)) res+=c[x];
	return res;
}
ll asky(ll x)
{
	ll res=0;
	for(;x;x-=lowbit(x)) res+=c2[x];
	return res;
}
int main()
{
	scanf("%lld%lld%lld",&n,&m,&Q);
	while(Q--)
	{
		ll op;
		scanf("%lld",&op);
		if(op==1)
		{
			ll x,y;
			scanf("%lld%lld",&x,&y);
			(a[x])?addx(x,-1):addx(x,1);
			a[x]^=1;
			(b[y])?addy(y,-1):addy(y,1);
			b[y]^=1;
		}
		if(op==2)
		{
			ll x,y,x2,y2;
			scanf("%lld%lld%lld%lld",&x,&y,&x2,&y2);
			ll x0=(askx(x2)-askx(x-1)),y0=(asky(y2)-asky(y-1));
			printf("%lld\n",(x2-x+1)*y0+(y2-y+1)*x0-x0*y0*2);
		}
	}
    return 0;
}