zoukankan      html  css  js  c++  java
  • HDU1241 Oil Deposits —— DFS求连通块

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1241


    Oil Deposits

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

    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
     
    Source



    题解:

    典型的dfs求连通块问题。



    代码如下:

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 #include <algorithm>
     6 #include <vector>
     7 #include <queue>
     8 #include <stack>
     9 #include <map>
    10 #include <string>
    11 #include <set>
    12 #define ms(a,b) memset((a),(b),sizeof((a)))
    13 using namespace std;
    14 typedef long long LL;
    15 const int INF = 2e9;
    16 const LL LNF = 9e18;
    17 const int MOD = 1e9+7;
    18 const int MAXN = 100+10;
    19 
    20 char M[MAXN][MAXN];
    21 int vis[MAXN][MAXN];
    22 int n, m, dir[8][2] = {0,1,1,0,0,-1,-1,0, 1,1,-1,1,1,-1,-1,-1};
    23 
    24 void dfs(int x, int y)
    25 {
    26     vis[x][y] = 1;
    27     for(int i = 0; i<8; i++)
    28     {
    29         int xx = x + dir[i][0];
    30         int yy = y + dir[i][1];
    31         if( xx>=1 && xx<=n && yy>=1 && yy<=m && M[xx][yy]=='@' && !vis[xx][yy])
    32             dfs(xx,yy);
    33     }
    34 }
    35 
    36 int main()
    37 {
    38     while(scanf("%d%d",&n,&m) && m )
    39     {
    40         for(int i = 1; i<=n; i++)
    41             scanf("%s", M[i]+1);
    42 
    43         int ans = 0;
    44         ms(vis, 0);
    45         for(int i = 1; i<=n; i++)
    46         for(int j = 1; j<=m; j++)
    47         {
    48             if(M[i][j]=='@' && !vis[i][j])
    49             {
    50                 ans++;
    51                 dfs(i,j);
    52             }
    53         }
    54         printf("%d
    ", ans);
    55     }
    56 
    57 }
    View Code


  • 相关阅读:
    河工大玲珑校赛重现の 饶学妹的比赛
    河工大玲珑杯校赛随笔
    河南省第四届ACM省赛(T1) 序号互换
    河南省第四届ACM省赛(T3) 表达式求值
    debian系统下安装ssh
    戴尔poweredge r730服务器配置以及系统安装
    win10环境下安装Ubantu双系统(超详解)
    debian服务器解决中文安装后出现乱码的问题
    debian系统下安装ssh
    如何在ubuntu上搭建hustoj?
  • 原文地址:https://www.cnblogs.com/DOLFAMINGO/p/7538595.html
Copyright © 2011-2022 走看看