Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18221 Accepted Submission(s): 10503
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
最后一组测试数据每次输出都是1，可又实在是找不出错误的地方，郁闷死我了～～然后就提交了一下～～哇哦～AC～～～
AC-code:
#include<cstdio>
char a[110][110];
int m,n,sum;
void dfs(int x,int y)
{
if(a[x][y]!='@'||x<0||y<0||x>=m||y>=n)
return ;
else
{
a[x][y]='*';
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;
while(scanf("%d%d",&m,&n),m)
{
sum=0;
for(i=0;i<m;i++)
{
getchar();
for(j=0;j<n;j++)
{
scanf("%c",&a[i][j]);
}
}
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
if(a[i][j]=='@')
{
dfs(i,j);
sum++;
}
}
printf("%d\n",sum);
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。