Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 38414 | Accepted: 19073 |
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.
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.
* 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
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
#include <bits/stdc++.h>
using namespace std;
int N,M;
char yard[100][100];
int dx[]={0, 0 , -1, -1 ,-1 , 1 , 1 , 1 };
int dy[]={1 , -1 , -1, 0 ,1 , -1 , 0, 1 };
int countWater=0;
void dfs(int x, int y){
yard[x][y]='.';
for(int i=0;i<8;i++){
int newx = x + dx[i];
int newy = y + dy[i];
if( newx>=0 && newx<N && newy>=0 && newy<M && yard[newx][newy] =='W'){
dfs(newx,newy);
}
}
return ;
}
int main()
{
cin >> N >> M ;
for(int i=0;i<N;i++)
for(int j=0;j<M;j++){
cin >> yard[i][j];
}
for(int i=0; i<N; i++)
for(int j=0; j<M; j++){
if( yard[i][j]=='W' ){
dfs( i,j);
countWater++;
}
}
cout << countWater;
return 0;
}
教训一: 误认为是四个方向
教训二: 大写的W,没注意到