Anwar_Rizk

Untitled

Aug 7th, 2021 (edited)
92
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.63 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define cin(vec) for(auto& i : vec) cin >> i
  4. #define cin_2d(vec, n, m) for(int i=0; i<n; i++) for(int j=0; j<m && cin >> vec[i][j]; j++);
  5. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  6. #define cout_2d(vec, r, c) for(int i=0; i<r; i++, cout << "\n") for(int j=0; j<c && cout << vec[i][j]; j++);
  7. #define matrix(grid, n, m) vector < vector <char> > grid(n, vector <char> (m));
  8. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  9. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  10. #define fixed(n) cout << fixed << setprecision(n)
  11. #define Num_of_Digits(n) ((int)log10(n)+1)
  12. #define getline(s) getline(cin >> ws, s)
  13. #define TC int t; cin >> t; while(t--)
  14. #define rall(s) s.rbegin(), s.rend()
  15. #define all(s) s.begin(), s.end()
  16. #define sz(x) int(x.size())
  17. #define Pair pair <int, int>
  18. #define fi first
  19. #define se second
  20. #define pb(x) push_back(x)
  21. #define ll long long
  22. #define PI acos(-1)
  23. #define Mod 1'000'000'007
  24. #define INF 2'000'000'000
  25. #define EPS 1e-9
  26.  
  27. void Code_Crush(){
  28.   ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  29.   #ifndef ONLINE_JUDGE    // Anwar Rizk 🥇🖤
  30.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  31.   #endif
  32.   Time
  33. }
  34.  
  35. bool check(vector < vector <char> >& m, char c){
  36.   if(m[0][0] == c && m[0][1] == c && m[0][2] == c)   return true;
  37.   if(m[1][0] == c && m[1][1] == c && m[1][2] == c)   return true;
  38.   if(m[2][0] == c && m[2][1] == c && m[2][2] == c)   return true;
  39.   if(m[0][0] == c && m[1][0] == c && m[2][0] == c)   return true;
  40.   if(m[0][1] == c && m[1][1] == c && m[2][1] == c)   return true;
  41.   if(m[0][2] == c && m[1][2] == c && m[2][2] == c)   return true;
  42.   if(m[0][0] == c && m[1][1] == c && m[2][2] == c)   return true;
  43.   if(m[0][2] == c && m[1][1] == c && m[2][0] == c)   return true;
  44.   return false;
  45. }
  46.  
  47. int main()
  48. {   Code_Crush();
  49.  
  50.     TC {
  51.       matrix(grid, 3, 3);                  cin_2d(grid, 3, 3);
  52.       int x = 0, o = 0;
  53.       for(int i = 0; i < 3; i++){
  54.         for(int j = 0; j < 3; j++){
  55.           if(grid[i][j] == 'X') x++;
  56.           if(grid[i][j] == 'O') o++;
  57.         }
  58.       }
  59.       if(o > x || abs(x - o) >= 2)  cout << "no" << "\n";
  60.       else if(check(grid, 'X') && check(grid, 'O'))
  61.         cout << "no" << "\n";
  62.       else if(check(grid, 'X') && !check(grid, 'O') && x == o + 1)
  63.         cout << "yes" << "\n";
  64.       else if(!check(grid, 'X') && check(grid, 'O') && x == o)
  65.         cout << "yes" << "\n";
  66.       else if(x == o || x == o + 1) cout << "yes" << "\n";
  67.       else cout << "no" << "\n";
  68.     }
  69.  
  70.   return 0;
  71. }
Add Comment
Please, Sign In to add comment