zoukankan      html  css  js  c++  java
  • Oil Deposits (HDU

    转载请注明出处:https://blog.csdn.net/Mercury_Lc/article/details/82706189   作者:Mercury_Lc

    题目链接

    题解:每个点(为被修改,是#)进行一次dfs,每次dfs到的点,也就是八个方向都将  '#'  修改成  '*',下次dfs就不用再搜索这一点了,因为已经确定这个点和前面的点是一个部分,这样遍历一遍图,如果可以dfs(i,j),ans++,最后ans就是答案了。当然也可以用bfs思路来想(点一下我QWQ)。

    #include <bits/stdc++.h>
    
    using namespace std;
    
    const int maxn = 1e3;
    int n,m;
    char gra[maxn][maxn];
    int dx[] = {1,1,1,-1,-1,-1,0,0};
    int dy[] = {0,1,-1,1,0,-1,1,-1};
    void dfs(int i, int j)
    {
        gra[i][j] = '*';
        for(int k = 0; k < 8; k ++)
        {
            int tx = dx[k] + i;
            int ty = dy[k] + j;
            if(tx >= 0 && tx < n && ty >= 0 && ty < m && gra[tx][ty] == '@')
            {
                dfs(tx,ty);
            }
        }
    }
    int main()
    {
        int ans = 0;
        while(~scanf("%d %d",&n,&m)&&n&&m)
        {
            ans = 0;
            for(int i = 0; i < n; i ++)
            {
                getchar();
                scanf("%s",gra[i]);
            }
            for(int i =0; i < n; i ++)
            {
                for(int j = 0; j < m; j ++)
                {
                    if(gra[i][j] == '@')
                    {
                        dfs(i,j);
                        ans ++;
                    }
                }
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
    

    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
  • 相关阅读:
    在非控制台程序中打印出printf
    如何将动态链接库(C++ DLL)中的printf显示在其被调用的程序控制台上
    Android NDK Build 参数
    查找包含××××××字符的文件名
    Ubuntu安装Fcitx(小企鹅五笔输入法)
    查询所有表的记录数SQLServer
    查询某个表或者所有表的字段说明 SQLServer
    安卓64位Ubuntu的32位包安装
    gen already exists but is not a source folder ZT
    mysql中查看datadir目录
  • 原文地址:https://www.cnblogs.com/lcchy/p/10139520.html
Copyright © 2011-2022 走看看