A - Lake Counting



A - Lake Counting

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status

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<stdio.h>

char a[105][105];
int n, m;
int num;
int map[8][2] = {{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,-1},{-1,1}};
void dfs(int x,int y)
{
    int i;
    for(i = 0; i < 8; i ++)
    {
        int xx = x + map[i][0];
        int yy = y + map[i][1];
        if(xx < n && xx >= 0 && yy < m && yy >= 0 && a[xx][yy] == 'W')
        {
            a[xx][yy] = '.';
            dfs(xx,yy);
        }
    }
}

int main()
{
    int i, j;
    while(scanf("%d%d",&n,&m) != EOF)
    {
        num = 0;
        for(i = 0; i < n; i ++)
        {
            for(j = 0; j < m; j ++)
            {
                scanf(" %c",&a[i][j]);
            }
        }

        for(i = 0; i < n; i ++)
        {
            for(j = 0; j < m; j ++)
            {
                if(a[i][j] == 'W')
                {
                    a[i][j] = '.';
                    num ++;
                    dfs(i,j);
                }
            }
        }
        printf("%d\n",num);
    }
    return 0;
}