模拟20 题解（waiting）

留坑待填

T2

 #include<cstdio>
 #include<vector>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #define R register
 using namespace std;
 inline int read()
 {
     int f=,x=;char ch=getchar();
     while(ch>''||ch<''){if(ch=='-')f=-;ch=getchar();}
     while(ch<=''&&ch>=''){x=(x<<)+(x<<)+(ch^);ch=getchar();}
     return f*x;
 }
 const int maxn=;
 int n,m,q;
 char a[][];
 int s[][],b[][],rb[][],cb[][];//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=;i<=n;++i)
         scanf("%s",a[i]+);
     for(int i=;i<=n;++i)
     {
         int nws=,nwb=;
         for(int j=;j<=m;++j)
         {
             cb[i][j]=cb[i-][j];
             rb[i][j]=rb[i][j-];
             if(a[i][j]==''){
                 nws++;
                 if(a[i-][j]==''){nwb++;cb[i][j]++;}
                 if(a[i][j-]==''){nwb++;rb[i][j]++;}
             }
             s[i][j]=s[i-][j]+nws;
             b[i][j]=b[i-][j]+nwb;
         }
     }
     for(R int i=;i<=q;++i)
     {
         R int x=read(),y=read(),xx=read(),yy=read();
         int as=s[xx][yy]-s[x-][yy]-(s[xx][y-]-s[x-][y-]);
         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\n",as-ab);
     }
 }