POJ2386 Lake Counting DFS

统计有多少组八连通W

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 15807		Accepted: 7973

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<cstdio>
#include<algorithm>
#include<cstring>
#include<string>

using namespace std;


int n,m,ans;
char g[110][110];

bool jud(int i,int j)
{
    if(i>=n || i<0) return false;
    if(j>=m || j<0) return false;
    if(g[i][j]=='.') return false;
    return true;
}

void dfs(int i,int j)
{
    g[i][j]='.';
    if(jud(i+1,j)) dfs(i+1,j);
    if(jud(i,j+1)) dfs(i,j+1);
    if(jud(i-1,j)) dfs(i-1,j);
    if(jud(i,j-1)) dfs(i,j-1);
    if(jud(i+1,j+1)) dfs(i+1,j+1);
    if(jud(i-1,j-1)) dfs(i-1,j-1);
    if(jud(i+1,j-1)) dfs(i+1,j-1);
    if(jud(i-1,j+1)) dfs(i-1,j+1);

}

int main()
{
    while(cin>>n>>m)
    {
        gets(g[0]); ans=0;
        for(int i=0;i<n;i++) gets(g[i]);
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(g[i][j]=='W')
                {
                    ans++;
                    dfs(i,j);
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}