hdu dfs Lake Counting

Lake Counting

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 14 Accepted Submission(s) : 6
Problem 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

Source
PKU

Statistic | Submit | Back

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int n,m;
char a[101][101];

int visit[101][101];

int dfs(int i,int j)
{
    if((i<0)||(i>=n)||(j<0)||(j>=m)||(visit[i][j]!=0)||(a[i][j]!='W'))
        return 0;
    else
    {
        visit[i][j]=1;
        for(int di=-1; di<=1; di++)
            for(int dj=-1; dj<=1; dj++)
                if(di!=0||dj!=0)
                    dfs(i+di,j+dj);
    }
    return 1;
}

int main()
{

    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int cnt=0;
        for(int i=0; i<n; i++)
            scanf("%s",a[i]);
        memset(visit,0,sizeof(visit));

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