UVA 572(简单的dfs)
2012-11-03 19:37
302 查看
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 ina 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; otherwiseand
. 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
0 1 2 2
代码:[code]#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; }
[/code]
相关文章推荐
- 暴力求解——UVA 572(简单的dfs)
- UVA 572 - Oil Deposits(简单DFS)
- UVA 572- Oil Deposits(简单dfs)
- UVa 572 - Oil Deposits (简单dfs)
- UVa 572 - Oil Deposits (简单dfs)
- Uva 572 - Oil Deposits(DFS)
- 简单dfs:UVA 260 Il Gioco dell'X
- UVa 572 Oil Deposits(DFS求8连通块)
- 经典第六章 例题 6-12 UVA 572 Oil Deposits(用DFS求连通块)
- [uva-572]Oil Deposits (BFS和DFS两种
- UVA - 572 Oil Deposits (dfs)
- UVA 10004 Bicoloring【DFS简单二部图判定】
- UVA - 572 - Oil Deposits (图的DFS!)
- uva572(DFS 油田)
- Uva572种子填充<dfs>
- uva--539+简单dfs
- Uva-572 - Oil Deposits(DFS)
- UVA 10318 简单dfs
- UVA572 Oil Deposits dfs
- UVa 572 - Oil Deposits(油田 dfs) 错的离谱的我