Description
Given a diagram of Farmer John's field, determine how many ponds he has.
Input
* 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
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<algorithm>
#include<cstring>
using namespace std;
char z[110][110];
int n,m,dx[8]={-1,1,0,0,-1,-1,1,1},dy[8]={0,0,-1,1,-1,1,-1,1},vis[110][110];
struct pp
{
int x,y;
};
pp p[10010];
void dfs(int x,int y)
{
for(int i=0;i<8;i++)
if(!vis[x+dx[i]][y+dy[i]]&&z[x+dx[i]][y+dy[i]]=='W')
{
vis[x+dx[i]][y+dy[i]]=1;
dfs(x+dx[i],y+dy[i]);
}
}
int main()
{
while(cin>>n>>m)
{
memset(vis,0,sizeof(vis));
int cnt=0,s=0;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
cin>>z[i][j];
if(z[i][j]=='W')
{
p[cnt].x=i;
p[cnt].y=j;
cnt++;
}
}
for(int i=0;i<cnt;i++)
if(!vis[p[i].x][p[i].y])
{
dfs(p[i].x,p[i].y);
s++;
}
cout<<s<<endl;
}
return 0;
}
199



被折叠的 条评论
为什么被折叠?



