UVA 572(简单的dfs)
来源:互联网 发布:linux常用命令mv 编辑:程序博客网 时间:2024/03/30 11:16
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 containingm andn, the number of rows and columns in the grid, separated by a single space. Ifm = 0 it signals the end of the input; otherwise and. Following this arem lines ofn 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<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>#include<queue>#include<cstdlib>#include<string>using namespace std; typedef long long ll;const double pi=acos(-1.0);char s[120][120];int a[8]={-1,-1,0,1,1,1,0,-1};int b[8]={0,1,1,1,0,-1,-1,-1};void dfs(int i,int j){if(i<0 || j<0)return;if(s[i][j]=='@'){s[i][j]='*';for(int k=0;k<8;k++)dfs(i+a[k],j+b[k]);}}int main(){int m,n;while(scanf("%d%d",&m,&n)!=EOF && (m||n)){int i,j;for(i=0;i<m;i++)scanf("%s",s[i]);int ans=0;for(i=0;i<m;i++){for(j=0;j<n;j++){if(s[i][j]=='@'){ans++;dfs(i,j);}}}printf("%d\n",ans);}return 0;}
- UVA 572(简单的dfs)
- UVA 572- Oil Deposits(简单dfs)
- UVa 572 - Oil Deposits (简单dfs)
- UVA 10318 简单dfs
- uva--539+简单dfs
- UVA - 784 Maze Exploration (简单dfs)
- uva 784 Maze Exploration(简单dfs)
- UVA - 572 - Oil Deposits (图的DFS!)
- UVa 572 Oil Deposit (DFS)
- UVa 572 Oil Deposits(DFS)
- UVa 572 Oil Deposits(DFS)
- Uva-572 - Oil Deposits(DFS)
- UVA 572Oil Deposits(DFS)
- poj1573(简单的dfs)
- poj3051(简单的dfs)
- DFS的简单应用
- 【DFS】UVA
- 【DFS】UVA
- Android把res/raw的资源转化为Uri形式访问
- python 线程笔记(一)
- 检索结果聚类
- 黑马程序员-----IO流总结笔记三
- 网站分析的烦恼连载(KPI篇)
- UVA 572(简单的dfs)
- 网站分析基础概念之网页与网页浏览数
- 黑马程序员------自己对java的认识
- Windows环境下编译python
- 在Ubuntu10.04上设置和下载android4.0源码
- 判断一个Activity在当前激活状态
- 为什么linux下要configure然后make make install【zz】
- 若无云,岂有风——词语语义相似度计算简介
- 第一章:JavaScript基础---(二)基础语法