Oil Deposits

CHEN_XU_LING

于 2020-09-29 21:41:14 发布

阅读量132

点赞数

分类专栏：简单搜索文章标签： dfs

本文链接：https://blog.csdn.net/CHEN_XU_LING/article/details/108876154

版权

简单搜索专栏收录该内容

6 篇文章 0 订阅

订阅专栏

该博客介绍了一个地质勘探公司用于检测地下油藏的算法。输入为一个矩形网格，用'*'表示无油区，'@'表示油藏。如果两个'@'相邻（水平、垂直或对角线），则它们属于同一油藏。任务是计算网格中不同的油藏数量。提供的C++代码实现通过深度优先搜索遍历并标记油藏，有效地避免了重复计数。

摘要由CSDN通过智能技术生成

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

题目的意思很简单,就是要你判断有几个油田,’@‘就是油田,’*'就是空地,只要@的上下左右加斜角八个方向有@就算是同一个油田,要你计算有几个油田,
思路:
把检测到的@的八个方向的@都标记为空地,油田数加一,这样就不会把油田数弄重复.

#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
using namespace std;
int a[8][2]= {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};//八个方向
char yt[100][100];//记录油田信息
int m,n;//m行n列
void dfs(int x,int y)
{
    yt[x][y]='*';
    for(int i=0; i<8; i++)
    {
        int xx=x+a[i][0];
        int yy=y+a[i][1];
        if(xx>=0&&xx<m&&yy>=0&&yy<n&&yt[xx][yy]=='@')
            dfs(xx,yy);
    }

    return;

}
int main()
{

    while(cin>>m>>n)
    {
        getchar();//吸收回车符
        int ans=0;//每次输入都要把油田数归零
        if(m==0&&n==0)
            break;

        for(int i=0; i<m; i++)
            for(int j=0; j<n; j++)
                cin>>yt[i][j];
        for(int i=0; i<m; i++)
            for(int j=0; j<n; j++)
            {
                if(yt[i][j]=='@')
                {
                    dfs(i,j);
                    ans++;
                    
                }
            }
        cout<<ans<<endl;
    }
    return 0;
}