Submission #435357

#	Time	Username	Problem	Language	Result	Execution time	Memory
435357		2qbingxuan	Xoractive (IZhO19_xoractive)	C++17	100 / 100	4 ms	336 KiB

Xoractive

#include "interactive.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(args...) qqbx(#args, args)
#define pary(args...) danb(#args, args)
template <typename ...T> void qqbx(const char *s, T ...args) {
    int cnt = sizeof...(T);
    if(!cnt) return std::cerr << "\033[1;32m() = ()\033\[0m\n", void();
    (std::cerr << "\033[1;32m(" << s << ") = (" , ... , (std::cerr << args << (--cnt ? ", " : ")\033[0m\n")));
}
template <typename T> void danb(const char *s, T L, T R) {
    std::cerr << "\033[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L) std::cerr << (f++ ? ", " : "") << *L;
    std::cerr << " ]\033[0m\n";
}
#else
#define debug(...) ((void)0)
#define pary(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
using namespace std;
 
vector<int> guess(int n) {
    int xn = ask(n);
    vector<int> ms[7][2];
    for (int b = 0; b < 7; b++) {
        vector<int> v;
        for (int i = 1; i < n; i++) if (i >> b & 1) v.push_back(i);
        if (v.empty()) {
            continue;
        }
        auto A = get_pairwise_xor(v);
        v.push_back(n);
        auto B = get_pairwise_xor(v);
        sort(all(A)), sort(all(B));
        ms[b][1].resize(B.size() - A.size());
        set_difference(all(B), all(A), ms[b][1].begin());
        ms[b][1].erase(ms[b][1].begin()); // xn ^ xn == 0
        for (int &x: ms[b][1]) x ^= xn;
        sort(all(ms[b][1])), ms[b][1].erase(unique(all(ms[b][1])), ms[b][1].end());
    }
    for (int b = 0; b < 7; b++)
        debug(b), pary(all(ms[b][1]));
    vector<int> tot;
    for (int b = 0; b < 7; b++)
        for (int x: ms[b][1])
            tot.push_back(x);
    sort(all(tot)), tot.erase(unique(all(tot)), tot.end());
    for (int b = 0; b < 7; b++)
        set_difference(all(tot), all(ms[b][1]), back_inserter(ms[b][0]));
 
    pary(all(tot));
    vector<int> ans;
    for (int i = 1; i < n; i++) {
        vector<int> cur = tot;
        for (int b = 0; b < 7; b++) {
            vector<int> tmp;
            set_intersection(all(cur), all(ms[b][i >> b & 1]), back_inserter(tmp));
            cur = tmp;
        }
        pary(all(cur));
        assert (cur.size() == 1);
        ans.push_back(cur[0]);
    }
    ans.push_back(xn);
    return ans;
}

• Subtask 1: 6 / 6
• Subtask 2: 94 / 94