DFS+BFS练习 C题

C - Oil Deposits

 https://vjudge.net/contest/241948#problem/C

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

0
1
2
2

（复制粘贴的）题意：

和迷宫的输入差不多，‘*’是墙，‘@’是油田，以一个油田为中心，如果它的东南西北一个各个角落，一共八个方向也有油田的话，这些油田就算作一个油田。

 

（复制粘贴的）分析：

查找到‘@’的位置，找到一个，油田加1，对找到的‘@’的四周进行DFS查找，刚开始我以为和迷宫的做法差不多，我把查找过的地方用一个数组标记一下，后来测试结果不对，

才发现在某一次存在题意中的相邻油田时，在主函数中会加1，而实际上这块油田我已经计算进去了，这样就重复了。正确的做法应该是把计算进去的那块油田变为‘*’，这样就不存在重复计算了！！

代码：

#include <stdio.h>
#include <string.h>
int r,c;
char a[1000][1000];
int d[8][2]={1,0,-1,0,0,1,0,-1,-1,-1,1,1,-1,1,1,-1};
void DFS(int i,int j)
{
	a[i][j]='*';
	for(int k=0;k<8;k++)
	{
		int x=i+d[k][0];
		int y=j+d[k][1];
		if(x>=0&&x<r&&y>=0&&y<c&&a[x][y]=='@')
		DFS(x,y);
	}
	return ;
}
int main()
{
	while(~scanf("%d%d",&r,&c)&&r)
	{
		for(int i=0;i<r;i++)
		scanf("%s",a[i]);
		int ans=0;
		for(int i=0;i<r;i++)
		{
			for(int j=0;j<c;j++)
			if(a[i][j]=='@')
			{
				DFS(i,j);
				ans++;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
 }