【POJ】1562 Oil Deposits(DFS)

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

0
1
2
2

AC代码:

//
//  main.cpp
//  POJ 1562
//
//  Created by showlo on 2018/4/16.
//  Copyright © 2018年 showlo. All rights reserved.
//

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define max 1000
char map[max][max];
int vis[max][max],num[max][max];
int m,n;

void dfs(int x,int y){
    int i,j,nx,ny;
    vis[x][y]=1;
    for (i=-1; i<=1; i++) {
        for (j=-1; j<=1; j++) {
            nx=x+i;
            ny=y+j;
            if (nx>=0&&nx<m&&ny>=0&&ny<n&&map[nx][ny]=='@'&&vis[nx][ny]==0)
            {
                vis[nx][ny]=1;
                dfs(nx, ny);
            }
            else
                continue;
        }
    }
    return;
}
int main() {
    int i,j,num;
    while (scanf("%d %d",&m,&n)!=EOF) {
        if (m==0)
            break;
        num=0;
        memset(vis, 0, sizeof(vis));
        for(i=0;i<m;i++)
            scanf("%s",map[i]);
        for (i=0; i<m; i++) {
            for (j=0; j<n; j++) {
                if (map[i][j]=='@'&&vis[i][j]==0) {
                    dfs(i,j);
                    num++;
                }
            }
        }
        printf("%d\n",num);
    }
    return 0;
}



阅读更多
文章标签: C语言
个人分类: 自学编程 POJ DFS
上一篇【HDU】1016 DFS——Prime Ring Problem
下一篇DFS——细胞问题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭