Submission #74304164

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
bool is_boun;
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
void dfs(vector<string>&grid,int H,int W,int r,int c,vector<vector<bool>>&visited){
    visited[r][c]=true;
    if(r==0||r==H-1||c==0||c==W-1){
        is_boun=true;
    }
    for(int i=0;i<4;i++){
        int xr=r+dx[i];
        int yc=c+dy[i];
        if(xr>=0&&xr<H&&yc>=0&&yc<W){
            if (grid[xr][yc] == '.' && !visited[xr][yc]) {
                dfs(grid,H,W,xr, yc,visited);
            }
        }
    }
}
int main(){
    int H,W;
    cin>>H>>W;
    vector<string>grid(H);
    for(int i=0;i<H;i++){
        cin>>grid[i];
    }
    vector<vector<bool>>visited(H,vector<bool>(W,false));
    
    int cnt=0;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(grid[i][j]=='.'&&!visited[i][j]){
                is_boun=false;
                dfs(grid,H,W,i,j,visited);
                if(!is_boun){
                    cnt++;
                }
            }
        }
    }
    cout<<cnt<<endl;
}

Submission Info

Judge Result