hdu1241---Oil Deposits（简单搜索）

最新推荐文章于 2022-08-04 20:51:32 发布

Krismile_

最新推荐文章于 2022-08-04 20:51:32 发布

阅读量212

点赞数

分类专栏：搜索

本文链接：https://blog.csdn.net/Krismile_/article/details/86842249

版权

搜索专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Problem Description

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

Input

The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either `*', representing the absence of oil, or `@', representing an oil pocket.

Output

For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.

Sample Input

1 1

3 5

*@*@*

**@**

*@*@*

1 8

@@****@*

5 5

****@

*@@*@

*@**@

@@@*@

@@**@

0 0

Sample Output

解题思路：

从第一个@开始进行搜索，不停的把邻接的@换成*。这样依次dfs后就可以将第一个@相邻的@都替换成*了，然后记一次数，然后再次从下一个@开始dfs直到所有的@都被换成*，那么进行的dfs的次数就是答案了。复杂度位O（m*n）。

具体解释见代码注释。

AC代码：

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
char a[105][105];
int n,m;
void dfs(int x,int y)
{
	a[x][y]='*'; //将其标记为*
	for(int dx=-1;dx<=1;dx++)
		for(int dy=-1;dy<=1;dy++){ //遍历移动的八个方向
			int nx=x+dx;
			int ny=y+dy;
			if(nx>=0&&nx<m&&ny>=0&&ny<n&&a[nx][ny]=='@') //判断是否在范围内且是油田
				dfs(nx,ny);//再从这个相邻的开始dfs
		}
	return ; //直到所有的相邻的都被标记，完成这一次dfs，即记录了一片相邻的油田
}
int main()
{
	while(~scanf("%d%d",&m,&n)){
		if(m==0||n==0)
			break;
		int sum=0;
		for(int i=0;i<m;i++)
			scanf("%s",a[i]);
		for(int i=0;i<m;i++)
			for(int j=0;j<n;j++){
				if(a[i][j]=='@'){
					dfs(i,j);
					sum++; //记录dfs的次数，即是答案
				}
			}
		printf("%d\n",sum);
	}
	return 0;
}