Submission #18989583

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<vector<ll>> cells(19, vector<ll>(19, -1));
vector<pair<ll, ll>> go(5);

bool is5(ll turn) {
  bool ans = true;
  for (ll k = 0; k < 5; k++) {
    ll gi = go[k].first, gj = go[k].second;
    if (0 <= gi && gi < 19 && 0 <= gj && gj < 19) {
      if (cells[gi][gj] != turn) ans = false;
    } else {
      ans = false;
    }
  }
  return ans;
}

bool win(ll turn) {
  bool ans = false;
  for (ll i = 0; i < 19; i++) {
    for (ll j = 0; j < 19; j++) {
      for (ll k = 0; k < 5; k++) go[k] = {i + k, j};
      ans = (ans || is5(turn));
      for (ll k = 0; k < 5; k++) go[k] = {i, j + k};
      ans = (ans || is5(turn));
      for (ll k = 0; k < 5; k++) go[k] = {i + k, j + k};
      ans = (ans || is5(turn));
      for (ll k = 0; k < 5; k++) go[k] = {i + k, j - k};
      ans = (ans || is5(turn));
    }
  }
  return ans;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  
  ll cnt = 0;
  for (ll i = 0; i < 19; i++) {
    string S; cin >> S;
    for (ll j = 0; j < 19; j++) {
      if (S[j] == 'o') {
        cells[i][j] = 0;
        cnt++;
      } else if (S[j] == 'x') {
        cells[i][j] = 1;
        cnt--;
      }
    }
  }
  if (cnt > 1 || cnt < 0) {
    cout << "NO" << '\n';
    return 0;
  }

  if (win(0) && win(1)) {
    cout << "NO" << '\n';
    return 0;
  }
  if (win(0) && cnt == 0) {
    cout << "NO" << '\n';
    return 0;
  }
  if (win(1) && cnt == 1) {
    cout << "NO" << '\n';
    return 0;
  }

  vector<ll> wins(2, 0);
  for (ll i = 0; i < 19; i++) {
    for (ll j = 0; j < 19; j++) {
      ll old = cells[i][j];
      cells[i][j] = -1;
      if (!win(0) && !win(1)) {
        cout << "YES" << '\n';
        return 0;
      }
      cells[i][j] = old;
    }
  }

  cout << "NO" << '\n';
  return 0;
}

Submission Info

Judge Result