zoukankan      html  css  js  c++  java
  • (深搜)Oil Deposits -- hdu -- 1241

    链接:

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

     

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


    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>
    #include <cstdlib>
    #include <cmath>
    #include <algorithm>
    #include <queue>
    
    using namespace std;
    
    #define N 110
    
    char Map[N][N];
    int n, m, dir[8][2]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
    
    void DFS(int x, int y)
    {
        if(Map[x][y]=='*')
            return ;
        if(x<0 || x>=n || y<0 || y>=m)
            return ;
    
        Map[x][y] = '*';
    
        for(int i=0; i<8; i++)
            DFS(x+dir[i][0], y+dir[i][1]);
    }
    
    int main()
    {
    
        while(scanf("%d%d", &n, &m), n+m)
        {
            int i, j, sum=0;
    
            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]=='@')
                {
                    DFS(i, j);
                    sum ++;
                }
            }
            printf("%d
    ", sum);
        }
        return 0;
    }
    勿忘初心
  • 相关阅读:
    关于API微服务网关
    适用于企业的API管理平台
    简单的api测试
    Json,2020年api数据格式的Top 1
    API文档之团队协作
    如何进行API测试以提高程序质量
    API接口也要监控?
    春招实习_腾讯 wxg 一面 3.27 15:00
    春招实习_腾讯一面 & 二面_3.13
    春招实习_阿里一面
  • 原文地址:https://www.cnblogs.com/YY56/p/4779063.html
Copyright © 2011-2022 走看看