Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define cin(vec) for(auto& i : vec) cin >> i
- #define cin_2d(vec, n, m) for(int i=0; i<n; i++) for(int j=0; j<m && cin >> vec[i][j]; j++);
- #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
- #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++);
- #define matrix(grid, n, m) vector < vector <char> > grid(n, vector <char> (m));
- #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
- #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- #define fixed(n) cout << fixed << setprecision(n)
- #define Num_of_Digits(n) ((int)log10(n)+1)
- #define getline(s) getline(cin >> ws, s)
- #define TC int t; cin >> t; while(t--)
- #define rall(s) s.rbegin(), s.rend()
- #define all(s) s.begin(), s.end()
- #define sz(x) int(x.size())
- #define Pair pair <int, int>
- #define fi first
- #define se second
- #define pb(x) push_back(x)
- #define ll long long
- #define PI acos(-1)
- #define Mod 1'000'000'007
- #define INF 2'000'000'000
- #define EPS 1e-9
- void Code_Crush(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- #ifndef ONLINE_JUDGE // Anwar Rizk 🥇🖤
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- Time
- }
- bool check(vector < vector <char> >& m, char c){
- if(m[0][0] == c && m[0][1] == c && m[0][2] == c) return true;
- if(m[1][0] == c && m[1][1] == c && m[1][2] == c) return true;
- if(m[2][0] == c && m[2][1] == c && m[2][2] == c) return true;
- if(m[0][0] == c && m[1][0] == c && m[2][0] == c) return true;
- if(m[0][1] == c && m[1][1] == c && m[2][1] == c) return true;
- if(m[0][2] == c && m[1][2] == c && m[2][2] == c) return true;
- if(m[0][0] == c && m[1][1] == c && m[2][2] == c) return true;
- if(m[0][2] == c && m[1][1] == c && m[2][0] == c) return true;
- return false;
- }
- int main()
- { Code_Crush();
- TC {
- matrix(grid, 3, 3); cin_2d(grid, 3, 3);
- int x = 0, o = 0;
- for(int i = 0; i < 3; i++){
- for(int j = 0; j < 3; j++){
- if(grid[i][j] == 'X') x++;
- if(grid[i][j] == 'O') o++;
- }
- }
- if(o > x || abs(x - o) >= 2) cout << "no" << "\n";
- else if(check(grid, 'X') && check(grid, 'O'))
- cout << "no" << "\n";
- else if(check(grid, 'X') && !check(grid, 'O') && x == o + 1)
- cout << "yes" << "\n";
- else if(!check(grid, 'X') && check(grid, 'O') && x == o)
- cout << "yes" << "\n";
- else if(x == o || x == o + 1) cout << "yes" << "\n";
- else cout << "no" << "\n";
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment