QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#493026 | #7179. Fischer's Chess Guessing Game | no_RED_no_DEAD | TL | 33ms | 3984kb | C++20 | 4.0kb | 2024-07-26 18:43:52 | 2024-07-26 18:43:52 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e6 + 1;
const ll M = 1e9 + 7;
mt19937_64 rng(static_cast<ll>(std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::high_resolution_clock::now().time_since_epoch()).count()));
ll rand(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
string P = "BRKBNQRN";
string Q = "KNNBBRRQ";
string S[5] = {"RKNBBQNR"};
ll T[] = {(ll)0, (ll)300, (ll)15000, (ll)10000};
vector<string> v, res;
ll val[N];
ll cal(string &s, string &t) {
ll res = 0;
for (int i = 0; i <= 7; i ++)
if (s[i] == t[i]) res ++;
return res;
}
ll check(ll x, string &s) {
ll cnt = 0;
for (int i = 0; i <= 7; i ++) {
ll tmp = 0;
for (int j = 0; j < x; j ++)
tmp += (S[j][i] == s[i]);
cnt += tmp * 1e9;
}
return cnt;
}
void doTest(ll testID) {
while (true) {
bool nxt = 0;
string tmp; cin >> tmp;
if (tmp == "END") return;
cin >> tmp;
res.clear();
for (auto x: v) res.push_back(x);
/* BEGIN MESS 1*/
for (int i = 0; i <= -1; i ++) {
ll cnt = -1, tmp = 0;
for (int j = 0; j < min(T[i], (ll)res.size()); j ++) {
string cur = res[j]; tmp = 0;
for (auto y: res) tmp += check(i, cur);
if (tmp > cnt) {cnt = tmp; S[i] = cur;}
}
cout << S[i] << endl;
cin >> val[i]; if (val[i] == 8) {nxt = 1; break;}
vector<string> newRes;
for (auto x: res) if (cal(x, S[i]) == val[i]) newRes.push_back(x);
res = newRes;
// cout << "Debug: " << res.size() << endl;
}
if (nxt) continue;
/* BEGIN MESS 2*/
for (int i = 0; i <= 3; i ++) {
ll cnt = 1e18, tmp = 0;
for (int j = 0; j < v.size(); j ++) {
string cur = v[j];
map<ll, ll> m; for (auto y: res) m[cal(cur, y)] ++;
tmp = 0; for (auto [l, x]: m) tmp += x * log(x) * log(x);
if (tmp < cnt) {cnt = tmp; S[i] = cur;}
}
// cout << "Debug: " << i << ' ' << S[i] << endl;
cout << S[i] << endl;
cin >> val[i]; if (val[i] == 8) {nxt = 1; break;}
vector<string> newRes;
for (auto x: res) if (cal(x, S[i]) == val[i]) newRes.push_back(x);
res = newRes;
// cout << "Debug: " << res.size() << endl;
}
if (nxt) continue;
/* BEGIN MESS 3*/
for (int i = 4; i <= 4; i ++) {
ll cnt = 0;
for (auto x: v) {
set<ll> s; for (auto y: res) s.insert(cal(x, y));
if (s.size() > cnt) {cnt = s.size(); S[i] = x;}
}
cout << S[i] << endl;
cin >> val[i]; if (val[i] == 8) {nxt = 1; break;}
vector<string> newRes;
for (auto x: res) if (cal(x, S[i]) == val[i]) newRes.push_back(x);
res = newRes;
}
if (nxt) break;
/*BEGIN MESS 4*/
// cout << "??? " << res.size() << endl;
cout << res[0] << endl;
cin >> val[5];
}
}
signed main() {
set<string> s;
string T = "KNNBBRRQ";
sort(T.begin(), T.end());
do {
vector<ll> b, r, k;
for (int i = 0; i <= 7; i ++) if (T[i] == 'B') b.push_back(i);
for (int i = 0; i <= 7; i ++) if (T[i] == 'K') k.push_back(i);
for (int i = 0; i <= 7; i ++) if (T[i] == 'R') r.push_back(i);
if ((b[1] - b[0]) % 2 == 0) continue;
if (r[0] > k[0] || r[1] < k[0]) continue;
s.insert(T);
} while(next_permutation(T.begin(), T.end()));
for (auto x: s) v.push_back(x);
ios_base::sync_with_stdio(0); cin.tie(0);
int test = 1;
// cin >> test;
for (int _ = 1; _ <= test; _ ++) doTest(test);
}
详细
Test #1:
score: 100
Accepted
time: 33ms
memory: 3984kb
input:
GAME 1 2 3 2 0 0 8 END
output:
RBBNNQKR RKNBQNBR NRNBBKQR BBNRKNQR BBNNQRKR RKRBBQNN
result:
ok (c) correct after 1 tests, max moves 6 (1 test case)
Test #2:
score: -100
Time Limit Exceeded
input:
GAME 1 2 3 2 0 0 8 GAME 2 1 4 1 2 1 8 GAME 3 1 3 6 0 0 8 GAME 4 1 3 3 0 1 8 GAME 5 3 3 3 0 0 8 GAME 6 2 5 4 0 0 8 GAME 7 1 3 4 2 0 8 GAME 8 2 2 5 1 2 8 GAME 9 2 2 4 2 0 8 GAME 10 1 2 1 1 0 8 GAME 11 3 3 4 1 1 8 GAME 12 2 3 2 2 2 8 GAME 13 2 3 0 6 0 8 GAME 14 2 4 6 2 2 8 GAME 15 3 4 0 1 1 8 GAME 16 2...
output:
RBBNNQKR RKNBQNBR NRNBBKQR BBNRKNQR BBNNQRKR RKRBBQNN RBBNNQKR RNQBBKRN BNRQNKRB BNRKQBRN BBNNRKQR RKRBBNQN RBBNNQKR RNQBBKRN RKNBBRNQ BBNNQRKR BBNNQRKR RKRBBNNQ RBBNNQKR RNQBBKRN RKNBBRNQ BBNNRKQR BBNNQRKR RKRBQNBN RBBNNQKR RKBNQBRN RKBQNRNB BBNNQRKR BBNNRKQR RKRBNQBN RBBNNQKR RKNBQNBR BRKBNNRQ BBN...