poj-【2386 Lake Counting】

最新推荐文章于 2024-02-03 18:31:20 发布

有梦就不怕痛

最新推荐文章于 2024-02-03 18:31:20 发布

阅读量297

点赞数

分类专栏： BFS、DFS

本文链接：https://blog.csdn.net/Cai_Nia/article/details/53511940

版权

BFS、DFS 专栏收录该内容

33 篇文章 1 订阅

订阅专栏

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 31206		Accepted: 15583

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

#include<cstdio>
int n,m;
char map[120][120];
void dfs(int nx,int ny)
{
	map[nx][ny]='.';
	int i,j;
	for(i=-1;i<=1;++i)
	{
		for(j=-1;j<=1;++j)
		{
			int dx=nx+i;
			int dy=ny+j;
			if(dx>=0&&dx<n&&dy>=0&&dy<m&&map[dx][dy]=='W')
				dfs(dx,dy); 
		} 
	} 
} 
int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		int i,j;
		for(i=0;i<n;++i)
			scanf("%s",map[i]);
		int sum=0;
		for(i=0;i<n;++i)
		{
			for(j=0;j<m;++j)
			{
				if(map[i][j]=='W')
				{
					++sum;
					dfs(i,j); 
				} 
			} 
		}
		printf("%d\n",sum); 
	} 
	return 0;
}