Lake Counting
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 39702 | Accepted: 19677 |
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.
Source
链接:http://poj.org/problem?id=2386
该题是深度优先搜索(DFS)的典型例题,具体思路:
建立一个DFS函数,搜索一个W元素(首先要将他变成点)的八面,如果其中的面是W,继续用DFS搜索即可
具体代码如下:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
char a[111][111];
int n,m;
bool dfs(int i,int j)
{
if(a[i][j] == '.') return false;
a[i][j] = '.';
for(int ii = -1;ii <= 1;ii++)
for(int jj = -1;jj <=1;jj++)
if(ii+i >= 0 &&ii+i < n && jj+j >= 0 && jj+j < m && a[ii+i][jj+j] == 'W')
dfs(ii+i,jj+j);
return true;
}
int main()
{
while(cin >>n >> m)
{
int s = 0;
for(int i = 0;i < n;i++)
cin >> a[i];
for(int i = 0;i<n;i++)
for(int j = 0;j < m;j++)
if(dfs(i,j))
s++;
cout << s <<endl;
}
return 0;
}
把ii打成i,找了很久才发现