• DFS:POJ1562-Oil Deposits(求连通块个数)


    Oil Deposits

    Time Limit: 1000MS
    Memory Limit: 10000K

    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

    这里写图片描述

    Sample Output

    0
    1
    2
    2


    解题心得:

    1. 很简单一边找一边标记就可以了。

    #include<stdio.h>
    #include<cstring>
    using namespace std;
    const int maxn = 110;
    char maps[maxn][maxn];
    bool vis[maxn][maxn];
    int dir[8][2] = {1,0,-1,0,0,1,0,-1,1,-1,-1,1,-1,-1,1,1};
    int n,m,ans;
    
    void pre_maps()
    {
        for(int i=1;i<=n;i++)
            scanf("%s",maps[i]+1);
    }
    
    bool check(int x,int y)
    {
        if(x<1 || y<1 || x>n || y>m)
            return false;
        return true;
    }
    
    void dfs(int x,int y)
    {
        vis[x][y] = true;
        for(int i=0;i<8;i++)
        {
            int x1 = x+dir[i][0];
            int y1 = y+dir[i][1];
            if(check(x1,y1) && maps[x1][y1] == '@' && !vis[x1][y1])
               dfs(x1,y1);
        }
    }
    
    void DFS()
    {
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
            {
                if(maps[i][j] == '@' && !vis[i][j])
                {
                    ans++;
                    dfs(i,j);
                }
            }
    }
    
    int main()
    {
        while(scanf("%d%d",&n,&m) && n+m)
        {
            memset(vis,0,sizeof(vis));
            ans = 0;
            pre_maps();
            DFS();
            printf("%d
    ",ans);
        }
    }
    
  • 相关阅读:
    checkbox 全选与全消
    sql server 关联和一些函数
    checkbox 判断是否选择
    sql 总结
    前台写逻辑
    android应用开发——popupWindow非全屏显示
    整理PostgreSQL数据库占用磁盘空间
    PHP常用的几个函数
    MySQL,PostgreSQL系统表(确认配置是否生效)
    Linux,查看目录大小
  • 原文地址:https://www.cnblogs.com/GoldenFingers/p/9107267.html
Copyright © 2020-2023  润新知