HDU 1241 Oil Deposits DFS
2016-11-19 11:35
393 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25965 Accepted Submission(s): 14956
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
0
1
2
2
Source
Mid-Central USA 1997
Recommend
Eddy | We have carefully selected several similar problems for you: 1010 1312 1242 1240 1181
用dfs深度搜索。
#include <stdio.h> #include <string.h> int m,n; char a[105][105]; void dfs(int i,int j) { if(a[i][j]!='@'||i<0||i>=m||j<0||j>=n) { return ; } a[i][j]='!'; dfs(i-1,j); dfs(i+1,j); dfs(i,j-1); dfs(i,j+1); dfs(i-1,j-1); dfs(i+1,j-1); dfs(i+1,j+1); dfs(i-1,j+1); } int main() { int i,j,ans; while(scanf("%d %d",&m,&n),m) { getchar(); for(i=0;i<m;i++) { scanf("%s",a[i]); //gets(a[i]); getchar(); //puts(a[i]); } ans=0; for(i=0;i<m;i++) { for(j=0;j<n;j++) { if(a[i][j]=='@') { dfs(i,j); ans++; } } } printf("%d\n",ans); } return 0; }
相关文章推荐
- hdu-1241 Oil Deposits(DFS)
- HDU 1241 Oil Deposits(八连块问题) 与 黑白图像(刘汝佳的小白6.4.1)同样的原理(DFS)
- HDU-#1241 Oil Deposits(BFS & DFS)
- hdu 1241 Oil Deposits(DFS求连通块)
- HDU1241_Oil Deposits(BFS)+(DFS)
- HDU——1241 Oil deposits(dfs)
- HDU 1241 Oil Deposits DFS无回溯 求油田的个数
- HDOJ/HDU 1241 Oil Deposits(经典DFS)
- HDU-1241 Oil Deposits 【dfs】
- DFS(连通块) HDU 1241 Oil Deposits
- HDU 1241 Oil Deposits DFS求连通块
- HDOJ(HDU).1241 Oil Deposits(DFS)
- HDU 1241 Oil Deposits(DFS)
- K - Oil Deposits HDU - 1241——DFS
- hdu 1241 Oil Deposits(经典dfs)
- HDU 1241 Oil Deposits(dfs入门级别模板题)
- hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits (DFS)(BFS)
- 【HDU 1241 Oil Deposits】 + DFS || BFS
- HDU 1241/UVa572 Oil Deposits(DFS&BFS)