Submission #6107155

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const int INF = 1<<30;

int main(){
  int h, w;cin>>h>>w;
  int dx[]={1, -1, 0, 0}, dy[]={0, 0, 1, -1};
  vector<vector<char>> field(h, vector<char>(w));
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      cin>>field[i][j];
    }
  }
  bool ans=true;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      if(field[i][j]=='#'){
        bool bad_cell=true;
      	for(int k=0;k<4;k++){
          int x=i+dx[k], y=j+dy[k];
          if((0<=x && x<h) && (0<=y && y<w)){
          	if(field[x][y]=='#'){bad_cell=false;break;}
          }
        }
        if(bad_cell){ans=false;break;}
      }
    }
    if(!ans)break;
  }
  cout<<(ans?"Yes":"No")<<endl;
}

Submission Info

Judge Result