HDU1241——Oil Deposits (DFS)

7 篇文章 0 订阅
6 篇文章 0 订阅

题目:

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvCompworkswithonelargerectangularregionoflandatatime,andcreatesagridthatdivides 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 containsone 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<iostream>
#include<cstdio>
#include<cstring>
#include<queue>

using namespace std;

char oil[110][110];
int n, m,ans;

void dfs(int i, int j)
{
    if(oil[i][j]!='@' || i<0 || j<0 || i>=m || j>=n)///不是@,或者越界
        return;
    else
    {
        oil[i][j] = '*';///把@换成*,好比标记成已读的痕迹
        dfs(i-1, j-1);///各个方向
        dfs(i-1, j);
        dfs(i-1, j+1);
        dfs(i, j-1);
        dfs(i, j+1);
        dfs(i+1, j-1);
        dfs(i+1, j);
        dfs(i+1, j+1);
    }
}

int main()
{
    int i, j;
    while(cin>>m>>n)  ///m是行数,n是列数
    {
        if(m==0||n==0)
            break;
        ans = 0;
        for(i = 0; i < m; i++)
            for(j=0;j<n;j++)
                cin>>oil[i][j];///输入地图,一行一行输入,注意m,n控制的循环次数
        
        for(i = 0; i < m; i++)
        {
            for(j = 0; j < n; j++)
            {
                if(oil[i][j] == '@')///一个一个找,如果找着@,则顺着找油田
                {
                    dfs(i, j);///看是否和旁边的连在一起
                    ans++; ///判断完一次+1
                }
            }
        }
            cout<<ans<<endl;
    }

    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值