zoukankan      html  css  js  c++  java
  • Oil Deposits

    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
     

    #include<cstdio>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    char a[100][100];
    int m=0,n=0;
    void ad(int x,int y)
    {
        a[x][y]='*';
        for(int i=-1; i<2; i++)
            for(int j=-1; j<2; j++)
                if(a[x+i][y+j]=='@'&&x+i>=0&&x+i<n&&y+j>=0&&y+j<m)
                    ad(x+i,y+j);
    }
    
    int main()
    {
        
        while(scanf("%d%d",&n,&m)!=-1)
        {int ans=0;
            if(m==0&&n==0) break;
            getchar();
            for(int i=0; i<n; i++)
            {
                scanf("%s",&a[i]);
            }
            for(int i=0; i<n; i++)
                for(int j=0; j<m; j++)
                    if(a[i][j]=='@')
                    {
                        ad(i,j);
                        ans++;
                    }
            printf("%d
    ",ans);
        }
    
        return 0;
    }

  • 相关阅读:
    GB/T 38879-2020 颗粒 粒度分析 彩色图像分析法
    GB/T 30431-2020 实验室气相色谱仪
    GB/T 50165-2020 古建筑木结构维护与加固技术标准
    GB/T 51405-2019 船厂总体设计标准
    GB/T 38922-2020 35kV及以下标准化继电保护装置通用技术要求
    GB/T 38953-2020 微电网继电保护技术规定
    GB/T 38886-2020 高温轴承钢等最新国家标准(2020-6-19)
    pytest_02(使用pychar执行pytest)
    pytest-01(安装pytest及运行规则)
    python-05(关于map函数的使用)
  • 原文地址:https://www.cnblogs.com/chinashenkai/p/9451419.html
Copyright © 2011-2022 走看看