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

         http://acm.hdu.edu.cn/showproblem.php?pid=1241

              Oil Deposits

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

    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
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int dir[8][2]={1,1, 1,-1, -1,1, -1,-1, 0,1, 0,-1, 1,0, -1,0};
    int n,m;
    char map[100][100];
    void dfs(int x,int y)
    {
               int i;
            for(i=0;i<8;i++)
          {
            int xx=x+dir[i][0];
            int yy=y+dir[i][1];
            if(map[xx][yy]=='@'&&xx<n&&xx>=0&&yy<m&&yy>=0)
            {
                map[xx][yy]='*';
                 dfs(xx,yy);
            }
         }
    }
    int main()
    {
        int i,j;
        while(~scanf("%d%d",&n,&m))
        {
            int cout=0;
           if(n==0||m==0)
                  break;
               getchar();
            for(i=0;i<n;i++)
              {
               scanf("%s",&map[i]);
    
              }
             for(i=0;i<n;i++)
              {
               for(j=0;j<m;j++)
                     {
                         if(map[i][j]=='@')
                           {
                                map[i][j]='*';
                                  dfs(i,j);
                                cout++;
                           }
                     }
           }
    
    
          printf("%d
    ",cout);
        }
      return 0;
    }
     
  • 相关阅读:
    17 Letter Combinations of a Phone Number(medium)
    16 3Sum closest(medium)
    15 3Sum(medium)
    linux环境下搭建自动化Jenkins管理工具
    Danjgo学习笔记(五)----Django数据库的查询
    Danjgo学习笔记(五)----Django中表的关系
    Django常见的Field
    selenium+python+ip池 实现博客园刷博客浏览量
    Danjgo学习笔记(五)----常见模板过滤器和自制过滤器
    Danjgo学习笔记(四)---danjgo框架内的常用标签
  • 原文地址:https://www.cnblogs.com/cancangood/p/4388497.html
Copyright © 2011-2022 走看看