DFS - Oil Deposits

最新推荐文章于 2022-01-18 23:43:13 发布

原创最新推荐文章于 2022-01-18 23:43:13 发布 · 137 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#DFS

DFS 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种用于探测地下油藏分布的算法实现。通过构建矩形区域网格，并使用传感设备确定每个单元格是否含有石油，进而分析这些单元格之间的连接情况来识别独立的油藏。文章提供了一个具体的算法实现，包括深度优先搜索方法来确定不同油藏的数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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.

InputThe 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.
OutputFor 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

代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int dx[8]= {0,0,1,-1,1,1,-1,-1};
int dy[8]= {1,-1,0,0,1,-1,1,-1};
char pic[105][105];
int a,b,vis[105][105];
void dfs(int r,int c,int num)
{
    if(r<0||r>=a||c<0||c>=b)return;
    if(vis[r][c]>0||pic[r][c]!='@')return;
    vis[r][c]=num;
    for(int u=0; u<8; u++)
        dfs(r+dx[u],c+dy[u],num);
}

int main()
{
    while(cin>>a>>b)
    {
        if(a==0||b==0)break;
        for(int i=0; i<a; i++)
            for(int j=0; j<b; j++)
                cin>>pic[i][j];
        memset(vis,0,sizeof(vis));
        int num=0;
        for(int i=0; i<a; i++)
            for(int j=0; j<b; j++)
                if(vis[i][j]==0&&pic[i][j]=='@')
                    dfs(i,j,++num);
        cout<<num<<endl;
    }
    return 0;
}