QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#291807 | #7179. Fischer's Chess Guessing Game | OAleksa | WA | 83ms | 3632kb | C++14 | 2.3kb | 2023-12-27 08:32:53 | 2023-12-27 08:32:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
vector<char> sv = {'K', 'Q', 'N', 'N', 'B', 'B', 'R', 'R'};
vector<string> perm;
int good(vector<char> ord) {
int x = -1, y = -1, z = -1, b = -1, a = -1;
for (int i = 0;i < 8;i++) {
if (ord[i] == 'K')
z = i;
else if (ord[i] == 'B') {
if (x == -1)
x = i;
else
y = i;
}
else if (ord[i] == 'R') {
if (a == -1)
a = i;
else
b = i;
}
}
return z < b && z > a && x % 2 != y % 2;
};
int diff(string a, string b) {
int r = 0;
for (int i = 0;i < 8;i++)
r += (a[i] == b[i]);
return r;
};
void resi(string ans, int g, vector<pair<string, int>> &pr) {
cout << ans << endl;
int r;
cin >> r;
if (r == 8 || g > 6)
return;
pr.push_back({ans, r});
vector<string> temp;
for (auto x : perm) {
int ok = 1;
for (auto u : pr)
ok &= (diff(u.f, x) == u.s);
if (ok)
temp.push_back(x);
}
int mn = 1e9;
for (auto u : temp) {
vector<int> cnt(10);
int mx = 0;
for (auto x : perm)
mx = max(mx, ++cnt[diff(u, x)]);
if (mx < mn) {
mn = mx;
ans = u;
}
}
resi(ans, g + 1, pr);
}
signed main() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
//freopen("newbarn.in", "r", stdin);
//freopen(newbarn.out", "w", stdout);
int tt = 1;
//cin >> tt;
while (tt--) {
vector<int> order(8);
iota(order.begin(), order.end(), 0);
map<string, int> bio;
do {
vector<char> t;
for (int i = 0;i < 8;i++)
t.push_back(sv[order[i]]);
if (good(t)) {
string s;
for (auto x : t)
s += x;
if (bio[s])
continue;
bio[s] = 1;
perm.push_back(s);
}
} while (next_permutation(order.begin(), order.end()));
int mx = 1e9;
string ans;
for (int i = 0;i < 960;i++) {
vector<int> cnt(10);
int l = 0;
for (int j = 0;j < 960;j++) {
if (i == j)
continue;
l = max(l, ++cnt[diff(perm[i], perm[j])]);
}
if (l < mx) {
ans = perm[i];
mx = l;
}
}
while (true) {
string s;
cin >> s;
if (s == "GAME") {
cin >> s;
vector<pair<string, int>> t;
resi(ans, 0, t);
}
else
break;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 18ms
memory: 3632kb
input:
GAME 1 2 4 2 3 6 8 END
output:
NRNBBKQR RQKBBNRN RQBBNNKR RKNQBNRB RKQBBRNN RKRBBQNN
result:
ok (c) correct after 1 tests, max moves 6 (1 test case)
Test #2:
score: -100
Wrong Answer
time: 83ms
memory: 3588kb
input:
GAME 1 2 4 2 3 6 8 GAME 2 3 0 4 2 8 GAME 3 2 4 3 2 3 8 GAME 4 1 2 1 2 8 GAME 5 1 2 2 1 1 8 GAME 6 1 1 3 2 5 8 GAME 7 1 4 2 2 8 GAME 8 2 3 2 3 8 GAME 9 1 4 3 2 1 8 GAME 10 1 2 2 4 1 8 GAME 11 1 3 2 3 0 8 GAME 12 2 3 3 1 2 8 GAME 13 0 4 1 3 8 GAME 14 0 6 4 4 8 GAME 15 0 4 1 3 6 8 GAME 16 0 2 3 3 8 GAM...
output:
NRNBBKQR RQKBBNRN RQBBNNKR RKNQBNRB RKQBBRNN RKRBBQNN NRNBBKQR NRBQNBKR RNQBBKRN RBNNBKRQ RKRBBNQN NRNBBKQR RQKBBNRN RQBBNNKR RNBBQKRN BRKBNNRQ RKRBBNNQ NRNBBKQR RQKNBBRN RNBQNBKR RBNNKRBQ RKRBQNBN NRNBBKQR RQKNBBRN RNBQNBKR RNQKBRNB BRKQNNRB RKRBNQBN NRNBBKQR RQKNBBRN RBBQNNKR RNBKNRQB RKBBRNNQ RKR...
result:
wrong answer (i) too many guesses in game 19, pos = (test case 19)