关闭

poj1562 Oil Deposits(dfs求联通分量)

744人阅读 评论(0) 收藏 举报
分类:
                                                                      Oil Deposits
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 11399   Accepted: 6199

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
题目大意:给定一个n*m的矩形油田,油田中'*'代表空油井,'@'表示油井,每个油井@,与行,竖,对角线(也就是一般的8个方向)的油井都是联通的,
求一共有多少个油井联通块。
思路:题目说的很清楚,求的联通块的数量,直接dfs搞定,具体看代码,挺简单的,1A了
/*
    @author : liuwen
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
const int dir[8][2]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; //8个方向
int G[105][105],vis[105][105],n,m;
void dfs(int x,int y)    //dfs求联通分量
{
    vis[x][y]=1;
    for(int i=0;i<8;i++){
        int nowX=x+dir[i][0];
        int nowY=y+dir[i][1];
        if(nowX>=0&&nowX<n&&nowY>=0&&nowY<m&&!vis[nowX][nowY]&&G[nowX][nowY]){
            dfs(nowX,nowY);
        }
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    char str[105];
    while(scanf("%d%d",&n,&m)==2){
        if(n==0||m==0)  break;
        memset(G,0,sizeof(G));
        for(int i=0;i<n;i++){
            scanf("%s",str);
            for(int j=0;j<m;j++){
                if(str[j]=='*') G[i][j]=0; //空油为0
                else G[i][j]=1; //油井为1
            }
        }
        int cnt=0;    //连同分量
        memset(vis,0,sizeof(vis)); //访问初始化
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(!vis[i][j]&&G[i][j]){
                    dfs(i,j);
                    cnt++;
                }
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:42861次
    • 积分:1232
    • 等级:
    • 排名:千里之外
    • 原创:81篇
    • 转载:9篇
    • 译文:0篇
    • 评论:3条
    最新评论