Submission #62059425

---

Source Code Expand

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

using ll = long long;

#define rep(i, n) for(int i = 0; (i) < (int)(n); ++(i))
#define rep_r(i, n) for(int i = (int)(n) - 1; (i) >= 0; --(i))
#define all(x) begin(x), end(x)

int main() {
    // input
    int H, W;
    cin >> H >> W;
    vector<string> S(H);
    rep(i, H) cin >> S[i];

    // calc
    // 黒マスのx,yそれぞれの最小値と最大値を求める
    int min_x = W;
    int min_y = H;
    int max_x = 0;
    int max_y = 0;
    rep(y, H) {
        rep(x, W) {
            if(S[y][x] == '#') {
                min_x = min(x, min_x);
                min_y = min(y, min_y);
                max_x = max(x, max_x);
                max_y = max(y, max_y);
            }
        }
    }
    // (min_x, min_y)から(max_x, max_y)の長方形内に、.が無いことを確認する
    bool result = true;
    rep(y, H) {
        rep(x, W) {
            if(S[y][x] == '.') {
                if(min_x <= x && x <= max_x && min_y <= y && y <= max_y)
                    result = false;
            }
        }
    }

    // output
    if(result) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

Submission Info

Judge Result