【HDU】1241--Oil Deposits(DFS)
来源:互联网 发布:网络侵权的管辖 编辑:程序博客网 时间:2024/06/04 20:00
点击打开链接
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32715 Accepted Submission(s): 19005
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
0122
Source
Mid-Central USA 1997
#include<cstdio>#include<cstring>char str[105][105];int v[105][105],n,m;int fx[8]={-1,1,0,0,-1,-1,1,1};int fy[8]={0,0,-1,1,-1,1,-1,1};void bfs(int x,int y){v[x][y]=1;for(int i=0;i<8;i++){int xx=x+fx[i],yy=y+fy[i];if(xx>=0&&xx<n&&yy>=0&&yy<m&&!v[xx][yy]&&str[xx][yy]=='@'){bfs(xx,yy);}}}int main(){while(~scanf("%d%d%*c",&n,&m)&&(n!=0&&m!=0)){for(int i=0;i<n;i++)scanf("%s",str[i]);int ans=0;memset(v,0,sizeof(v));for(int i=0;i<n;i++)for(int j=0;j<m;j++){if(str[i][j]=='@'&&!v[i][j]){ans++;bfs(i,j);}}printf("%d\n",ans);}return 0;}
阅读全文
0 0
- hdu 1241 Oil Deposits(dfs入门)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits(dfs搜索)
- HDU 1241 Oil Deposits (DFS)
- [ACM] hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU-#1241 Oil Deposits(BFS & DFS)
- HDU 1241 Oil Deposits(深搜/DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU 1241 Oil Deposits (DFS)
- hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- 【HDU-1241】Oil Deposits油田(dfs)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits (DFS)
- HDU 1241 Oil Deposits(DFS)
- 【HDU】1241--Oil Deposits(DFS)
- 【hdu 1241】 Oil Deposits (dfs+bfs)
- 中国剩余定理 Biorhythms HDU
- 传值调用、传址调用
- CodeForces
- 事务是什么,以及事务四个特性
- sizeof()为什么不能得到指针指向内容的大小
- 【HDU】1241--Oil Deposits(DFS)
- day4-java&oracle总结
- java匿名内部类
- 7.31
- BIM应用平台简介
- es 查询
- mysql 5.7 解压缩版 zip 安装 详细步骤 教程
- redis学习文章
- QStandardItemModel的用法