hdu 1241 Oil Deposits (最经典的dfs)
2016-07-28 17:44
417 查看
Oil Deposits
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status
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
Sample Output
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status
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<stdio.h> #include<string.h> #include<algorithm> #include<iostream> using namespace std; char map[1000][1000]; int sum,n,m,k; void dfs(int i, int j) { if(map[i][j]!='@' || i<1 || j<1 || i>n || j>m) return; else { 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(~scanf("%d%d",&n,&m)) {if(!n||!m) break; sum=0; for(int i=1;i<=n;i++) {getchar(); for(int j=1;j<=m;j++) scanf("%c",&map[i][j]); } for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { if(map[i][j]=='@') {sum++; dfs(i,j); } } printf("%d\n",sum); } }
相关文章推荐
- 【Git/Github学习笔记汇总篇】
- 六、封装EventBus
- Eclipse里面的一些常规设置
- nginx的Mainline version、Stable version、Legacy version的版本区别
- 自己总结的web前端知识体系大全【欢迎补充】
- 使用Dialog出现的has leaked window和not attached to window manager
- 【POJ 1979】Red and Black
- Django入门:template之过滤器
- 机器学习入门
- python 函数应用
- jmeter
- 安装ASSETS下的APK,(拷贝到本地安装)
- IOS-- UIView中的坐标转换
- centos5 下 lida 调试环境搭建
- 有关浏览器兼容问题
- 通信时地址的简单设置
- AngularJS 所有版本下载
- 【jQuery】纯js的右下角弹窗
- RNN以及LSTM的介绍和公式梳理
- 【hdu 2795】Billboard 【线段树训练 3】