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
Source
Recommend
Eddy
深搜学习来自
gzhu_101majia
#include<iostream>
using namespace std;
int n,m;
char map[110][110];
void dfs(int i,int j)
{
if(map[i][j]!='@'||i<0||i>=m||j<0||j>=n)//如果越界或不为'@',则退出;否则从八个方位搜索,找到更改为'*';
return ;
map[i][j]='*';
dfs(i+1,j);
dfs(i-1,j);
dfs(i,j+1);
dfs(i,j-1);
dfs(i+1,j+1);
dfs(i+1,j-1);
dfs(i-1,j+1);
dfs(i-1,j-1);
}
int main()
{
//freopen("a.txt","r",stdin);
while(cin>>m>>n&&n&&m)
{
int sum=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
cin>>map[i][j];
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
if(map[i][j]=='@')
{
dfs(i,j);
sum++;
}
cout<<sum<<endl;
}
}
广搜,纯粹是为了练习算法,其实该题没深搜快,且代码也较多。思想和深搜一样,能搜到说明为一个储量,标记为'*'。
#include<iostream>
#include<queue>
using namespace std;
struct node{
int x,y;
};
char s[110][110];
int sum,m,n;
int dir[8][2]={1,0,0,1,-1,0,0,-1,1,1,-1,1,1,-1,-1,-1};
bool check(int x,int y)//判断越界和是否搜到'@';
{
if(x>=0&&x<m&&y>=0&&y<n&&s[x][y]=='@')
return true;
return false;
}
void bfs()
{
queue<node>Q;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
node start;
if(s[i][j]=='@')//发现新储蓄块;
{
s[i][j]='*';
sum++;
start.x=i;
start.y=j;
Q.push(start);
while(!Q.empty())
{
node temp=Q.front();
Q.pop();
for(int i=0;i<8;i++)//朝8个方向搜;
{
node t;
t.x=temp.x+dir[i][0];
t.y=temp.y+dir[i][1];
if(check(t.x,t.y))//搜到记录并标记,弹进队列中;
{
s[t.x][t.y]='*';
Q.push(t);
}
}
}
}
}
}
int main()
{
//freopen("a.txt","r",stdin);
while(cin>>m>>n&&m&&n)
{
sum=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
cin>>s[i][j];
bfs();
cout<<sum<<endl;
}
}