HDU - 1241 Oil Deposits dfs

最新推荐文章于 2021-01-24 13:36:02 发布

cloudy_happy

最新推荐文章于 2021-01-24 13:36:02 发布

阅读量198

点赞数

分类专栏： dfs深搜

本文链接：https://blog.csdn.net/cloudy_happy/article/details/84587377

版权

dfs深搜专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Oil Deposits
HDU - 1241

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
思路：

对于每个 ‘@‘ 我们用dfs搜索把它和它周围的 ‘@’ 变成 ‘*’，这样我们接下来就不用管这片油田了，同时这表示有一个油田

代码：

#include<bits/stdc++.h>
using namespace std;
#define N 105
#define mem(a) memset(a,0,sizeof(a))
int n,m,ans;
char form[N][N];
int dx[8] = {0,0,1,-1,-1,-1,1,1};
int dy[8] = {1,-1,0,0,-1,1,-1,1};
bool check(int x,int y)
{
    if (x >= 0 && x < n && y >= 0 && y < m)
        return 1;
    return 0;
}
void dfs(int x,int y)
{
    form[x][y] = '*';
    for (int i = 0;i < 8;i ++)
    {
        int ex = x + dx[i],ey = y + dy[i];
        if (check(ex,ey) && form[ex][ey] == '@')
            dfs(ex,ey);
    }
}
int main()
{
    while (~scanf("%d %d",&n,&m) && n)
    {
        ans = 0;
        for (int i = 0;i < n;i ++)
            scanf("%s",form[i]);
        for (int i = 0;i < n;i ++)
            for (int j = 0;j < m;j ++)
                if (form[i][j] == '@')
                {
                    dfs(i,j);
                    ans ++;
                }
        printf("%d\n",ans);
    }
    return 0;
}