Submission #9673129

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()


#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else 
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

int a[2010][2010];

int main() {
	int H, W;
	int N, M;
	cin >> H >> W >> N >> M;
	V<string> s(N);
	rep(i, N) cin >> s[i];
	V<int> xs, ys;

	rep(i, N) {
		xs.pb(i);
		xs.pb(H-N+i+1);
	}
	rep(i, M) {
		ys.pb(i);
		ys.pb(W-M+i+1);
	}

	sort(ALL(xs));
	sort(ALL(ys));

	rep(i, N) {
		rep(j, M) if (s[i][j] == '#') {
			int p = lower_bound(ALL(xs), i) - xs.begin();
			int q = lower_bound(ALL(ys), j) - ys.begin();
			int r = lower_bound(ALL(xs), H-N+i+1) - xs.begin();
			int s = lower_bound(ALL(ys), W-M+j+1) - ys.begin();
			++a[r][s]; ++a[p][q]; --a[p][s]; --a[r][q];
		}
	}

	ll ans = 0;

	int sx = xs.size(), sy = ys.size();
	rep(i, sx) {
		rep(j, sy - 1) {
			a[i][j+1] += a[i][j];
		}
	}
	rep(i, sx-1) {
		rep(j, sy) {
			a[i+1][j] += a[i][j];
		}
	}
	rep(i, sx-1) {
		rep(j, sy-1) {
			if (a[i][j]>0) {
				ans += (ll)(xs[i+1] - xs[i]) * (ys[j+1] - ys[j]);
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result