Submission #6016432

---

Source Code Expand

//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <queue>
#include <list>
#include <limits>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
const int MOD = 1000000007;

    class Pairs{
        public : ll a;
        ll b;
        void setpairs(ll _a, ll _b){
            a = _a;
            b = _b;
        }
    };

    bool cmp(const Pairs &A, const Pairs &B){
        return (A.a < B.a);
    }


int main(){  
    int W,H;
    cin >> H >> W;
    char map[50][50];
    int dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            cin >> map[i][j];
        }
    }
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(map[i][j] == '#'){
                for(int k=0;k<4;k++){
                    if(i+dx[k] < 0 || j+dy[k] < 0 || i+dx[k] > W-1 || j+dy[k] > H-1) continue;
                    if(map[i+dx[k]][j+dy[k]] == '#') break;
                    if(k == 3){
                        cout << "No";
                        return 0;
                    }
                }
            }
        }
    }
    cout << "Yes";
}

Submission Info

Judge Result