模拟20 题解（waiting）

留坑待填

T2

#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define R register
using namespace std;
inline int read()
{
    int f=1,x=0;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return f*x;
}
const int maxn=2005;
int n,m,q;
char a[2005][2005];
int s[2005][2005],b[2005][2005],rb[2005][2005],cb[2005][2005];//s[i][j]，b[i][j]从(i,j)到左上角的点数,边数，rb[i][j]第i行到j列的前缀和
int main()
{
    //freopen("data","r",stdin);
    n=read(),m=read(),q=read();
    for(R int i=1;i<=n;++i)
        scanf("%s",a[i]+1);
    for(int i=1;i<=n;++i)
    {
        int nws=0,nwb=0;
        for(int j=1;j<=m;++j)
        {
            cb[i][j]=cb[i-1][j];
            rb[i][j]=rb[i][j-1];
            if(a[i][j]=='1'){
                nws++;
                if(a[i-1][j]=='1'){nwb++;cb[i][j]++;}
                if(a[i][j-1]=='1'){nwb++;rb[i][j]++;}
            }
            s[i][j]=s[i-1][j]+nws;
            b[i][j]=b[i-1][j]+nwb;
        }
    }
    for(R int i=1;i<=q;++i)
    {
        R int x=read(),y=read(),xx=read(),yy=read();
        int as=s[xx][yy]-s[x-1][yy]-(s[xx][y-1]-s[x-1][y-1]);
        int ab=b[xx][yy]-b[x][yy]-(b[xx][y]-b[x][y])+(rb[x][yy]-rb[x][y])+(cb[xx][y]-cb[x][y]);
        printf("%d
",as-ab);
    }
}