zoukankan      html  css  js  c++  java
  • 油田

    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.

    InputThe 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.
    OutputFor 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 

    #include <iostream> 
    #include<cstdio> 
    #include<cstring> 
    using namespace std;
    char a[110][110];
    int m,n,cnt;
    void dfs(int i,int j)
    {
        if(a[i][j]!='@'||i<0||j<0||i>=n||j>=m)
           return;
        else
        {
            a[i][j]='!';
            dfs(i-1,j-1);
            dfs(i-1,j);
            dfs(i-1,j+1);
            dfs(i,j-1);
            dfs(i,j+1);
            dfs(i+1,j-1);
            dfs(i+1,j);
            dfs(i+1,j+1);
        }
    }
    int main()
    {
        int i,j;
        while(cin>>n>>m){
            if(n==0&&m==0)break;
            cnt=0;
            for(i=0;i<n;i++)
               for(j=0;j<m;j++)
                  cin>>a[i][j];
            for(i=0;i<n;i++)
               for(j=0;j<m;j++){
                   if(a[i][j]=='@')
                   {
                       dfs(i,j);
                       cnt++;
                }
               }
            cout<<cnt<<endl;
        }
        return 0;
    }
  • 相关阅读:
    How to provide highlighting with Spring data elasticsearch
    Android——仿QQ聊天撒花特效
    Android 仿新版QQ的tab下面拖拽标记为已读的效果
    GitHub控件之BadgeView(数字提醒)
    Android之基于百度云推送IM
    Android消息推送完美解决方案全析
    android asmack 注册 登陆 聊天 多人聊天室 文件传输
    android:TextAppearance.Material.Widget.Button.Inverse问题
    Android 高仿微信实时聊天 基于百度云推送
    Gradle DSL method not found: 'android()
  • 原文地址:https://www.cnblogs.com/ylrwj/p/10746434.html
Copyright © 2011-2022 走看看