Oil Deposits
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 26 Accepted Submission(s) : 24
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
题意:用*表示无油地,@表示有油地,若有油地相邻的地方存在有油地则他们表示一个较大的有油地,给定一片区域问有油地的种类数目。
解题思路:找到有油地为dfs起始点,把他和其相邻的有油地转化为无油地。每找到一个油田把sum++,最后输出sum。
源代码:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char pet[105][105];
int x,y;
int zuo[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
void dfs(int a,int b)
{
int j,xx,yy;
pet[a][b]='*';
for(int j=0;j<8;j++)
{
xx=a+zuo[j][0];
yy=b+zuo[j][1];
if(xx>=0&&yy>=0&&xx<=x&&yy<=y)
{
if(pet[xx][yy]=='@')
dfs(xx,yy);
}
}
}
int main()
{
int sum;
while(scanf("%d%d",&x,&y),x!=0&&y!=0)
{
sum=0;
for(int i=0;i<x;i++)
scanf("%s",pet[i]);
for(int i=0;i<x;i++)
{
for(int k=0;k<y;k++)
{
if(pet[i][k]=='@')//有油的开始dfs,把同油田的通过dfs变为无油的
{
sum++;
dfs(i,k);
}
}
}
printf("%d\n",sum);
}
return 0;
}