【BZOJ1452】【JSOI2009】Count

题目描述

　　

数据范围

c<=100,n,m<=300,Q<=200000

样例输入

3 3
1 2 3
3 2 1
2 1 3
3
2 1 2 1 2 1
1 2 3 2
2 2 3 2 3 2

样例输出

1
2

解题思路

二维的树状数组，以前还没有写过

代码

/**************************************************************
    Problem: 1452
    User: cedric161038
    Language: C++
    Result: Accepted
    Time:3344 ms
    Memory:39876 kb
****************************************************************/

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
using namespace std;//↓来自PoPoQQQ(orz)的输入输出
namespace IStream{const int LLL=1<<15;char buffer[LLL],*SSS,*TTT;char Get_Char(){if(SSS==TTT){TTT=(SSS=buffer)+fread(buffer,1,LLL,stdin);if(SSS==TTT) return EOF;}return *SSS++;}int Getint(){char c;int re=0,f=1;for(c=Get_Char();c<'0'||c>'9';c=Get_Char())if(c=='-')f=-1;while(c>='0'&&c<='9')re=(re<<1)+(re<<3)+(c-'0'),c=Get_Char();return re*f;}}class OStream{private:static const int LLL=1<<15;char staack[21];int topp;char buffer[LLL],*SSS;public:OStream(){SSS=buffer;}void Putint(int x,int flag){bool fl=false;if(flag==1) staack[++topp]=' ';if(flag==2) staack[++topp]='\n';if(x<0) x=-x,fl=true;if(!x) staack[++topp]='0';while(x)staack[++topp]=x%10+'0',x/=10;if(fl)staack[++topp]='-';while(topp){if(SSS==buffer+LLL-1){fwrite(buffer,1,SSS-buffer,stdout);SSS=buffer;}*SSS++=staack[topp--];}}~OStream(){fwrite(buffer,1,SSS-buffer,stdout);*SSS=0;}}os;
#ifndef ONLINE_JUDGE
inline int Getint(){int x=0,f=1;char ch=getchar();while('0'>ch||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
#else
using namespace IStream;//↑来自PoPoQQQ(orz)的输入输出
#endif
int Map[305][305];
int c[105][305][305];
int n,m;
inline int Lowbit(int x){return x&(-x);}
void Modify(int x,int y,int k,int vl){
    for(int i=x;i<=n;i+=Lowbit(i))
        for(int j=y;j<=m;j+=Lowbit(j))
            c[k][i][j]+=vl;
}
int Ask(int x,int y,int k){
    int ret=0;
    for(int i=x;i;i-=Lowbit(i))
        for(int j=y;j;j-=Lowbit(j))
            ret+=c[k][i][j];
    return ret;
}
int main(){
    memset(c,0,sizeof(c));
    n=Getint(),m=Getint();
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            Map[i][j]=Getint();
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            Modify(i,j,Map[i][j],1);
    int q=Getint();
    while(q--){
        int op=Getint();
        if(op==2){
            int x1=Getint(),x2=Getint(),y1=Getint(),y2=Getint(),cl=Getint();
            os.Putint(Ask(x2,y2,cl)+Ask(x1-1,y1-1,cl)-Ask(x1-1,y2,cl)-Ask(x2,y1-1,cl),2);
        }
        else{
            int x=Getint(),y=Getint(),cl=Getint();
            Modify(x,y,Map[x][y],-1);
            Map[x][y]=cl;
            Modify(x,y,Map[x][y],1);
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/Cedric341561/p/6811029.html