BOJ 13227 - TicTacToe [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
using namespace std;
 
bool solve(void) {
  vector<vector<char>> v(3, vector<char>(3));
  for (int i=0; i<3; i++) for (int j=0; j<3; j++) cin >> v[i][j];
 
  for (int i=0; i<3; i++) {
    if (v[i][0] == v[i][1] && v[i][1] == v[i][2] && v[i][0] != '.') return true;
    if (v[0][i] == v[1][i] && v[1][i] == v[2][i] && v[0][i] != '.') return true;
  }
  if (v[0][0] == v[1][1] && v[1][1] == v[2][2] && v[0][0] != '.') return true;
  if (v[0][2] == v[1][1] && v[1][1] == v[2][0] && v[0][2] != '.') return true;
  return false;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  cout << (solve() ? "YES" : "NO");
  return 0;
}