zoukankan      html  css  js  c++  java
  • hdu 1241 Oil Deposits

    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

    注意是八个方向相邻,找连通分支

    代码:
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    
    
    using namespace std;
    int n,m,vis[100][100];
    char mp[100][100];
    int dir[8][2] = {0,1,1,0,0,-1,-1,0,1,1,1,-1,-1,1,-1,-1};///八个方向
    void dfs(int x,int y) {
        if(x < 0 || y < 0 || x >= n || y >= m || vis[x][y] || mp[x][y] != '@')return;
        vis[x][y] = 1;
        for(int i = 0;i < 8;i ++) {
            int tx = x + dir[i][0];
            int ty = y + dir[i][1];
            dfs(tx,ty);
        }
    }
    int main() {
        while(~scanf("%d%d",&n,&m) && (n + m)) {
            int c = 0;
            memset(vis,0,sizeof(vis));
            for(int i = 0;i < n;i ++)
            scanf("%s",mp[i]);
            for(int i = 0;i < n;i ++)
                for(int j = 0;j < m;j ++)
                    if(mp[i][j] == '@' && !vis[i][j]) {///dfs标记连通区域 计算连通区域个数
                        dfs(i,j);
                        c++;
                    }
            printf("%d
    ",c);
        }
    }
    
    
  • 相关阅读:
    基于朴素贝叶斯的内容推荐算法
    Android Message和obtainMessage的差别
    hevc 的相关文章的链接
    创建不被杀死的service
    TQ2440 学习笔记—— 2、Win7PC 与虚拟机Ubuntu互通 ping 的网络设置
    国防科大校赛I题: Prime Summation
    VC 中怎样改变窗体背景色
    小心使用IHttpHandler下的IsReusable属性
    hdu1702(ACboy needs your help again!) 在杭电又遇坑了
    deque C++实现
  • 原文地址:https://www.cnblogs.com/8023spz/p/7231984.html
Copyright © 2011-2022 走看看