Oil Deposits
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
0
1
2
2
题意就是让我们寻找一共有多少块油藏,如果这些蕴藏石油的小方格相邻,那么他们被认为是同一油藏的一部分。
所以当我们找到当前方格存在石油的话,就用dfs搜索与他相邻的8个方向是否存在,如果还有就一直搜下去。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 110
#define ll long long
#define inf 0x3f3f3f3f
char mp[maxn][maxn];
bool vis[maxn][maxn];
int dic[8][2]= {0,1,1,1,1,0,1,-1,0,-1,-1,-1,-1,0,-1,1};
int n,m;
int judge(int x,int y)
{
if(vis[x][y]==0&&x>=0&&y>=0&&x<n&&y<m)
return 1;
return 0;
}
void dfs(int sx,int sy)
{
vis[sx][sy]=1;
for(int i=0; i<8; i++)
{
if(mp[sx+dic[i][0]][sy+dic[i][1]]=='@'&&judge(sx+dic[i][0],sy+dic[i][1]))
dfs(sx+dic[i][0],sy+dic[i][1]);
}
}
int main()
{
while(cin>>n>>m)
{
memset(vis,0,sizeof(vis));
if(n==0) break;
int ans=0;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
cin>>mp[i][j];
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
if(mp[i][j]=='@'&&vis[i][j]==0)
{
dfs(i,j);
ans++;
}
}
}
cout<<ans<<endl;
}
return 0;
}