Submission #74308178

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
char c;
bool f[1005][1005];
short n,m,wx[4]={0,0,-1,1},wy[4]={-1,1,0,0};
int ans=0;
struct xy{
    short x,y;
};
int bfs(short sx,short sy){
    queue<xy> x;
    bool ff=1;
    x.push({sx,sy});
    f[sx][sy]=1;
    while(x.size()){
        short nx=x.front().x,ny=x.front().y;
        x.pop();
        for(short i=0;i<4;i++){
            short xx=nx+wx[i],yy=ny+wy[i];
            if(xx<1||xx>n||yy<1||yy>m){
                ff=0;
                continue;
            }else if(f[xx][yy])  continue;
            x.push({xx,yy});
            f[xx][yy]=1;
        }
    }
    return ff?1:0;
}
signed main(){
    cin>>n>>m;
    for(short i=1;i<=n;i++)  for(short j=1;j<=m;j++){
        cin>>c;
        f[i][j]=(c=='#');
    }
    for(short i=2;i<n;i++)  for(short j=2;j<m;j++)  if(!f[i][j])  ans+=bfs(i,j);
    cout<<ans;
}

Submission Info

Judge Result