HDU-1241 Oil Deposits

原创 2018年04月15日 15:47:04
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<cstdlib>
#include<cstring>
using namespace std;
int n,m;
int answer;
char a[105][105];
bool judge(int x,int y)
{
    if(x>=1&&y>=1&&x<=n&&y<=m)
        return 1;
    else
        return 0;
}
void dfs(int x,int y)
{
    if(judge(x,y)&&a[x][y]=='@')
    {
    a[x][y]='*';
    dfs(x-1,y-1);dfs(x-1,y);dfs(x-1,y+1);
    dfs(x,y-1);             dfs(x,y+1);
    dfs(x+1,y-1);dfs(x+1,y);dfs(x+1,y+1);
    }
    else
        return;
}
int main()
{
    while(cin>>n>>m)
    {
        if(m==0&&n==0)
            return 0;
        answer=0;
        memset(a,0,sizeof(a));
        for(int i=0;i<=103;i++)          //将边界初始化为*  不知道为什么 去掉就运行不出来!!
        {
            for(int j=0;j<=103;j++)
            {
                a[i][j]='*';
            }
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                cin>>a[i][j];
            }
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(a[i][j]=='@'&&judge(i,j))
                {
                    answer++;
                    dfs(i,j);
                }
                else
                    continue;
            }
        }
        cout<<answer<<endl;
    }
    return 0;
}


Oil Deposits(基础dfs)

Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) T...
  • tree__water
  • tree__water
  • 2016-02-28 09:46:59
  • 537

[ACM - 深度优先搜索]Oil Deposits

Problem Description   The GeoSurvComp geologic survey company is responsible for detecting undergrou...
  • sr19930829
  • sr19930829
  • 2013-11-27 09:22:55
  • 2193

POJ 1562:Oil Deposits

Oil Deposits Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 14462   ...
  • u010885899
  • u010885899
  • 2015-07-31 16:06:07
  • 448

Oil Deposits (深搜(水))

题目来源:https://vjudge.net/contest/159739#problem/L 【题意】 题意里叙述了这么一种关系,@的上下左右斜只要是@,那么这两个就可以视为同一种,问共有多少...
  • duan_1998
  • duan_1998
  • 2017-05-02 21:47:40
  • 169

hdu1241 Oil Deposits (bfs水题)

Problem Description The GeoSurvComp geologic survey company is responsible for detecting undergroun...
  • zxy160
  • zxy160
  • 2017-05-27 20:17:12
  • 280

ACM-DFS之Oil Deposits——hdu1241

Oil Deposits Problem Description The GeoSurvComp geologic survey company is responsible for detecti...
  • lx417147512
  • lx417147512
  • 2014-02-25 12:47:46
  • 1940

Oil Deposits HDU杭电1241

Problem Description The GeoSurvComp geologic survey company is responsible for detecting undergroun...
  • yuzhiwei1995
  • yuzhiwei1995
  • 2015-08-03 19:52:32
  • 429

hdu1241 Oil Deposits(dfs&&bfs)

这又是一个练习bfs和dfs的非常好的题目,找油井的个数,8个方向只要有,就算同一个,问有多少个下面是dfs的,没什么可说的#include #include using namespace st...
  • zcmartin2014214283
  • zcmartin2014214283
  • 2016-09-23 10:12:50
  • 523

ACM--DFS--poj 1562--Oil Deposits

poj地址:http://poj.org/problem?id=1562                                                         Oil ...
  • qq_26891045
  • qq_26891045
  • 2016-05-05 18:29:21
  • 1060

UVa 572 - Oil Deposits 搜索专题

572 - Oil Deposits 11158 58.77% 5511 95.30% 题目链接: http://uva...
  • shuangde800
  • shuangde800
  • 2012-07-06 00:52:11
  • 4610
收藏助手
不良信息举报
您举报文章:HDU-1241 Oil Deposits
举报原因:
原因补充:

(最多只允许输入30个字)