POJ - 2386 Lake Counting（DFS）

Description

 

Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors. 

Given a diagram of Farmer John's field, determine how many ponds he has.

 

Input

* Line 1: Two space-separated integers: N and M 

* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.

 

Output

* Line 1: The number of ponds in Farmer John's field.

 

Sample Input

 

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

Sample Output

 

3

 

 

 

 

#include<iostream>
#include<queue>
#include<cstring>
#include<stdio.h>
using namespace std;

char c;
int m,n;
char pic[105][105];
int flag[105][105];
int cnt;


void dfs(int k,int l)
{
    for(int i=-1;i<2;i++)
    {
        for(int j=-1;j<2;j++)
        {
            if((i!=0||j!=0)&&flag[k+i][l+j]!=1&&(k+i)>=0&&(k+i)<m&&(l+j)>=0&&(l+j)<n&&pic[k+i][l+j]=='W')
            {
                flag[k+i][l+j]=1;
                dfs(k+i,l+j);
            }
        }
    }
}

int main()
{

    while (scanf("%d%d",&m,&n)!=EOF)
    {
        cnt=0;
        memset(flag,0,sizeof(flag));
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf(" %c",&c);
                pic[i][j]=c;
            }
        }

        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(pic[i][j]=='W'&&flag[i][j]!=1)
                {
                    cnt++;
                    dfs(i,j);
                }
            }
        }

        printf("%d\n",cnt);
    }
    return 0;
}