Submission #5993447

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iterator>
#include <numeric>
#include <bitset>
using namespace std;
typedef long long int ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))

int main() {
	int H, W;
	cin >> H >> W;
	vector<string> s(H);
	for (int i = 0; i < H; i++) {
		cin >> s[i];
	}

	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			if (s[i][j] == '#' && !(i - 1 >= 0 && s[i - 1][j] == '#'
				|| i + 1 < H && s[i + 1][j] == '#'
				|| j - 1 >= 0 && s[i][j - 1] == '#'
				|| j + 1 < W && s[i][j + 1] == '#')) {
				cout << "No" << endl;
				return 0;
			}
		}
	}
	cout << "Yes";
	return 0;
}

Submission Info

Judge Result