zoukankan      html  css  js  c++  java
  • DHU-1241 Oil Deposits

    Oil Deposits

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 8515    Accepted Submission(s): 4980


    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
     

      思路:深搜dfs,不难,但是注意细节,积累经验。

    #include<stdio.h>
    char str[102][102];
    int d[8][2]={1,1, 1,-1, -1,1, -1,-1, 0,1, 0,-1, 1,0, -1,0};
    int m,n;
    void dfs(int x,int y)
    {
        str[x][y] = '*';
        int i,nx,ny;
        for(i = 0;i <= 7;i ++)
        {
            nx = x+d[i][0];
            ny = y+d[i][1];
            if(nx > -1 && nx < m && ny > -1 && ny < n && str[nx][ny] == '@')
                  dfs(nx,ny);
        }
        return ;
    }
    
    int main()
    {
        int t,k,cnt;
        while(~scanf("%d%d",&m,&n)&&m)
        {
            cnt = 0;
            for(t = 0;t < m;t ++)
                scanf("%s",str[t]);
            for(t = 0;t < m;t ++)
            {
                for(k = 0;k < n;k ++)
                {
                    if(str[t][k] == '@')
                    {
                        dfs(t,k);
                        cnt++;
                    }
                }
            }
            printf("%d
    ",cnt);
        }
        return 0;
    }
  • 相关阅读:
    自我学习而已——javascript——变量,作用域和内存问题
    自我学习而已——javascript——数据类型部分
    面向对象三大特性之封装
    面向对象三大特性之继承与多态
    初识面向对象
    python常用模块(re模块)
    递归函数与算法
    Python之匿名函数
    python之内置函数
    各种推导式
  • 原文地址:https://www.cnblogs.com/anhuizhiye/p/3337684.html
Copyright © 2011-2022 走看看