1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
| #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#define N 1010
using namespace std;
struct MP{
int x,y;
};
bool wed[N][N];
char MAP[N][N];
int X[4]={-1,0,1,0},Y[4]={0,1,0,-1};
void BFS(MP now){
queue<MP>qq;
qq.push(now);
while(!qq.empty()){
int x=qq.front().x,y=qq.front().y;
qq.pop();
for(int i=0;i<4;i++){
if(wed[x+X[i]][y+Y[i]]){
wed[x+X[i]][y+Y[i]]=false;
if(MAP[x+X[i]][y+Y[i]]=='.')qq.push((MP){x+X[i],y+Y[i]});
}
}
}
}
int main(int argc,char *argv[])
{
int h,w,t;
scanf("%d",&t);
while(t--){
fill((bool*)wed,(bool*)wed+N*N,true);
fill((char*)MAP,(char*)MAP+N*N,'#');
scanf("%d %d",&h,&w);
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++)
while(scanf("%c",&MAP[i][j]))
if(MAP[i][j]=='.'||MAP[i][j]=='#')break;
int sum=0;
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++)
if(wed[i][j]&&MAP[i][j]=='.'){
sum++;
BFS((MP){i,j});
}
printf("%d\n",sum);
}
return 0;
}
|
