zoukankan      html  css  js  c++  java
  • Oil Deposits (dfs)

    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. 

    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 

    Sample Output

    0
    1
    2
    2
    标准的DFS题目,求连通块的个数。
    代码如下:
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 using namespace std;
     5 char s[550][550];
     6 int M, N;
     7 
     8 void dfs(int x, int y){
     9     s[x][y] = '*';
    10     for(int dx = -1; dx <= 1; dx++){
    11         for(int dy = -1; dy <= 1; dy++){
    12             int nx = x + dx,ny = y + dy;
    13             if(0 <= nx && nx < N && 0 <= ny && ny < M && s[nx][ny] == '@')dfs(nx,ny);
    14         }
    15     }
    16     return;
    17 }
    18 void solve(){
    19     for(int i = 0; i < N; i++)
    20         cin >> s[i];
    21     int ans = 0;
    22     for(int i = 0; i < N; i++){
    23         for(int j = 0; j < M; j++){
    24             if(s[i][j] == '@'){
    25                 dfs(i,j);
    26                 ans++;
    27             }
    28         }
    29     }
    30     cout << ans << endl;
    31 }
    32 int main(){
    33     while(~scanf("%d%d",&N,&M)){
    34         if(N == 0 && M == 0)break;
    35         solve();
    36     }
    37 }
  • 相关阅读:
    ZOJ4134 Unrooted Trie(dfs序+线段树)
    ZOJ4127 Grid with Arrows(欧拉路径的判断)
    CF1037E Trips(思维)
    django学习第十四天--Forms和ModelForm
    django学习第十三天--自定义中间件
    图书管理系统---基于ajax删除数据
    django学习第十二天--ajax请求和csrftoken认证的三种方式
    django中修改QueryDict数据类型和转成普通字典
    图书管理系统进阶---多表操作
    locals()用法
  • 原文地址:https://www.cnblogs.com/xingkongyihao/p/6685839.html
Copyright © 2011-2022 走看看