Lake Counting
Time Limit: 1000MS |
| Memory Limit: 65536K |
Total Submissions: 20476 |
| Accepted: 10310 |
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 12W........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.
题意:
看样例
这个题感觉像1979 Red and Black 的升级版,多搜了几次。本来想用结构体把W的坐标保存起来,但是会re,不造为毛啊。
Dfs:
Source Code
Problem: 2386 |
| User: |
Memory: 540K |
| Time: 32MS |
Language: C++ |
| Result: Accepted |
· Source Code
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=101;
int field[maxn][maxn],visit[maxn][maxn],n,m,c;
int move[8][8]={{1,0},{1,1},{1,-1},{0,1},{0,-1},{-1,0},{-1,1},{-1,-1}};
void dfs(int line,int row){
for(int i=0;i<8;i++){
int tmpl=line+move[i][0],tmpr=row+move[i][1];
if(field[tmpl][tmpr] && tmpl<n &&tmpl>=0 && tmpr<m && tmpr>=0 && !visit[tmpl][tmpr])
{
visit[tmpl][tmpr]=1;
dfs(tmpl,tmpr);
}
}
return;
}
int main(){
while(~scanf("%d %d",&n,&m)){
memset(field,0,sizeof(field));
memset(visit,0,sizeof(field));
int w=-1,c=0;
for(int i=0;i<n;i++)
{
getchar();
for(int j=0;j<m;j++)
{
char tmp;
scanf("%c",&tmp);
if(tmp=='W')
{
field[i][j]=1;
}
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(field[i][j] && !visit[i][j])
{
c++;
visit[i][j]=1;
dfs(i,j);
}
}
}
cout<<c<<endl;
}
}
同样的,像1979那样用bfs和递归也可以写,都差不多就没写了。