HDU(1241)

原创 2015年07月10日 21:21:16
Oil Deposits

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

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

//初识dfs实在困难,只好猛刷题了。。。

//这题的主要思路找到一个油地只好边从油地的位置开始搜索上下左右斜对角搜索,如果发现油地标记为1

#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
int n,m;
int vis[110][110];
char c[110][110];

void dfs(int x,int y)
{
    if(vis[x][y])return;  //已标记过
    if(x>=n||y>=m||x<0||y<0) return;  //边界条件
    if(c[x][y]=='@')  //傻傻的只知道写多个,不知道用循环。。。
    {
        vis[x][y]=1;  //找到邻近的油地
        dfs(x+1,y);
        dfs(x-1,y);
        dfs(x,y+1);
        dfs(x,y-1);
        dfs(x-1,y-1);
        dfs(x+1,y+1);
        dfs(x-1,y+1);
        dfs(x+1,y-1);
    }

}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0)
            return 0;
        int cnt=0;
        for(int i=0;i<110;i++)
            for(int k=0;k<110;k++)
            {
                vis[i][k]=0;
                c[i][k]=0;
            }
        getchar();  // 有坑 多了一个空格
        for(int i=0;i<n;i++)
        {
            for(int k=0;k<m;k++)
            {
                cin >> c[i][k];
            }
        }
        for(int i=0;i<n;i++)
        {
            for(int k=0;k<m;k++)
            {
                if(c[i][k]=='@'&&!vis[i][k])  //未被标记过的
                {

                    cnt++;
                    dfs(i,k);
                }
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}


hdu1241 Oil Deposits(dfs&&bfs)

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

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
  • 1845

杭电1241 HDU acm --Oil Deposits---DFS深度优先算法实现详解

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1241 又是经典搜索题!还是那句话,数据量小,要求简单,果断DFS! 这道题目跟以前的题目稍...
  • zhuihunmiling
  • zhuihunmiling
  • 2013年05月27日 14:15
  • 2242

hdu-1241

http://acm.hdu.edu.cn/showproblem.php?pid=1241 水题 #include "stdio.h" #include "string.h" #include ...
  • u014427196
  • u014427196
  • 2014年11月26日 22:30
  • 445

hdu1241(Oil Deposits)

点击打开hdu1241 Problem Description The GeoSurvComp geologic survey company is responsible for detectin...
  • u011479875
  • u011479875
  • 2015年08月02日 21:01
  • 913

HDU 1241 Oil Deposits (基础DFS 或者 BFS)

Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tot...
  • liangzhaoyang1
  • liangzhaoyang1
  • 2016年06月04日 10:06
  • 736

【DFS】HDU1241Oil Deposits

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1241 Problem Description The GeoSurvComp geol...
  • wlxsq
  • wlxsq
  • 2016年04月13日 17:40
  • 201

HDU1241 DFS/BFS 求连通块

0)         遍历所有点,求出连通块的数量,每到一块油田,就采用DFS或者BFS消除该油田以及附近连通的油田。         注意(易错):                ①二维数组ma...
  • a272846945
  • a272846945
  • 2016年05月11日 11:56
  • 2093

HDU1241 油田合并(DFS)

点击打开链接 Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Jav...
  • u013790563
  • u013790563
  • 2014年02月28日 14:33
  • 1498

51Nod 1241 特殊的排序

题目传送门   分析:之前想的是求LIS,后面发现这组数据会出问题:3 1 2 4 5 6。 其实这里的LIS还应当满足前后两个元素的值相差为1。比如上面的最长子序列为:3 4 5 6,而不是1 2 ...
  • u014679804
  • u014679804
  • 2015年04月01日 22:15
  • 595
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU(1241)
举报原因:
原因补充:

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