zoukankan      html  css  js  c++  java
  • Oil Deposits(dfs水)

    题目链接: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): 18650    Accepted Submission(s): 10750


    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
     
    Source
     
    题目很好理解 及用dfs求联通块
    代码:
     1 #include<cstdio>
     2 #include<cstring>
     3 using namespace std;
     4 #define N 105
     5 char mp[N][N];
     6 bool vis[N][N];
     7 int n, m;
     8 bool in(int i , int j )
     9 {
    10     if(i < n&&i>=0&&j<m&&j>=0) return true;
    11     else return false;
    12 }
    13 int go[8][2] = {{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
    14 void dfs(int i , int j)
    15 {
    16     if(in(i, j)&&mp[i][j]=='@'&&!vis[i][j]) 
    17     {
    18         vis[i][j] = 1;
    19         for(int t =0 ;t < 8 ; t++)
    20         {
    21             int x = i + go[t][0];
    22             int y = j + go[t][1];
    23             dfs(x,y);
    24         }
    25     }
    26 }
    27 int main()
    28 {
    29     while(~scanf("%d%d",&n,&m)&&(n!=0||m!=0))
    30     {
    31         getchar();
    32         for(int i = 0 ;i < n ;i++)
    33         {
    34             for(int j = 0 ; j < m ; j++){
    35                 scanf("%c",&mp[i][j]);
    36                 vis[i][j] = 0;
    37             }
    38             getchar();
    39         }
    40         int cnt = 0;
    41         for(int i = 0 ;i < n ; i++)
    42         {
    43             for(int j = 0 ;j < m ;j++)
    44             {
    45                 if(mp[i][j]=='@'&&!vis[i][j])
    46                 {
    47                     cnt++;
    48                     dfs(i,j);
    49                 }
    50             }
    51         }
    52         printf("%d
    ",cnt);
    53     }
    54     return 0;
    55 }
  • 相关阅读:
    0326系统按钮添加权限的工作(jsp权限写法)
    0321菜单数据
    ztree树的递归
    前端padding margin
    解决1像素边框问题
    水平垂直居中
    移动端css公共样式
    tap方法改良this指向
    移动端常见问题
    前端笔记(兼容)
  • 原文地址:https://www.cnblogs.com/shanyr/p/4739485.html
Copyright © 2011-2022 走看看