CodeForces 373D Counting Rectangles is Fun （四维DP）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+100;
const int ub=1e6;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int dp1[41][41][41][41],dp2[41][41][41][41],dp3[41][41][41][41];
int n,m,q;
string s[50];
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n>>m>>q;
    rep(i,1,n+1){
        cin>>s[i];
        s[i]=' '+s[i];
    }
    for(int i=n;i>=1;i--) for(int j=m;j>=1;j--){
        for(int p=i;p>=1;p--) for(int q=j;q>=1;q--){
            int flag=0;
            dp3[p][q][i][j]=1;
            if(p+1<=i){
                if(!dp3[p+1][q][i][j]) dp3[p][q][i][j]=0;
                dp2[p][q][i][j]+=dp2[p+1][q][i][j];
                flag++;
            }
            if(q+1<=j){
                if(!dp3[p][q+1][i][j]) dp3[p][q][i][j]=0;
                dp2[p][q][i][j]+=dp2[p][q+1][i][j];
                flag++;
            }
            if(flag==2) dp2[p][q][i][j]-=dp2[p+1][q+1][i][j];
            if(s[p][q]=='1') dp3[p][q][i][j]=0;
            if(dp3[p][q][i][j]) dp2[p][q][i][j]++;
        }
    }
    for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){
        for(int p=i;p<=n;p++) for(int q=j;q<=m;q++){
            int flag=0;
            if(p-1>=i){
                dp1[i][j][p][q]+=dp1[i][j][p-1][q];
                flag++;
            }
            if(q-1>=j){
                dp1[i][j][p][q]+=dp1[i][j][p][q-1];
                flag++;
            }
            if(flag==2)
                dp1[i][j][p][q]-=dp1[i][j][p-1][q-1];
            dp1[i][j][p][q]+=dp2[i][j][p][q];
        }
    }
    rep(i,0,q){
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        cout<<dp1[x1][y1][x2][y2]<<"\n";
    }
    return 0;
}