Hdu 1241 Oil Deposits
2012-10-03 20:48
281 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5839 Accepted Submission(s): 3407
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5
****@
*@@*@
*@**@
@@@*@
@@**@
0 0
[align=left]Sample Output[/align]
0
1
2
2
[align=left]Source[/align]
Mid-Central USA 1997
[align=left]Recommend[/align]
Eddy
#include<stdio.h> int m,n,count; int hash[101][101]; char ch[101][101]; int num[8][2]={ 0, 1, 1, 0, 0,-1, -1, 0, 1, 1, 1,-1, -1, 1, -1,-1}; void dfs(int x,int y) { int i; for(i=0;i<8;i++) { if(x+num[i][0]>=0 && x+num[i][0] <m && y+num[i][1] >= 0 && y+num[i][1]<n && !hash[x+num[i][0]][y+num[i][1]] && ch[x+num[i][0]][y+num[i][1]]=='@') { hash[x+num[i][0]][y+num[i][1]]=1; dfs(x+num[i][0],y+num[i][1]); } } } int main(void) { // freopen("d:\\in.txt","r",stdin); while(scanf("%d%d",&m,&n),(m!=0 || n!=0)) { int i,j; count=0; for(i=0;i<m;i++) scanf("%s",ch[i]); for(i=0;i<m;i++) for(j=0;j<n;j++) hash[i][j]=0; for(i=0;i<m;i++) for(j=0;j<n;j++) { if(ch[i][j]=='@' && !hash[i][j]) { count++; hash[i][j]=1; dfs(i,j); } } printf("%d\n",count); } return 0; }
相关文章推荐
- hdu_1241_Oil Deposits(BFS)
- HDU-1241 (Oil Deposits )
- HDU 1241 Oil Deposits
- HDU--1241 -- Oil Deposits [水水的DFS]
- HDU 1241 Oil Deposits(深搜)
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits (水水的一道搜索题,我的搜索由此启程)
- [kuangbin带你飞]专题1 简单搜索 L - Oil Deposits HDU - 1241
- HDU 1241 Oil Deposits DFS求连通块
- HDU 1241 Oil Deposits
- hdu-1241-Oil Deposits
- HDU--杭电--1241--Oil Deposits--广搜
- hdu 1241 Oil Deposits----DFS
- hdu 1241 Oil Deposits(水一发,自我的DFS)
- hdu 1241:Oil Deposits
- POJ 1562 && HDU 1241 Oil Deposits(dfs)
- HDOJ(HDU).1241 Oil Deposits(DFS)