hdu1248 oil deposits
来源:互联网 发布:mysql登录数据库命令 编辑:程序博客网 时间:2024/05/19 06:36
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6270 Accepted Submission(s): 3640
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#include<iostream>#include<cstring>#include<cstdio>#define maxn 105char map[maxn][maxn];int n,m;using namespace std;void dfs(int i,int j){ if(map[i][j]!='@'||i<=0||j<=0||j>m||i>n) return; map[i][j]='#';//搜到的做上标记 dfs(i-1,j-1);//八个方向深搜 dfs(i-1,j); dfs(i-1,j+1); dfs(i,j-1); dfs(i,j+1); dfs(i+1,j-1); dfs(i+1,j); dfs(i+1,j+1);}int main(){ while(cin>>n>>m) { int sum=0; if(!n&&!m) break; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { cin>>map[i][j]; } for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { if(map[i][j]=='@') { dfs(i,j); sum++; } } cout<<sum<<endl; } return 0;}
*@*@***@***@*@*1 8@@****@*5 5 ****@*@@*@*@**@@@@*@@@**@0 0
Sample Output
0122
- hdu1248 oil deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- oil deposits
- Oil Deposits
- c#和数据库的两种事物处理
- IOS 细节整理
- shell数组
- 性能测试面试题
- Ext.data.Store 使用详解 (Extjs 3)
- hdu1248 oil deposits
- 了解jQuery的animate()函数
- 和菜鸟一起学linux总线驱动之DMA传输
- MTD源码分析
- 命令行安装bar应用到 BlackBerry 10 手机上
- IOS之画图
- 企业管理软件定制开发的优缺点
- hibernate学习第一天总结
- myjs