hdu 1241 Oil Deposits(DFS)
2016-01-27 21:15
225 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3087 Accepted Submission(s): 1765
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<stdio.h> char map[105][105]; int dir[8][2]={{-1,-1},{-1,0},{-1,1},{0,1},{0,-1},{1,1},{1,0},{1,-1}}; int m,n; void DFS(int x,int y) { int i,xx,yy; map[x][y]='*'; for(i=0;i<8;i++) { xx=x+dir[i][0]; yy=y+dir[i][1]; if(xx>n||yy>m||xx<1||yy<1) continue; if(map[xx][yy]!='*') DFS(xx,yy); } } int main() { int i,j; while(scanf("%d%d",&n,&m),n,m) { int count=0; for(i=1;i<=n;i++) { getchar(); for(j=1;j<=m;j++) { scanf("%c",&map[i][j]); } } for(i=1;i<=n;i++) for(j=1;j<=m;j++) { if(map[i][j]=='@') { DFS(i,j); count++; } } printf("%d\n",count); } return 0; }
相关文章推荐
- Android获取数据过程中旋转屏幕问题
- java系列--JSON数据的处理
- xcode中添加pch全局引用文件
- Apachetop 实时监测apache服务器运行状况简介
- spider/pyspider基础
- 王学岗Fragment(三)——带参数
- 蓝桥杯--裁剪格子(DFS)
- 递推 HDU 2047 阿牛的EOF牛肉串
- 5.python(迭代器,装饰器,生成器,基本算法,正则)
- Lua 从C程序获得Lua变量值
- Comsol中Absolute Pressure的解释
- 数据库数据处理性能提升技术
- 通过jQuery在IE中支持placeholder
- 机器学习实战笔记 k-近邻算法
- JavaScript--window与document的getComputedStyle()方法的区别
- Binary Tree Paths leetcode
- erlang init:stop()不起效
- Codeforces 617C(Watering Flowers)
- hdu1004 (map容器的使用)
- 一致性哈希算法原理