Oil Deposits
问题描述
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
思路
没啥说滴,这题比较简单,既可以bfs,又可以dfs。它俩在这都退化了,没体现出各自的优势。好久没dfs了,我这就提供dfs的方法吧。
代码样例
//L-Oil Deposits
#include<stdio.h>
using namespace std;
char map[110][110];
int n, m;
void dfs(int r, int c){
map[r][c]='*';
//上
if(r>0&&map[r-1][c]=='@'){
dfs(r-1, c);
}
//下
if(r<n&&map[r+1][c]=='@'){
dfs(r+1, c);
}
//左
if(c>0&&map[r][c-1]=='@'){
dfs(r, c-1);
}
//右
if(c<m&&map[r][c+1]=='@'){
dfs(r, c+1);
}
//左上
if(r>0&&c>0&&map[r-1][c-1]=='@'){
dfs(r-1, c-1);
}
//右上
if(r>0&&c<m&&map[r-1][c+1]=='@'){
dfs(r-1, c+1);
}
//左下
if(r<n&&c>0&&map[r+1][c-1]=='@'){
dfs(r+1, c-1);
}
//右下
if(r<n&&c<m&&map[r+1][c+1]=='@'){
dfs(r+1, c+1);
}
}
int main(void){
while(scanf("%d %d", &n, &m), n!=0){
for(int i=0; i<n; i++){
scanf("%s", map[i]);
}
int counter=0;
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
if(map[i][j]=='@'){
dfs(i, j);
counter++;
}
}
}
printf("%d\n", counter);
}
return 0;
}
- 1605集训计划第十二天任务
- 按时完成