zoukankan      html  css  js  c++  java
  • HDU 1241【DFS/BFS求连通块数目】

    Oil Deposits

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


    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

    题解:简单搜索题,八个方向都走一遍就行了。

    代码1: DFS实现

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    #include <vector>
    #include <set>
    #include <map>
    #include <queue>
    using namespace std;
    const int maxn=105;
    int m,n;
    int vis[maxn][maxn];
    char s[maxn][maxn];
    int cnt=0;
    int dir[8][2]={{0,1},{1,-1},{-1,-1},{-1,0},{0,-1},{-1,1},{1,0},{1,1}};
    void dfs(int x,int y){
        for(int i=0;i<8;i++){
            int tx=x+dir[i][0];
            int ty=y+dir[i][1];
            if(tx<0||tx>=n||ty<0||ty>=m)
                continue;
            if(!vis[tx][ty]&&s[tx][ty]=='@'){
                vis[tx][ty]=1;
                dfs(tx,ty);
            }
        }
        return ;
    }
    int main()
    {
        while(scanf("%d %d",&n,&m)&&(n+m)){
            cnt=0;
            memset(vis,0,sizeof vis);
            for(int i=0;i<n;i++){
                scanf("%s",s[i]);
            }
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(s[i][j]=='@'&&!vis[i][j]){
                        cnt++;
                        vis[i][j]=1;
                        dfs(i,j);
                    }
                }
            }
            printf("%d
    ",cnt);
        }
        return 0;
    }
    

    代码二:BFS实现。

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    #include <vector>
    #include <set>
    #include <map>
    #include <queue>
    using namespace std;
    const int maxn=105;
    int m,n;
    int vis[maxn][maxn];
    char s[maxn][maxn];
    int cnt=0;
    int dir[8][2]={{0,1},{1,-1},{-1,-1},{-1,0},{0,-1},{-1,1},{1,0},{1,1}};
    typedef struct Node{
        int x,y;
    }node;
    void bfs(int x,int y){
        node p,t;
        queue<node> q;
        p.x=x;
        p.y=y;
        q.push(p);
        while(!q.empty()){
            p=q.front();
            q.pop();
            for(int i=0;i<8;i++){
                t.x=p.x+dir[i][0];
                t.y=p.y+dir[i][1];
                if(t.x<0||t.x>=n||t.x<0||t.y>=m){
                    continue;
                }
                if(!vis[t.x][t.y]&&s[t.x][t.y]=='@'){
                    vis[t.x][t.y]=1;
                    q.push(t);
                }
            }
        }
    }
    int main()
    {
        while(scanf("%d %d",&n,&m)&&(n+m)){
            memset(vis,0,sizeof vis);
            cnt=0;
            for(int i=0;i<n;i++){
                scanf("%s",s[i]);
            }
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(!vis[i][j]&&s[i][j]=='@'){
                        vis[i][j]=1;
                        cnt++;
                        bfs(i,j);
                    }
                }
            }
            printf("%d
    ",cnt);
        }
        return 0;
    }
    




  • 相关阅读:
    20155217 实验四 Android程序设计
    20155217 第十二周课堂测试
    20155217 《Java程序设计》第三次实验报告
    20155217 2016-2017-2 《Java程序设计》第10周学习总结
    20155217 实验二 Java面向对象程序设计 实验报告
    20155217 2016-2017-2 《Java程序设计》第9周学习总结
    20155217 2016-2017-2 《Java程序设计》第8周学习总结
    实验一 Java开发环境的熟悉(Linux+Eclipse)
    Spring阶段性学习总结(一)实现一个简单的HellowWorld
    MySql数据库再学习——使用强化版的自定义连接池连接数据库
  • 原文地址:https://www.cnblogs.com/kzbin/p/9205234.html
Copyright © 2011-2022 走看看