每日一题 Lake Counting

Lake Counting

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<iostream>
#include<algorithm>
#include<cstring>
 
using namespace std;

const int N = 110;
char a[N][N];
int n,m;
int res;
void dfs(int x,int y)
{
	a[x][y] = '.'; //访问过的水池换为土地
	int dx[] = { -1,-1,0,1,1,1,0,-1 }, dy[] = { 0,1,1,1,0,-1,-1,-1 }; //小技巧，8个方向的偏移量。

	for (int i = 0;i < 8;i++)
	{
		int nx = x + dx[i], ny = y + dy[i];
		if (nx >= 0 && nx < n && ny >= 0 && ny < m && a[nx][ny] == 'W') dfs(nx, ny);
	}
}
int main()
{
	cin >> n >> m;
	for (int i = 0;i < n;i++) cin >> a[i];

	for (int i = 0;i < n;i++)
		for (int j = 0;j < m;j++)
		{
			if (a[i][j] == 'W')
			{
				dfs(i,j);
				res++;
			}
		}

	cout << res << endl;
	return 0;
}