Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent toall eight of its neighbors.
Given a diagram of Farmer John's field, determine how many ponds he has.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each characteris either 'W' or '.'. The characters do not have spaces between them.
Output
* Line 1: The numberof ponds in Farmer John's field.
#include<iostream> #include<cstdio>#include<vector>#include<algorithm>#include<queue> #include<cmath>usingnamespacestd;
#define MAX 0x7f7f7f7fcharmap[101][101];
int n,m;
void dfs(int x, int y) {
map[x][y] = '.';
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
int nx = x + dx;
int ny = y + dy;
if (nx >= 0 && nx < n && ny >= 0 && ny < m && map[nx][ny] == 'W') {
dfs(nx, ny);
}
}
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> map[i][j];
}
}
int time = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (map[i][j] == 'W') {
time++;
dfs(i, j);
}
}
}
cout << time << endl;
return0;
}