提出 #334171

---

ソースコード 拡げる

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#define FOR(x, to) for (int x = 0; x < to; x++)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

string s[505];
int up_dp[505][505]; //上から
int down_dp[505][505]; //下から

int ans;
int R, C, K;


int is_put(int p, int q) {
	//cout << p << " " << q << endl;
	for (int i = -K + 1; i <= K - 1; i++) {
		int w = i < 0 ? i : -i;
		if (up_dp[p][q + i] >= K + w && down_dp[p][q + i] >= K + w) continue;
		else return 0;
	}
	return 1;
}

int main() {

	cin >> R >> C >> K;
	FOR(i, R) {
		cin >> s[i];
	}

	for (int i = 0; i < C; i++) {
		for (int j = 0; j < R; j++) {
			if (s[j][i] == 'x') {
				up_dp[j][i] = 0;
			} else {
				up_dp[j][i] = 1;
				if (j - 1 >= 0) up_dp[j][i] += up_dp[j - 1][i];
			}
			if (s[R - j - 1][i] == 'x') {
				down_dp[R - j - 1][i] = 0;
			} else {
				down_dp[R - j - 1][i] = 1;
				if (R - j >= 0) down_dp[R - j - 1][i] += down_dp[R - j][i];
			}
		}
	}

	////debug
	//for (int i = 0; i < R; i++) {
	//	for (int j = 0; j < C; j++) {
	//		cout << up_dp[i][j] << " ";
	//	}
	//	cout << endl;
	//}
	////debug
	//cout << "-----" << endl;
	//for (int i = 0; i < R; i++) {
	//	for (int j = 0; j < C; j++) {
	//		cout << down_dp[i][j] << " ";
	//	}
	//	cout << endl;
	//}
	//cout << "-----" << endl;

	for (int i = K - 1; i < R - K + 1; i++) {
		for (int j = K - 1; j < C - K + 1; j++) {
			ans += is_put(i, j);
		}
	}
	cout << ans << endl;


	return 0;
}

提出情報

ジャッジ結果