Submission #6014807

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define llong long long
#define INF (__INT32_MAX__ / 2)

using namespace std;
typedef pair<int, int> ipair;
llong modulo(llong left, llong right) { return (left % right + right) % right; }

int H, W;
bool pic[52][52];
int main(int argc, char **argv) {
    cin >> H >> W;

    for(int i = 1; i <= H; ++i)
        for(int j = 1; j <= W; ++j) {
            char ch;
            cin >> ch;
            pic[i][j] = ch == '#';
        }
    
    bool res = true;
    for(int i = 1; i <= H; ++i)
        for(int j = 1; j <= W; ++j) {
            if(pic[i][j])
                if(!pic[i + 1][j] && !pic[i - 1][j] &&
                    !pic[i][j + 1] && !pic[i][j - 1]) {
                        res = false;
                        goto finish;
                    }
        }
finish:;

    cout << (res ? "Yes" : "No") << endl;
}

Submission Info

Judge Result