(DFS)Oil Deposits--HDOJ
来源:互联网 发布:2016中国象棋软件排名 编辑:程序博客网 时间:2024/05/20 16:34
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 168 Accepted Submission(s): 100
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
Mid-Central USA 1997
Recommend
Eddy
总结:
总算1A 一次了。。。
#include<iostream>#include<string.h>#include<string>#include<stdio.h>#include<algorithm>#include<math.h>#define PI acos(-1.0)#define eps 0.00000001using namespace std;char mp[101][101];int vis[101][101];int m,n;int dirx[8] = {-1,1,0,0,-1,-1,1,1};int diry[8] = {0,0,1,-1,-1,1,-1,1};void DFS(int x,int y){ // cout<<x<<' '<<y<<endl; vis[x][y] = 1; for(int k=0; k<8; ++k) { int xx = x + dirx[k]; int yy = y + diry[k]; if(xx < 0 || xx == n || yy < 0 || yy == m) continue; if(vis[xx][yy]) continue; DFS(xx,yy); }}int main(void){ // freopen("in.txt","r",stdin); while(scanf("%d %d",&n,&m)) { if(!n && !m) break; memset(vis,0,sizeof(vis)); int cnt = 0; for(int i=0; i<n; ++i) for(int j=0; j<m; ++j) { cin >>mp[i][j]; if(mp[i][j] == '*') vis[i][j] = 1; } for(int i=0; i<n; ++i) for(int j=0; j<m; ++j) { if(!vis[i][j]) { cnt++; DFS(i,j); } } cout << cnt <<endl; } return 0;}
- (DFS)Oil Deposits--HDOJ
- HDOJ 1241 Oil Deposits (DFS)
- HDOJ 1241 Oil Deposits(DFS)
- HDOJ--1241--Oil Deposits【DFS】
- hdoj 1241 Oil Deposits (DFS)
- hdoj 1241 Oil Deposits【DFS】
- HDOJ 1241 Oil Deposits(dfs)
- HDOJ 1241 Oil Deposits (DFS)
- HDOJ 1241 Oil Deposits【DFS】
- Oil Deposits(DFS)
- Oil Deposits (DFS)
- HDOJ 1241 Oil Deposits(8方位简单dfs)
- HDOJ 1241 Oil Deposits(8方位dfs)
- hdoj problem 1241 Oil Deposits(深搜 DFS)
- HDOJ/HDU 1241 Oil Deposits(经典DFS)
- HDOJ(HDU).1241 Oil Deposits(DFS)
- poj1562--Oil Deposits(DFS)
- HDU1241 Oil Deposits(DFS)
- Oracle中having函数和in函数的用法
- delete this 的使用及注意事项
- [leetcode]112. Path Sum@Java解题报告
- Excel导出模板
- KeepAlived+DRDB+MFS安装及配置
- (DFS)Oil Deposits--HDOJ
- 刷题——Lake Counting POJ
- jQuery向后台传入json格式数据的方法
- 我使用过的Linux命令之unrar
- 学会4种备份MySQL数据库(基本备份方面没问题了)
- 异常(try……catch……finally、throws和throw的区别、自定义异常)
- 习题 5.3 输入两个正整数m和n,求其最大公约数和最小公倍数。
- Faster rcnn--改变anchor的size
- 解决Spring的声明式事务中的自定义异常不回滚问题