HDU 1241 :Oil Deposits
2015-12-24 10:36
381 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11360 Accepted Submission(s): 6626
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0
[align=left]Sample Output[/align]
0 1 2 2
从每一个“@”格子出发,递归遍历它周围的“@”格子。。再将其改为“*”。结果加一。
这是一道经典的DFS。。
非常easy的。。
#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> using namespace std; const int M = 100 + 5; int m, n; int sum; char oil[M][M]; int dx[8]= {1,1,1,0,0,-1,-1,-1}; int dy[8]= {0,1,-1,1,-1,1,0,-1}; void dfs( int x, int y ) { int i, xx, yy; for(i=0; i<8; i++ ) { xx = x + dx[i]; yy = y + dy[i]; if(xx<0 || xx>=m || yy<0 || yy>=n) //边境 continue; if(oil[xx][yy] == '*') continue; oil[xx][yy] = '*'; dfs( xx, yy ); } } int main() { int i, j; while(~scanf("%d%d", &m, &n)&&m&&n) { sum = 0; for(i=0; i<m; i++) scanf("%s", oil[i]); for(i=0; i<m; i++) for(j=0; j<n; j++) { if(oil[i][j] == '@') { dfs( i, j ); sum++; } } printf("%d\n",sum); } return 0; }
相关文章推荐
- 字典Dictionary
- proguardgui.bat来混淆已有的jar包
- 关于一个每日定时推送本地通知的问题
- 链表反转
- 如何在 Ubuntu 中安装最新的 Arduino IDE 1.6.6
- LeetCode 223:Rectangle Area
- 第二章:流程控制与数组
- TabControl与UserControl合伙吃内存
- ARMv8-a架构简介
- oracle的commit详解
- Spring 在 xml配置文件 或 annotation 注解中 运用Spring EL
- iOS判断程序第一次启动
- Jquery获得下拉框的值
- 【原】机器学习几个基本的问题
- Jmeter参数化的4种方法
- iOS开发~CocoaPods使用详细说明
- 自定义Label文字绘制区域
- js 中获取项目当前服务器路径
- 【实例】在java中如何获取xml文件数据
- Android 结束进程