#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int m,n;
int dir[8][2] ={1,-1,1,0,1,1,-1,-1,-1,0,-1,1,0,-1,0,1};
char map[105][105];
bool vis[105][105];
void dfs(int x,int y){
for(int i=0 ;i<8 ;i++){
int dx = dir[i][0]+x;
int dy = dir[i][1]+y;
if(dx>=0&&dy>=0&&dy<n&&dx<m&&map[dx][dy]=='@'&&!vis[dx][dy]){
vis[dx][dy]=true;
dfs(dx,dy);
}
}
}
int main(){
freopen("input.txt","r",stdin);
while(cin>>m>>n){
if(m==0)break;
getchar();
memset(vis,0,sizeof(vis));
for(int i=0 ;i<m;i++){
gets(map[i]);
}
int cnt = 0;
for(int i=0 ;i<m ;i++){
for(int j=0 ;j<n ;j++){
if(map[i][j]=='@'&&!vis[i][j]){
cnt++;
dfs(i,j);
}
}
}
cout<<cnt<<endl;
}
return 0;
}
UVa - 572 - Oil Deposits(dfs求连通块)
最新推荐文章于 2020-10-12 15:20:37 发布