oil deposits——深搜

最新推荐文章于 2021-05-02 17:02:24 发布

原创最新推荐文章于 2021-05-02 17:02:24 发布 · 530 阅读

0 ·

CC 4.0 BY-SA版权

数据结构与算法专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一种用于探测地下油田分布的算法。通过深度优先搜索的方法，该算法能够有效地确定不同油田区块的数量。输入包括一系列地块网格，输出则是独立油田区块的总数。

Oil Deposits
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
大致题意：遇到‘@’便在八个方向搜索，同样是‘@’化为一堆，计算一共有几堆。
AC代码：（用深搜做的）

#include<stdio.h>
#include<math.h>
#include<string.h>
int book[105][105];//标记已经被搜索过的油田
char a[105][105];
int s,n,m;
int f[8][2]={{1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,-1},{1,-1},{-1,1}};//在八个方向进行搜索
int dfs(int x,int y)
{
    int i;
    for(i=0;i<8;i++)
    {
        int fx=x+f[i][0];
        int fy=y+f[i][1];
        if(a[fx][fy]=='@'&&fx>=0&&fx<n&&fy>=0&&fy<m&&book[fx][fy]==0)
        {
            a[fx][fy]='*';//将遍及过的油田转化为‘*’，以免再次被搜到，其实是和book一样的功能
            book[fx][fy]=1;
            dfs(fx,fy);//搜到的油田继续向它的八个方向搜索
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0)
        {
            return 0;
        }
        memset(book,0,sizeof(book));
        int i,j;
        for(i=0;i<n;i++)
        {
            scanf("%s",&a[i]);
        }
        s=0;
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            {
                if(a[i][j]=='@')
                {
                    book[i][j]=1;
                    dfs(i,j);
                    s++;
                }
            }
        }
        printf("%d\n",s);
    }
}