QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #33780 | #4234. Tic Tac Toe Counting | 4fecta# | WA | 79ms | 4608kb | C++ | 3.6kb | 2022-06-05 05:33:10 | 2022-06-05 05:33:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
const int MN = 15;
int t, wx, wo;
map<string, int> mpx, mpo;
bool valid(string s) {
int cx = 0, co = 0;
for (char c : s) if (c == 'X') cx++;
for (char c : s) if (c == 'O') co++;
if (cx != co && cx != co + 1) return false;
bool okx = 0, oko = 0;
if (s[0] == 'O' && s[1] == 'O' && s[2] == 'O') oko = 1;
if (s[3] == 'O' && s[4] == 'O' && s[5] == 'O') oko = 1;
if (s[6] == 'O' && s[7] == 'O' && s[8] == 'O') oko = 1;
if (s[0] == 'O' && s[3] == 'O' && s[6] == 'O') oko = 1;
if (s[1] == 'O' && s[4] == 'O' && s[7] == 'O') oko = 1;
if (s[2] == 'O' && s[5] == 'O' && s[8] == 'O') oko = 1;
if (s[0] == 'O' && s[4] == 'O' && s[8] == 'O') oko = 1;
if (s[2] == 'O' && s[4] == 'O' && s[6] == 'O') oko = 1;
if (s[0] == 'X' && s[1] == 'X' && s[2] == 'X') okx = 1;
if (s[3] == 'X' && s[4] == 'X' && s[5] == 'X') okx = 1;
if (s[6] == 'X' && s[7] == 'X' && s[8] == 'X') okx = 1;
if (s[0] == 'X' && s[3] == 'X' && s[6] == 'X') okx = 1;
if (s[1] == 'X' && s[4] == 'X' && s[7] == 'X') okx = 1;
if (s[2] == 'X' && s[5] == 'X' && s[8] == 'X') okx = 1;
if (s[0] == 'X' && s[4] == 'X' && s[8] == 'X') okx = 1;
if (s[2] == 'X' && s[4] == 'X' && s[6] == 'X') okx = 1;
return !okx || !oko;
}
void rec(string s) {
if (mpx.count(s)) {
wx += mpx[s];
wo += mpo[s];
return;
}
bool okx = 0, oko = 0;
if (s[0] == 'O' && s[1] == 'O' && s[2] == 'O') oko = 1;
if (s[3] == 'O' && s[4] == 'O' && s[5] == 'O') oko = 1;
if (s[6] == 'O' && s[7] == 'O' && s[8] == 'O') oko = 1;
if (s[0] == 'O' && s[3] == 'O' && s[6] == 'O') oko = 1;
if (s[1] == 'O' && s[4] == 'O' && s[7] == 'O') oko = 1;
if (s[2] == 'O' && s[5] == 'O' && s[8] == 'O') oko = 1;
if (s[0] == 'O' && s[4] == 'O' && s[8] == 'O') oko = 1;
if (s[2] == 'O' && s[4] == 'O' && s[6] == 'O') oko = 1;
if (s[0] == 'X' && s[1] == 'X' && s[2] == 'X') okx = 1;
if (s[3] == 'X' && s[4] == 'X' && s[5] == 'X') okx = 1;
if (s[6] == 'X' && s[7] == 'X' && s[8] == 'X') okx = 1;
if (s[0] == 'X' && s[3] == 'X' && s[6] == 'X') okx = 1;
if (s[1] == 'X' && s[4] == 'X' && s[7] == 'X') okx = 1;
if (s[2] == 'X' && s[5] == 'X' && s[8] == 'X') okx = 1;
if (s[0] == 'X' && s[4] == 'X' && s[8] == 'X') okx = 1;
if (s[2] == 'X' && s[4] == 'X' && s[6] == 'X') okx = 1;
if (okx) {mpx[s] = 1; mpo[s] = 0; wx++; return;}
if (oko) {mpx[s] = 0; mpo[s] = 1; wo++; return;}
int lx = 0, lo = 0;
int cx = 0, co = 0;
for (char c : s) if (c == 'X') cx++;
for (char c : s) if (c == 'O') co++;
if (cx == co) {
for (int i = 0; i < 9; i++) {
if (s[i] != '.') continue;
s[i] = 'X';
rec(s);
lx += mpx[s];
lo += mpo[s];
s[i] = '.';
}
} else {
for (int i = 0; i < 9; i++) {
if (s[i] != '.') continue;
s[i] = 'O';
rec(s);
lx += mpx[s];
lo += mpo[s];
s[i] = '.';
}
}
mpx[s] = lx;
mpo[s] = lo;
}
int32_t main() {
boost();
cin >> t;
while (t--) {
string s;
cin >> s;
wx = wo = 0;
if (!valid(s)) {printf("-1 -1\n"); continue;}
rec(s);
printf("%lld %lld\n", wx, wo);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 3728kb
input:
4 XX..O.... X...OX... OOOX.X.X. OOOXXX...
output:
191 194 232 200 0 1 -1 -1
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 79ms
memory: 4548kb
input:
100000 ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......
output:
131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 131184 77904 1...
result:
ok 100000 lines
Test #3:
score: -100
Wrong Answer
time: 52ms
memory: 4608kb
input:
100000 ......... X........ O........ .X....... XX....... OX....... .O....... XO....... OO....... ..X...... X.X...... O.X...... .XX...... XXX...... OXX...... .OX...... XOX...... OOX...... ..O...... X.O...... O.O...... .XO...... XXO...... OXO...... .OO...... XOO...... OOO...... ...X..... X..X..... O.....
output:
131184 77904 14652 7896 -1 -1 14232 10176 -1 -1 1798 1276 -1 -1 2048 756 -1 -1 14652 7896 -1 -1 1832 1132 -1 -1 -1 -1 220 248 2048 756 268 144 -1 -1 -1 -1 1832 1132 -1 -1 1798 1276 220 248 -1 -1 -1 -1 -1 -1 -1 -1 14232 10176 -1 -1 1798 1276 -1 -1 -1 -1 264 188 1868 1080 239 126 -1 -1 -1 -1 -1 -1 312...
result:
wrong answer 882nd lines differ - expected: '-1 -1', found: '1 0'