This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "interactive.h"
#include <map>
using namespace std;
map<int, int> ra;
map<int, int> ask_compr(vector<int> pos) {
vector<int> ansv = get_pairwise_xor(pos);
map<int, int> ansmp;
for (auto x : ansv)
++ansmp[x];
return ansmp;
}
void get_bit(int n, int bt) {
vector<int> pos;
for (int i = 1; i <= n; ++i) {
if (i & bt)
pos.push_back(i);
}
map<int, int> mp0 = ask_compr(pos);
pos.push_back(n + 1);
map<int, int> mp1 = ask_compr(pos);
for (auto [x, cnt] : mp1) {
if (cnt > mp0[x]) {
ra[x] += bt;
}
}
}
vector<int> guess(int n) {
vector<int> ans(n);
ans[n - 1] = ask(n);
for (int bt = 1; bt + 1 < n; bt *= 2) {
get_bit(n - 1, bt);
}
for (auto [avl, i] : ra)
ans[i - 1] = avl ^ ans[n - 1];
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |