HDU 1241 Oil Deposits(八连块问题) 与 黑白图像(刘汝佳的小白6.4.1)同样的原理(DFS)
来源:互联网 发布:按键精灵调用vb 编辑:程序博客网 时间:2024/06/01 07:29
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11377 Accepted Submission(s): 6638
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
#include <stdio.h>#include <string.h>char a[110][110];int vis[110][110],m,n;//author:XXYYvoid dfs(int x,int y){if(vis[x][y]||a[x][y]=='*'||x<0||y<0||x==m||y==n)return;vis[x][y]=1;dfs(x-1,y-1);dfs(x-1,y);dfs(x-1,y+1);dfs(x,y-1);dfs(x,y+1);dfs(x+1,y-1);dfs(x+1,y);dfs(x+1,y+1);}int main(){int i,j,ans;while(~scanf("%d%d",&m,&n),(m+n)){memset(vis,0,sizeof(vis));for(i=0;i<m;i++)scanf("%s",a[i]);ans=0;for(i=0;i<m;i++){for(j=0;j<n;j++){if(!vis[i][j]&&a[i][j]=='@'){ans++;dfs(i,j);}}}printf("%d\n",ans);}return 0;}
0 0
- HDU 1241 Oil Deposits(八连块问题) 与 黑白图像(刘汝佳的小白6.4.1)同样的原理(DFS)
- hdu-1241Oil 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)
- [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)
- Training--使用Fragment创建动态UI(3)-- 与其他Fragment通信
- 如何编译OpenWrt
- spark 1.0 安装
- My97DatePicker时间控件使用
- string、 CString、 char* 比较总结
- HDU 1241 Oil Deposits(八连块问题) 与 黑白图像(刘汝佳的小白6.4.1)同样的原理(DFS)
- 通过双向证书认证使用 gSOAP 访问 web services
- Effective C++ Item 31 降低文件间编译依存关系
- NFS环境的建立和使用
- DataGridView中显示进度条(ProgressBar)
- poj 1579 Function Run Fun
- 去掉网页上链接或按钮的虚线框
- PAT循环-16. 猴子吃桃问题(15)
- JNI 返回结构体参数的方法