树状数组
BZOJ题目传送门
洛谷题目传送门
二维树状数组裸题,开 c c c个二维树状数组就好了。
代码:
#include<cctype>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 305
#define M 105
#define F inline
using namespace std;
int n,m,t[M][N][N],a[N][N];
F char readc(){
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
return l==r?EOF:*l++;
}
F int _read(){
int x=0; char ch=readc();
while (!isdigit(ch)) ch=readc();
while (isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=readc();
return x;
}
F void mdfy(int c,int x,int y,int w){
for (int i=x;i<=n;i+=i&-i)
for (int j=y;j<=m;j+=j&-j)
t[c][i][j]+=w;
}
F int srch(int c,int x,int y){
int ans=0;
for (int i=x;i;i-=i&-i)
for (int j=y;j;j-=j&-j)
ans+=t[c][i][j];
return ans;
}
int main(){
n=_read(),m=_read();
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
mdfy(a[i][j]=_read(),i,j,1);
for (int q=_read(),f,x,y,X,Y,c;q;q--)
if (_read()==1){
x=_read(),y=_read(),c=_read();
mdfy(a[x][y],x,y,-1),mdfy(a[x][y]=c,x,y,1);
}
else{
x=_read()-1,X=_read(),y=_read()-1,Y=_read(),c=_read();
printf("%d\n",srch(c,X,Y)-srch(c,X,y)-srch(c,x,Y)+srch(c,x,y));
}
return 0;
}