Submission #2229322

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 4005;

int num[MAX_N][MAX_N];
int sm[MAX_N][MAX_N];

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n,m,q;
	cin >> n >> m >> q;
	vs s(n);
	rep(i,n){
		cin >> s[i];
	}
	rep(i,n){
		rep(j,m){
			num[2*i][2*j] = (s[i][j] -'0');
		}
	}
	rep(i,n){
		rep(j,m-1){
			if(s[i][j] == '1' && s[i][j+1] == '1'){
				num[2*i][2*j+1] = -1;
			}
		}
	}
	rep(j,m){
		rep(i,n-1){
			if(s[i][j] == '1' && s[i+1][j] == '1'){
				num[2*i+1][2*j] = -1;
			}
		}
	}
	rep(i,2*n){
		rep(j,2*m){
			sm[i+1][j+1] = sm[i+1][j] + num[i][j]; 
		}
	}
	rep(j,2*m+1){
		rep(i,2*n+1){
			sm[i+1][j] += sm[i][j];
		}
	}
	rep(i,q){
		int a,b,c,d;
		cin >> a >> b >> c >> d;
		--a,--b,--c,--d;
		cout << sm[2*c+1][2*d+1] - sm[2*a][2*d+1] - sm[2*c+1][2*b] + sm[2*a][2*b] << "\n";
	}
	return 0;
}

Submission Info

Judge Result