QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#33779 | #4234. Tic Tac Toe Counting | 4fecta# | TL | 2ms | 3732kb | C++ | 3.3kb | 2022-06-05 05:23:32 | 2022-06-05 05:23:33 |
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;
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) {
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) {wx++; return;}
if (oko) {wo++; return;}
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);
s[i] = '.';
}
} else {
for (int i = 0; i < 9; i++) {
if (s[i] != '.') continue;
s[i] = 'O';
rec(s);
s[i] = '.';
}
}
}
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;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3732kb
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: -100
Time Limit Exceeded
input:
100000 ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......... ......