Submission #1871958

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long int ll;
#define FOR(i, a, b) for (ll i = (signed)(a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define MOD 1000000007
#define pb push_back
#define INF 93193111451418101
#define MIN -93193111451418101
#define EPS 1e-11
#define tp(a, b, c) make_tuple(a, b, c)
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b))
using namespace std;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename ARR> void fill_all(ARR &arr, const T &v) {
  for (auto &i : arr) {
    fill_all(i, v);
  }
}
//------------------変数-----------------------//
ll h, w, k;
char grid[501][501];
ll vis[501][501];
//-------------------関数----------------------//
bool in(ll y, ll x) {
  if (x < 0 || y < 0 || x == w || y == h)
    return 0;
  return 1;
}

ll DFS(ll x, ll y, ll cnt) {
  ll xy[] = {0, 1, 0, -1, 0};
  vis[x][y] = cnt + 1;
  if (cnt == 0) {
    return 0;
  }
  REP(i, 4) {
    if (in(x + xy[i], y + xy[i + 1]) && vis[x + xy[i]][y + xy[i + 1]] < cnt)
      DFS(x + xy[i], y + xy[i + 1], cnt - 1); // put some stuff here
  }
  return 0; // or something
}
int main() {
  cin >> h >> w >> k;
  REP(i, h) {
    REP(j, w) { cin >> grid[i][j]; }
  }
  REP(i, h) {
    REP(j, w) {
      if (grid[i][j] == 'x') {
        DFS(i, j, k - 1);
      }
    }
  }
  ll cnt = 0;
  FOR(i, k - 1, h - k + 1) {
    FOR(j, k - 1, w - k + 1) {
      if (!vis[i][j])
        cnt++;
    }
  }
  cout << cnt << endl;
}

Submission Info

Judge Result