Submission #299195

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#define FOR(x, to) for (int x = 0; x < to; x++)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

string s;
int f[15][15];
int cnt;

int mi[] = {1, 0, -1, 0};
int mj[] = {0, 1,  0,-1};

void dfs(int i, int j, int id) {
	f[i][j] = id;
	for (int k = 0; k < 4; k++) {
		int ni = i + mi[k];
		int nj = j + mj[k];
		if (ni < 0 || ni >= 10 || nj < 0 || nj >= 10) continue;
		if (f[ni][nj] == -1) dfs(ni, nj, id);
	}
}

int main() {
	FOR(i, 10) {
		cin >> s;
		FOR(j, s.size()) {
			if (s[j] == 'x') f[i][j] = 0;
			else f[i][j] = -1;
		}
	}
	FOR(i, 10) {
		FOR(j, 10) {
			if (f[i][j] == -1) dfs(i, j, ++cnt);
		}
	}
	//FOR(i, 10) {
	//	FOR(j, 10) {
	//		cout << f[i][j] << " ";
	//	}
	//	cout << endl;
	//}
	if (cnt > 4) {
		cout << "NO" << endl;
	} else {
		FOR(i, 10) {
			FOR(j, 10) {
				if (f[i][j] != 0) continue;
				int bit[5] = {0};
				FOR(k, 4) {
					int ni = i + mi[k];
					int nj = j + mj[k];
					if (ni < 0 || ni >= 10 || nj < 0 || nj >= 10) continue;
					if (f[ni][nj] == 0) continue;
					bit[f[ni][nj]] = 1;
				}
				int sum = accumulate(bit, bit + 5, 0);
				if (sum == cnt) {
					cout << "YES" << endl;
					return 0;
				}
			}
		}
		cout << "NO" << endl;
	}
	return 0;
}

Submission Info

Judge Result