zoukankan      html  css  js  c++  java
  • poj1562 Oil Deposits 深搜模板题

    题目描述:

    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 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

    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
    


    题意:
    判断在一个图形中‘@’连通的有几块。

    题解:
    典型的dfs模板题,套用模板即可。并记得将搜索过的’@‘转换成’*‘


    代码:
    #include <iostream>
    #include <stdio.h>
    #include <string.h>
    
    using namespace std;
    char a[105][105];
    int n,m,i,j;
    
    void dfs(int x,int y)
    {
        a[x][y]='*';
        for(int dx=-1;dx<=1;dx++)    //以一个点为中心,判断他周围有无‘@’,一直搜索下去,直到没有相连通的‘@’
        for(int dy=-1;dy<=1;dy++){
            int nx=dx+x;
            int ny=dy+y;
            if(nx>=0&&nx<n&&ny>=0&&ny<m&&a[nx][ny]=='@') dfs(nx,ny);
        }
        return ;
    }
    
    void solve()
    {
        int ans=0;
        for(i=0;i<n;i++)
        for(j=0;j<m;j++){
            if(a[i][j]=='@')
            {
                dfs(i,j);
                ans++;            //每遇到一个‘@’,就将连通快总数加1,并通过dfs把相连通的‘@’都转化成‘*’
            }
        }
        printf("%d
    ",ans);
    }
    
    int main()
    {
        while(1){
            scanf("%d%d",&n,&m);
            if(n==0&&m==0) break;
            memset(a,0,sizeof(a));
            for(i=0;i<n;i++){
                scanf("%s",a[i]);     //输入的时候要注意,如果输入%c,记得加getchar();
            }
            solve();
        }
        return 0;
    }







  • 相关阅读:
    南邮PHP反序列化
    偏移脚本
    nginx配置不当导致的目录遍历下载漏洞-“百度杯”CTF比赛 2017 二月场
    初识smarty
    weblogic nmap扫描脚本
    巅峰极客CTF writeup[上]
    JS调用免费接口根据ip查询位置
    JS调用免费接口根据ip查询位置
    JS一维数组、多维数组和对象的混合使用
    JS一维数组、多维数组和对象的混合使用
  • 原文地址:https://www.cnblogs.com/y1040511302/p/9630032.html
Copyright © 2011-2022 走看看