QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#491877	#7179. Fischer's Chess Guessing Game	no_RED_no_DEAD	TL	587ms	3764kb	C++20	3.8kb	2024-07-26 00:25:14	2024-07-26 00:25:15

Judging History

你现在查看的是最新测评结果

[2024-07-26 00:25:15]
评测

测评结果：TL
用时：587ms
内存：3764kb

查看

[2024-07-26 00:25:14]
提交

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];
ll T[] = {(ll)100, (ll)300, (ll)1500, (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) {
    return x >= 4;
}

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)v.size()); j ++) {
                string cur = v[rand(0, v.size() - 1)]; tmp = 0;
                for (auto y: res) tmp += check(cal(cur, y));
                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 = 2; i <= 3; i ++) {
            ll cnt = 0, tmp = 0;
            for (int j = 0; j < min(T[i], (ll)v.size()); j ++) {
                string cur = v[rand(0, v.size() - 1)];
                set<ll> s; for (auto y: res) s.insert(cal(cur, y));
                if (s.size() > cnt) {cnt = s.size(); 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 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[4] = 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() {    
    // freopen("a.inp", "r", stdin);
    // freopen("a.out", "w", stdout);

    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);
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 4ms

memory: 3764kb

input:

GAME 1
1
1
3
2
0
8
END

output:

RNBKNBQR
BRNNKQRB
QNRBKRBN
BBRQKNNR
BBNNQRKR
RKRBBQNN

result:

ok (c) correct after 1 tests, max moves 6 (1 test case)

Test #2:

score: 0

Accepted

time: 587ms

memory: 3740kb

input:

GAME 1
3
4
1
2
3
8
GAME 2
1
1
2
3
0
8
GAME 3
1
1
4
0
0
8
GAME 4
3
4
5
2
1
8
GAME 5
1
2
2
3
2
8
GAME 6
1
1
0
2
0
8
GAME 7
2
1
0
6
0
8
GAME 8
2
4
2
2
4
8
GAME 9
3
4
2
4
2
8
GAME 10
2
1
1
6
0
8
GAME 11
2
3
2
1
0
8
GAME 12
3
1
3
2
1
8
GAME 13
1
1
0
2
0
8
GAME 14
3
3
4
2
0
8
GAME 15
2
4
3
8
GAME 16
2
2
0...

output:

RNQKBBNR
RNQBBKNR
BBQRNKNR
NQRNBBKR
NRKBBRNQ
RKRBBQNN
RQBNKBNR
BRQKNNRB
NRNBBQKR
RKNBNQBR
BBNNQRKR
RKRBBNQN
RNBKNBQR
QRNNBKRB
NQRBBNKR
NRKNQBBR
BBNNQRKR
RKRBBNNQ
RBQNKNBR
RNQBKNBR
RKNBRNBQ
RKNNBRQB
BBNNQRKR
RKRBQNBN
RBBQKNNR
BRKNNQRB
NRKBRNBQ
NQRKNRBB
NRKQNBBR
RKRBNQBN
RNNKBBQR
BRQNNKRB
NBBNRQKR
QRK...

result:

ok (c) correct after 96 tests, max moves 6 (96 test cases)

Test #3:

score: -100

Time Limit Exceeded

input:

GAME 1
6
5
0
1
1
8
GAME 2
2
8
GAME 3
2
3
4
4
2
8
GAME 4
4
3
2
8
GAME 5
2
4
2
4
3
8
GAME 6
3
2
3
8
GAME 7
3
4
3
3
2
8
GAME 8
3
3
5
0
2
8
GAME 9
5
4
3
3
3
8
GAME 10
6
4
3
3
2
8
GAME 11
4
4
2
2
2
8
GAME 12
5
6
2
1
4
8
GAME 13
1
1
0
2
1
8
GAME 14
1
3
4
1
1
8
GAME 15
2
4
2
5
1
8
GAME 16
1
0
2
0
2
8
GAME ...

output:

RBQKBNNR
RNQKBBNR
QBRNKRBN
QRKBNRBN
BBNNQRKR
RKQBBNNR
RNQKNBBR
RKNBBQNR
RQBNKBNR
RBKNBQNR
QRNBBKNR
RKRBBQNN
BBNNQRKR
RKNBBNQR
RBQKBNNR
RBKQBNNR
RBBKRNQN
RKQBNNBR
RNBKNBQR
RBQKNNBR
QBRKBNNR
RBNNKQBR
BBNNQRKR
RKNBQNBR
RNQNKBBR
RNBNKBQR
NRNKQBBR
RKNBNQBR
RNNKQBBR
RNNKBBQR
NRNQBBKR
RBNNBKRQ
BNQRKBRN
RKQ...