问题描述
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.
输入
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.
输出
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.
样例输入
1 1
*
3 5
@@*
@
@@*
1 8
@@***@
5 5
****@
@@@
@**@
@@@@
@@**@
0 0
样例输出
0
1
2
2
题意是找出@有多少个连通子图(周围8个方向找)
思路:先遍历整个地图,找到一个@,然后DFS深搜,找到一个@就把它标记为星号,表示已经搜索过了。
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<cmath>
#define N 100000
#define INF 0x3f3f3f3f
#define ll long long
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
int n,m;
string g[N];
int dir[8][2]={1,0,0,1,-1,0,0,-1,1,1,1,-1,-1,-1,-1,1};
void dfs(int x,int y)
{
int i,dx,dy;
for(i=0;i<8;i++)
{
dx=x+dir[i][0];
dy=y+dir[i][1];
if(dx<0||dx>=n||dy<0||dy>=m||g[dx][dy]=='*')
continue;
g[dx][dy]='*';
dfs(dx,dy);
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int i,j;
int count;
while(cin>>n>>m,n||m)
{
count=0;
for(i=0;i<n;i++)
{
cin>>g[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(g[i][j]=='@')
{
count++;
dfs(i,j);
}
}
}
cout<<count<<endl;
}
return 0;
}