zoukankan      html  css  js  c++  java
  • HDU 1241 Oil Deposits(bfs解法)

    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.

    InputThe 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.
    OutputFor 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 <cmath>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    
    using namespace std;
    
    #define ll long long
    
    int position[100+8][100+8], mov[8][2] = {0,1, 1,0, 0,-1, -1,0, 1,1, -1,-1, 1,-1, -1,1};
    int n, m, sum;
    
    struct coordinate
    {
        int x, y;
    };
    
    void bfs(int a, int b)
    {
        queue<coordinate>q;
        coordinate miao;
        miao.x = a;
        miao.y = b;
        q.push(miao);
        while(!q.empty())
        {
            coordinate fir = q.front();
            q.pop();
            coordinate next;
            for(int i = 0; i<8; i++)
            {
                next.x = fir.x+mov[i][0];
                next.y = fir.y+mov[i][1];
                if(next.x >= 0 && next.y >= 0 && next.x<n && next.y<m && position[next.x][next.y] == '@')
                {
                    position[next.x][next.y] = '*';
                    q.push(next);
                }
            }
        }
    }
    int main()
    {
        while(scanf("%d%d", &n, &m) && (n+m))
        {
            getchar();
            sum = 0;
            for(int i = 0; i<n; i++)
            {
                for(int j = 0; j<m; j++)
                    scanf("%c", &position[i][j]);
                getchar();
            }
            for(int i = 0; i<n; i++)
                for(int j = 0; j<m; j++)
                    if(position[i][j] == '@')
                    {
                        position[i][j] = '*';
                        bfs(i, j);
                        sum++;
                    }
            printf("%d
    ", sum);
        }
        return 0;
    }
  • 相关阅读:
    特征选取1-from sklearn.feature_selection import SelectKBest
    使用K-S检验一个数列是否服从正态分布、两个数列是否服从相同的分布
    风控8-收码平台
    风控7-同盾设备指纹
    互联网黑产剖析_虚假号码
    风控3_iv算法详细解释
    woe_iv原理和python代码建模
    逾期30天和60天的回款概率
    (剑指Offer)面试题15:链表中倒数第k个结点
    (剑指Offer)面试题14:调整数组顺序使奇数位于偶数前面
  • 原文地址:https://www.cnblogs.com/RootVount/p/10453197.html
Copyright © 2011-2022 走看看