DFS——The Mine

最新推荐文章于 2022-04-04 21:25:38 发布

CODE_BALL

最新推荐文章于 2022-04-04 21:25:38 发布

阅读量675

点赞数

分类专栏： BFS && DFS

本文链接：https://blog.csdn.net/codeball/article/details/22754771

版权

BFS && DFS 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

The Mine

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 \le m \le 100$ and $1 \le n \le 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

简单的DFS搜索，在搜索的过程中，注意修改遍历过的值以避免重复遍历

#include <stdio.h>

char dui[100][100];
char mapp[100][100];
int n,m;
int fx[] = {-1,-1,-1,0,0,1,1,1};
int fy[] = {-1,0,1,-1,1,-1,0,1};
int dfs(int i,int j)
{
    int x;
    if(i >= 0 && i < m && j >= 0 && j < n)
    {
        if(mapp[i][j] == '@')
        {
            mapp[i][j] = '*';
            for(x = 0;x < 8;x++)
            {
                dfs(i + fx[x],j + fy[x]);
            }
        }
    }
    return 0;
}
int main()
{
    int i,j,k;
    while(scanf("%d%*c%d%*c",&m,&n),m)
    {
        k = 0;
        for(i = 0; i<m; i++)
        {
            scanf("%s",&mapp[i]);
        }
        for(i = 0; i<m; i++)
        {
            for(j = 0; j<n; j++)
            {
                if(mapp[i][j] == '@')
                    {
                        k++;
                        dfs(i,j);
                    }
            }
        }
        printf("%d\n",k);
    }
    return 0;
}

Miguel A. Revilla
1998-03-10