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 to all eight of its neighbors.
Given a diagram of Farmer John's field, determine how many ponds he has.
Given a diagram of Farmer John's field, determine how many ponds he has.
* 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 character is either 'W' or '.'. The characters do not have spaces between them.
* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
* Line 1: The number of ponds in Farmer John's field.
10 12 W........WW. .WWW.....WWW ....WW...WW. .........WW. .........W.. ..W......W.. .W.W.....WW. W.W.W.....W. .W.W......W. ..W.......W.
3
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
题意:就是判断有多少个连通的积水,W代表积水,有八个方向可以连通,最后输出有几个水洼。
bfs dfs都可以做,很水吧
#include <stdio.h>
int N, M;
char Map[105][105];
bool MAP(int x,int y) {
return x>=0 && y>=0 && x<N && y<M;
}
void dfs(int x, int y) {
Map[x][y] = '.';
for(int i = -1; i <= 1; i++) {
for(int j = -1; j <= 1; j++) {
int dx = x + i;
int dy = y + j;
if(MAP(dx, dy)&&Map[dx][dy] == 'W')
dfs(dx, dy);
}
}
return ;
}
int main() {
scanf("%d%d",&N,&M);
for(int i = 0; i < N; i++)
scanf("%s",Map[i]);
int res = 0;
for(int i = 0 ; i < N; i++) {
for(int j = 0; j < M; j++) {
if(Map[i][j] == 'W') {
dfs(i, j);
res++;
}
}
}
printf("%d\n",res);
return 0;
}