寒假集训_专题一题解_B（POJ - 2386）

最新推荐文章于 2020-03-13 00:11:56 发布

m0_46185124

最新推荐文章于 2020-03-13 00:11:56 发布

阅读量111

点赞数

分类专栏：专题训练文章标签： dfs

本文链接：https://blog.csdn.net/m0_46185124/article/details/103964353

版权

专题训练专栏收录该内容

32 篇文章 1 订阅

订阅专栏

题目

								Lake Counting
			 	Time Limit: 1000MS		Memory Limit: 65536K
								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

题目大意

在n×m的网格中每个点时一个湖泊或者陆地，两个湖泊相连为它们相邻（包括斜的方向），问多少组连通的湖泊。

题目分析

对于每个湖泊bfs，bfs一次cnt++

代码

#include <iostream> 

using namespace std;
bool a[110][110];
int dy[8] = {-1,0,1,-1,1,-1,0,1},dx[8]={-1,-1,-1,0,0,1,1,1}, cnt = 0,n,m;
char op[110];
void dfs(int x,int y)
{
	a[x][y] = false;
	for(int i = 0; i < 8; i ++)
	if(x + dx[i] < n && x+dx[i] >= 0 && y + dy[i] < m && y+dy[i] >= 0 && a[x+dx[i]][y+dy[i]])
		dfs(x+dx[i],y+dy[i]);
}
int main()
{
	cin >> n >> m;
	for(int i = 0; i < n; i ++)
	{
		scanf("%s",op);
		for(int j = 0; j < m; j ++)
		if(op[j] == 'W')a[i][j] = true;		
	}
	for(int i = 0; i < n; i ++)
		for(int j = 0; j< m; j++)
		if(a[i][j])
		{
			dfs(i,j);
			cnt ++;
		}
	cout << cnt;
	return 0;
}