HDU 1241 Oil Deposits(深搜基础模板)
2016-07-27 21:26
453 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24345 Accepted Submission(s): 13996
[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
[align=left]Source[/align]
Mid-Central USA 1997
[align=left]Recommend[/align]
Eddy
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; char map[110][110]; int n,m,ans,i,j; void dfs(int x,int y) { if(x<0||y<0||x>=n||y>=m) return ; if(map[x][y]=='*') return ; if(map[x][y]=='@') map[x][y]='*'; dfs(x,y+1); dfs(x+1,y); dfs(x-1,y); dfs(x,y-1); dfs(x+1,y+1); dfs(x-1,y+1); dfs(x-1,y-1); dfs(x+1,y-1); } int main() { while(scanf("%d%d",&n,&m),n+m) { for(i=0;i<n;i++) scanf("%s",map[i]); ans=0; for(i=0;i<n;i++) for(j=0;j<m;j++) { if(map[i][j]=='@') ans++; dfs(i,j); } printf("%d\n",ans); } return 0; }
相关文章推荐
- 什么东西只花十分钟,但是受益终身
- laravel5数据库操作
- Ionic环境搭建
- 使用class-dump导出其他应用头文件
- JSTL的配置与使用
- 奇怪的问题,列名无效
- Codeforces-448【A数学函数ceil】【B思维】【D二分】
- Redis 和 Memcache 的性能对比基础篇
- 项目安排[动态规划]
- 基于spark的DataFrame实战
- Struts2的三种参数传递方式
- HDOJ 1551 Cable master
- JAVA中实现链式操作(方法链)的简单例子
- 图形学(7)光照模型
- hdu5758Explorer Bo
- UITableView全面解析文章
- 虚拟机 centos 6.5 扩展根目录分区大小
- 第2章 启动和结束
- CodeForces 427B
- noip2009 最优贸易