zoukankan      html  css  js  c++  java
  • Oil Deposits

    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
    代码:
     1 #include<cstdio>
     2 #include<cmath>
     3 #include<cstring>
     4 #include<algorithm>
     5 using namespace std;
     6                           //i和j刚开始定义在了这个地方,运行结果错了好久..
     7 int fx[8]={0,0,-1,-1,-1,1,1,1};
     8 int fy[8]={-1,1,0,1,-1,0,1,-1};
     9 char a[105][105];
    10 int n,m,v[105][105];
    11 void dfs(int x,int y)
    12 {v[x][y]=1;
    13  for(int i=0;i<8;i++)   //以后再for里面定义i
    14     {int xx,yy;
    15      xx=x+fx[i];
    16      yy=y+fy[i];
    17      if(xx>=0&&yy>=0&&xx<n&&yy<m&&!v[xx][yy]&&a[xx][yy]== '@')
    18        dfs(xx,yy);    
    19     } 
    20     
    21     
    22 }
    23 
    24 int main()
    25 {
    26     
    27     
    28     while(scanf("%d %d",&n,&m)!=EOF&&n||m)
    29     {memset(v,0,sizeof(v)); 
    30      for(int i=0;i<n;i++)
    31        scanf("%s",a[i]);
    32      int ans=0; 
    33      for(int i=0;i<n;i++)
    34        for(int j=0;j<m;j++)
    35          {if(!v[i][j]&&a[i][j]== '@')
    36            {ans++;
    37                dfs(i,j);
    38            }
    39              
    40          }  
    41      printf("%d
    ",ans);     
    42         
    43     }
    44     return 0;
    45 }
  • 相关阅读:
    【小工具大用处】10个超实用的设计师专属Chrome小插件
    作为自由网页开发者如何建立自己的个人品牌【2019最详细教程】
    你的作品集够好了吗?20份精选UI设计作品集给你灵感
    【编程指南】新手上路不必忧,全球十大顶尖网站免费用!
    配色指南|你知道如何正确使用红色与绿色吗?
    摹客专访 | “猫系”设计师——开到茶花
    25个故事性网页设计,轻松讲述网页独有的故事~
    Mockplus四周年大回馈来啦!
    layer 弹出层
    SVN 安装vs插件
  • 原文地址:https://www.cnblogs.com/hss-521/p/7263051.html
Copyright © 2011-2022 走看看