UVA572 POJ1562 oil deposits（DFS求连通块问题）

最新推荐文章于 2020-12-22 11:36:28 发布

sunny1996

最新推荐文章于 2020-12-22 11:36:28 发布

阅读量546

点赞数

分类专栏：算法与ACM 文章标签： uva poj dfs

本文链接：https://blog.csdn.net/sunny1996/article/details/43939251

版权

算法与ACM 专栏收录该内容

34 篇文章 2 订阅

订阅专栏

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 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

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

DFS求连通块的基本类型，只要搜到一个@就把它变为*并开始搜它周边的油田，搜完后继续。。。。。。注意坐标的横竖，几次都WA在这个地方。

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char grids[102][102];
int m,n,dy[8]={-1,-1,-1,0,0,1,1,1},dx[8]={-1,0,1,-1,1,-1,0,1};

void dfs(int x,int y)
{
    int k,x0,y0;
    for (k=0;k<=7;k++)
    {
       x0=x+dx[k];
       y0=y+dy[k];
       if (x0>=0&&y0>=0&&x0<=n-1&&y0<=m-1&&grids[x0][y0]=='@')
       {
           grids[x0][y0]='*';
          dfs(x0,y0);
       }
    }
}

int main()
{
    int i,j,ans[102]={0},num=0;
    char v,c;
    do{
       scanf("%d%d%c",&n,&m,&v);
       if (m==0)
          break;
      for(i=0;i<n;i++)
	{
        for(j=0;j<m;j++)
		{
            while(c=getchar(),c!='*'&&c!='@');
            	grids[i][j]=c;
        }
    }
       for (i=0;i<=n;i++)
       for (j=0;j<=m;j++)
       {
          if (grids[i][j]=='@')
          {
             dfs(i,j);
             ans[num]++;
          }
       }
     memset(grids,'*',sizeof(grids));
    num++;
    }while(1);
    for (i=0;i<=num-2;i++)
       printf("%d\n",ans[i]);
    printf("%d",ans[num-1]);
    return 0;
}