Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- #define all(x) x.begin(), x.end()
- #define sz(x) int(x.size())
- #define endl '\n'
- int n, m;
- void solve() {
- int ans = 0;
- vector<vector<char>> grid(n, vector<char>(m));
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- cin >> grid[i][j];
- }
- }
- vector<vector<bool>> vis(n, vector<bool>(m));
- auto valid = [&](int i, int j) {
- return 0 <= i && i < n && 0 <= j && j < m && !vis[i][j] && grid[i][j] == '@';
- };
- function<void(int , int )> dfs = [&](int i, int j) {
- for (int di = -1; di < 2; di++) {
- for (int dj = -1; dj < 2; dj++) {
- if (!di && !dj) continue;
- int ni = di + i, nj = dj + j;
- if (valid(ni, nj)) {
- vis[ni][nj] = true;
- dfs(ni, nj);
- }
- }
- }
- };
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- if (grid[i][j] == '@' && !vis[i][j]) {
- vis[i][j] = true;
- ans++;
- dfs(i, j);
- }
- }
- }
- cout << ans << endl;
- }
- int main() {
- cin.tie(0), cin.sync_with_stdio(0);
- while (cin >> n >> m, n && m)
- solve();
- }
Advertisement
Add Comment
Please, Sign In to add comment