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
题意:
@表示里面有油,*表示没有,如果@的左右上下斜对都没有@了,算一块油田,求有几块油田。
思路:找到一个@位置,对它的上下左右斜对都找一遍如果某个方向成立,则接着找,并把找过的点@标成*,如果确定它的上下左右斜对都不是油,则找下一个@;
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int m,n;
char map[100][100];
void dfs(int x,int y)
{
if(x<0||x>=m||y<0||y>=n||map[x][y]=='*')
return;
else
{
map[x][y]='*';
dfs(x-1,y-1);
dfs(x-1,y);
dfs(x-1,y+1);
dfs(x,y-1);
dfs(x,y+1);
dfs(x+1,y-1);
dfs(x+1,y);
dfs(x+1,y+1);
}
}
int main()
{
while(~scanf("%d%d",&m,&n))
{
if(m==0||n==0)
{
return 0;
}
for(int i=0; i<m; i++)
for(int j=0; j<n; j++)
cin>>map[i][j];
int ans=0;
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
if(map[i][j]=='@')
{
dfs(i,j);
ans++;
}
}
}
cout<<ans<<endl;
}
}