BZOJ 1452: [JSOI2009]Count [二维树状数组]

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=301,M=101;
inline int read(){
char c=getchar();int x=0,f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int n,m,c[M]

,col

;
int Q,op,x,y,x1,y1,x2,y2,v;
inline int lowbit(int x){return x&-x;}
inline void add(int c

,int x,int y,int v){
for(int i=x;i<=n;i+=lowbit(i))
for(int j=y;j<=m;j+=lowbit(j)) c[i][j]+=v;
}
inline int sum(int c

,int x,int y){
int re=0;
for(int i=x;i;i-=lowbit(i))
for(int j=y;j;j-=lowbit(j)) re+=c[i][j];
return re;
}
int main(){
freopen("in","r",stdin);
n=read();m=read();
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
col[i][j]=read();
add(c[col[i][j]],i,j,1);
}
Q=read();
while(Q--){
op=read();
if(op==1){
x=read();y=read();v=read();
add(c[col[x][y]],x,y,-1);
col[x][y]=v;
add(c[col[x][y]],x,y,1);
}else{
x1=read()-1;x2=read();y1=read()-1;y2=read();v=read();
int ans=sum(c[v],x2,y2)-sum(c[v],x1,y2)-sum(c[v],x2,y1)+sum(c[v],x1,y1);
printf("%d\n",ans);
}
}
}