Lake Counting

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 36946		Accepted: 18370

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<cstring>
#include<cstdio>
#include<algorithm>
#define  N 105
#define test cout<<"*****"<<endl
using namespace std;
char k[N][N];
int n,m;
int dir[8][2]={{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}};
void dfs(int x,int y){
        k[x][y]='.';
    for(int t=0;t<8;t++){
            int xx=x+dir[t][0];
            int yy=y+dir[t][1];
            if(xx>=0&&xx<n&&yy>=0&&yy<m&&k[xx][yy]=='W')
                dfs(xx,yy);
    }
}
int main(){
        int cnt=0;
        cin>>n>>m;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cin>>k[i][j];
            }
        }
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++){
                if(k[i][j]=='W'){
                        dfs(i,j);
                        cnt++;
                    }
            }
        printf("%d
",cnt);
    return 0;
}