Poj- 2386 Lake Counting

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 31465		Accepted: 15720

Description

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.

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 character is either 'W' or '.'. The characters do not have spaces between them.

Output

* Line 1: The number of ponds in Farmer John's field.

Sample Input

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

Sample Output

3

Hint

OUTPUT DETAILS:

There are three ponds: one in the upper left, one in the lower left,and one along the right side.

#include<stdio.h>
#include<string.h>
int n,m;
char str[105][105];
void dfs(int x,int y)
{
	str[x][y] = '.';
	for(int dx = -1;dx <= 1;dx ++){
		for(int dy= -1;dy <=1;dy ++){
			int nx = x+dx,ny = y+dy;
			if(0<=nx&&nx<n&&0<=ny&&ny<m&&str[nx][ny]=='W')
			dfs(nx,ny);
		}
	}
}
int main()
{
	while(~scanf("%d%d",&n,&m)){
		int k = 0;
		for(int i = 0;i < n;i ++)
			scanf("%s",str[i]);
		for(int i = 0;i < n;i ++){
			for(int j = 0;j < m;j ++){
				if(str[i][j]=='W'){
					dfs(i,j);
					k++;
				}
			}
		}
		printf("%d\n",k);
	}
return 0;
 }