题目地址:http://bailian.openjudge.cn/practice/1562
1562:Oil Deposits
总时间限制:
1000ms
内存限制:
65536kB
描述
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 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.
输出
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
理解题意:就是一个求一个迷宫中连通块的个数,可以用dfs来做
@代表油,*代表其他
比visit更快/简洁的方法就是可以将走过的@置成*
#include<iostream>
using namespace std;
const int maxn=200;
char G[maxn][maxn];
int m,n,ct;
//8个方向
int go[][2]={0,-1,
0,1,
1,0,
-1,0,
1,1,
1,-1,
-1,1,
-1,-1};
bool inside(int x,int y){
return x>=1 && x<=m && y>=1 && y<=n;
}
void DFS(int x,int y){
for(int i=0;i<8;i++){
int xx=x+go[i][0];
int yy=y+go[i][1];
if(inside(xx,yy) && G[xx][yy]=='@'){
G[xx][yy]='*';
DFS(xx,yy);
}
}
}
int main(){
while(cin>>m>>n && (m&&n)){
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
cin>>G[i][j];
}
}
ct=0; //连通分量个数
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(G[i][j]=='@'){
DFS(i,j);
ct++;
}
}
}
cout<<ct<<endl;
}
}