HDU 1241 Oil Deposits 简单易懂的dfs

原创 2018年04月15日 11:33:33

Oil Deposits

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


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
整道题没有什么坑点,直接看代码吧,如果有什么不懂的可以直接在评论说出来。
#include<bits/stdc++.h>
using namespace std;
char mp[100][101];
int vis[100][101];
void dfs(int x,int y){
	if(mp[x][y]=='*'||vis[x][y]==1)
	return ;
	vis[x][y]=1;
	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);  
    dfs(x+1,y);  
    dfs(x-1,y);
    return;
}
int main()
{
	int n,m,i,j,count;

	
	vector<int >num;
	while(cin>>m>>n&&m!=0){
	count=0;
	memset(mp,'*',sizeof(mp));
	memset(vis,0,sizeof(vis));
		for(i=1;i<=m;i++){
			for(j=1;j<=n;j++){
				cin>>mp[i][j];
			}
		}
	for(i=1;i<=m;i++){
		for(j=1;j<=n;j++){
			if(mp[i][j]=='@'&&vis[i][j]!=1){
				dfs(i,j);
				count++;
			}
		}
	}
		num.push_back(count);
		
	}
	vector<int>::iterator it;
	for(it=num.begin();it!=num.end();it++){
		cout<<*it<<endl;
	
	}
 }	

Android项目实战:简单天气

学习新的知识点,时下Android比较流行的MPAndroidChart + Retrofit2.0 + Gson!
  • 2016年11月25日 09:21

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

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

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

hdu1241 Oil Deposits(dfs&&bfs)

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

hdu1241(Oil Deposits)

点击打开hdu1241 Problem Description The GeoSurvComp geologic survey company is responsible for detectin...
  • u011479875
  • u011479875
  • 2015-08-02 21:01:50
  • 950

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

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

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

hdu Oil Deposits

算法:深搜 题意:让你判断有几个油库; Problem Description The GeoSurvComp geologic survey company is responsible fo...
  • wangxianse
  • wangxianse
  • 2015-12-09 20:25:50
  • 93

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
收藏助手
不良信息举报
您举报文章:HDU 1241 Oil Deposits 简单易懂的dfs
举报原因:
原因补充:

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