-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathB_Rudolph_and_Tic_Tac_Toe.cpp
171 lines (144 loc) · 5 KB
/
B_Rudolph_and_Tic_Tac_Toe.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include <bits/stdc++.h>
#include <unordered_set>
#include <chrono>
#define ll long long
#define int long long
#define MOD1 998244353
#define INF 1e18
#define endl "\n"
#define vi vector<int>
#define pb push_back
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define ff first
#define ss second
#define ss second
#define PI 3.141592653589793238462
#define set_bits __builtin_popcountll
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define f(i,a,b) for(ll i=a;i<b;i++)
#define amax(a) *max_element(a, a + n)
#define amin(a) *min_element(a, a + n)
#define vmax(a) *max_element(a.begin(), a.end())
#define vmin(a) *min_element(a.begin(), a.end())
using namespace std;
#define watch(x) cout << (#x) << " = " << (x) << endl
const int MOD = 1e9 + 7;
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll mult(ll x, ll y) {ll res = x * y;return (res >= MOD ? res % MOD : res);}
ll factorial(ll v){ll ans=1;for(int i=2;i<=v;i++){ans*=i;ans%=MOD;}return ans;}
ll power(ll a, ll n){ll res = 1;while(n){if(n%2 == 1){res = (res * a)%MOD;n--;}else{a = (a * a)%MOD;n = n/2;}}return res;}
vector<ll> sieve(int n) {int*arr = new int[n + 1](); vector<ll> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}
void vin( vector<int> &v , int n ){for (int i = 0; i < n; i++){int x ;cin >> x; v.push_back(x);}}
void vout(vector<int> &v){for (int i = 0; i < v.size(); i++){cout << v[i] << " " ;}cout << endl;}
ll highestPowerof2(ll n){ ll p = (ll)log2(n); return (ll)pow(2, p);}
bool isPowerOfTwo(int n){ if(n==0) return false; return (ceil(log2(n)) == floor(log2(n)));}
bool chkprime(int n){ for(int i = 2 ; i*i <= n ; i++){ if( n % i == 0) return false;} return true; }
string to_binary(int n) { string s = ""; for (int i = 31; i >= 0; i--) { int k = n >> i; if (k & 1) s = s + "1";else s = s + "0";}return s ; }
static void removeTrailingCharacters(std::string &str, const char charToRemove) {str.erase (str.find_last_not_of(charToRemove) + 1, std::string::npos );}
static void removeLeadingCharacters(std::string &str, const char charToRemove) {str.erase(0, std::min(str.find_first_not_of(charToRemove), str.size() - 1));}
long long lcm(int a, int b){ return (a / gcd(a, b)) * b;}
int digits_count(int n){int d=0;while(n != 0){d++;n /=10;}return d;}
vector<string> to_token(string s){vector<string> tokens; stringstream chk1(s); string tmp; while(getline(chk1, tmp, ' ')){ tokens.push_back(tmp); } return tokens;}
vector<int> findFactors(int n){vector<int> v;for (int i=1; i<=sqrt(n); i++){if (n%i == 0){if (n/i == i)v.pb(i);else {v.pb(i);v.pb(n/i);}}}sort(all(v));return v;}
//SPEED IS NOT THE CRITERIA CMP KILLS, KP BYS
//CHECK THE EDGE CASES 10 TIMES
bool check(vector<vector<char>> &v, char key){
for (int i = 0; i < 3; i++)
{
int cnt = 0;
for (int j = 0; j < 3; j++)
{
if(v[i][j] == key)
cnt++;
}
if(cnt == 3)
return true;
}
for (int i = 0; i < 3; i++)
{
int cnt = 0;
for (int j = 0; j < 3; j++)
{
if(v[j][i] == key)
cnt++;
}
if(cnt == 3)
return true;
}
int cnt = 0;
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if(v[i][j] == key && i == j)
cnt++;
}
}
if(cnt == 3)
return true;
cnt = 0;
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if(v[i][j] == key && i == 0 && j == 2)
cnt++;
if(v[i][j] == key && i == 1 && j == 1)
cnt++;
if(v[i][j] == key && i == 2 && j == 0)
cnt++;
}
}
if(cnt == 3)
return true;
return false;
}
void solve() {
vector<vector<char>> v;
for (int i = 0; i < 3; i++)
{
vector<char> tmp;
for (int j = 0; j < 3; j++)
{
char ch;
cin >> ch;
tmp.pb(ch);
}
v.pb(tmp);
}
if(check(v, 'X')){
cout << 'X' << endl;
}
else if(check(v, 'O')){
cout << 'O' << endl;
}
else if(check(v, '+')){
cout << '+' << endl;
} else {
cout << "DRAW" << endl;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
auto start = chrono::steady_clock::now();
// Insert the code that will be timed
ll t = 1 ;
cin >> t ;
int ii;
for ( ii = 1; ii <= t; ii++) {
// cout << "Case #" << i <<": ";
solve();
}
auto end = chrono::steady_clock::now();
auto diff = end - start;
cerr << chrono::duration <double, nano> (diff).count() << " ns" << endl;
return 0;
}