Submission #46984145

---

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif
using int64 = long long;
using uint = unsigned int;
using uint64 = unsigned long long;
bool ckmin(auto& a, auto b) { return b < a ? a = b, 1 : 0; }
bool ckmax(auto& a, auto b) { return b > a ? a = b, 1 : 0; }
using namespace std;

const int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, m;
  cin >> n >> m;
  vector<string> board(n);
  for (int i = 0; i < n; i++) cin >> board[i];
  vector vt(n, vector<int>(m));
  int ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (board[i][j] == '#' && !vt[i][j]) {
        ans++;
        vt[i][j] = true;
        vector<pair<int, int>> que = {{i, j}};
        for (int t = 0; t < (int)que.size(); t++) {
          auto [x, y] = que[t];
          for (int d = 0; d < 8; d++) {
            int x2 = x + dx[d], y2 = y + dy[d];
            if (x2 < 0 || x2 >= n || y2 < 0 || y2 >= m) continue;
            if (board[x2][y2] != '#' || vt[x2][y2]) continue;
            vt[x2][y2] = true;
            que.push_back({x2, y2});
          }
        }
      }
    }
  }
  cout << ans << '\n';

  return 0;
}

Submission Info

Judge Result