zoukankan      html  css  js  c++  java
  • 杭电1241--Oil Deposits(Dfs)

    Oil Deposits

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


    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
     

     

    Recommend
    Eddy   |   We have carefully selected several similar problems for you:  1016 1010 1312 1242 1240 
    //标记 → →
     1 #include <cstring>
     2 #include <iostream>
     3 using namespace std;
     4 #define N 110;
     5 int m, n, i, j;
     6 
     7 int ac[8][2]={{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1},{-1,0},{-1,1}};
     8 int vis[110][110];
     9 char map[110][110];
    10 int sum = 0;
    11 
    12 void DFS(int x, int y)
    13 {
    14     int nx, ny;
    15     vis[x][y] = 1;
    16     for(int i=0; i<8; i++)
    17     {
    18         nx = x + ac[i][0];
    19         ny = y + ac[i][1];
    20         if(map[nx][ny]=='@'&&nx>=0&&nx<m&&ny>=0&&ny<n&&vis[nx][ny]==0)
    21         {
    22             DFS(nx, ny); 
    23         } 
    24     }
    25 }
    26 
    27 
    28 int main()
    29 {
    30     while(~scanf("%d %d", &m, &n), m)
    31     {
    32         for(i=0 ; i<m; i++)
    33             for(j=0; j<n; j++)
    34                 cin >> map[i][j];
    35         memset(vis, 0, sizeof(vis));
    36         sum = 0;
    37         for(i=0; i<m; i++)
    38         {
    39             for(j=0; j<n; j++)
    40             if(map[i][j] == '@' && !vis[i][j])
    41             {
    42                 DFS(i, j);
    43                 sum++;
    44             }
    45         }
    46         cout << sum <<endl;
    47     
    48     }
    49     return 0;
    50 }
  • 相关阅读:
    docker命令大全
    centos mysql 实战 第二十六节课 mysql in docker
    赋予楼宇“智慧大脑”:厦门双子塔3D可视化
    智慧矿山-选矿工艺数字 3D 可视化
    数字孪生赋能工业发展:可视化“智”造航天新里程
    浅谈可视化设计-数据时代的美味“烹饪师”(下篇)
    工业互联网背景下的高炉炉体三维热力图监控系统
    浅谈可视化设计-数据时代的美味“烹饪师”(上篇)
    加速城市轨道交通发展,数字化运营新基建搭建地铁管理系统
    加油站三维可视化监控系统,安全管理智慧运营
  • 原文地址:https://www.cnblogs.com/soTired/p/4689690.html
Copyright © 2011-2022 走看看