Submission #1689587

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

using ll = long long;
using P = pair<int, int>;

// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int main() {
  // 入力
  int R, C, K;
  cin >> R >> C >> K;
  vector<string> field(R);
  for (int i = 0; i < R; i++) cin >> field[i];

  int ans = 0;
  for (int x = K - 1; x < R - K + 1; x++) {
    for (int y = K - 1; y < C - K + 1; y++) {
      bool flag = true;
      for (int i = 0; i < R; i++) {
        for (int j = 0; j < C; j++) {
          if (abs(i - x) + abs(j - y) <= K - 1 && field[i][j] == 'x') flag = false;
        }
      }
      if (flag) ans++;
    }
  }

  // 解答
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result