zoukankan      html  css  js  c++  java
  • HDU 1241 Oil Deposits(递归,搜索)

    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
    
    
    Source
    Mid-Central USA 1997
    

    简单的深搜题,递归,队列都能写

    #include<iostream>
    #include<algorithm>
    #include<cstdio>
    #include<cstring>
    #include<queue>
    using namespace std;
    char mapp[200][200];
    int n,m;
    void dfs(int a,int b)
    {
        if(mapp[a][b]=='*')
            return ;
        else
        {
            mapp[a][b]='*';
            if(a-1>=0)
                dfs(a-1,b);
            if(a+1<n)
                dfs(a+1,b);
            if(b-1>=0)
                dfs(a,b-1);
            if(b+1<m)
                dfs(a,b+1);
            if(a-1>=0&&b+1<m)
                dfs(a-1,b+1);
            if(a-1>=0&&b-1>=0)
                dfs(a-1,b-1);
            if(a+1<n&&b+1<m)
                dfs(a+1,b+1);
            if(a+1<n&&b-1>=0)
                dfs(a+1,b-1);
        }
    }
    int main()
    {
        while(~scanf("%d %d",&n,&m))
        {
            if(n==0&&m==0)
                break;
            for(int i=0;i<n;i++)
            {
                scanf("%s",mapp[i]);
            }
            int sum=0;
            for(int i=0;i<n;i++)
            {
                for(int j=0;j<m;j++)
                {
                    if(mapp[i][j]=='@')
                    {
                        sum++;
                        dfs(i,j);
                    }
                }
            }
            printf("%d
    ",sum);
        }
        return 0;
    }
    
  • 相关阅读:
    机器学习 -- 用户画像
    机器学习 -- 分类
    机器学习 -- 聚类
    机器学习 -- 回归
    数据分析 -- 流程
    Nginx + Tomcat7 + redis session一致性问题
    机器学习 -- 信息论
    机器学习 -- 统计与分布
    ElasticSearch 学习一: 基本命令
    问题17:如何将多个小字符串拼接成一个大的字符串
  • 原文地址:https://www.cnblogs.com/nanfenggu/p/7900007.html
Copyright © 2011-2022 走看看