杭電acm 1241Oil Deposits(dfs搜尋入門題)
阿新 • • 發佈:2019-01-27
Oil Deposits
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
Output
Sample Input
1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0
Sample Output
0 1 2 2
Source
Mid-Central USA 1997 想法:dfs模板 程式碼:#include<stdio.h>
#include<string.h>
int n,m;
char map1[110][110];
int dis[8][2]={0,1,1,0,-1,0,0,-1,1,1,-1,-1,1,-1,-1,1};
void dfs(int x,int y)
{
int tx,ty,i;
map1[x][y]='.';
for(i=0;i<8;i++)
{
tx=x+dis[i][0];
ty=y+dis[i][1];
if(tx>=0&&tx<m&&ty>=0&&ty<n)
{
if(map1[tx][ty]=='@')
{
dfs(tx,ty);
}
}
}
}
int main()
{
while(scanf("%d %d",&m,&n)&&m&&n)
{
for(int i=0;i<m;i++)
{
scanf("%s",map1[i]);
}
int sum=0;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(map1[i][j]=='@')
{
dfs(i,j);
sum++;
}
}
}
printf("%d\n",sum);
}
return 0;
}