# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387210 | Kalashnikov | Xoractive (IZhO19_xoractive) | C++17 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
#include <xoractive>
using namespace std;
vector<int> guess(int n) {
vector<int> a(n);
a[0] = ask(1);
map<int,int> ans;
for(int i = 0; (1 << i) <= n; i ++) {
vector<int> p;
for(int j = 2; j <= n; j ++) {
if(j & (1 << i)) {
p.push_back(j);
}
}
auto g1 = get_pairwise_xor(p);
p.push_back(1);
auto g2 = get_pairwise_xor(p);
map<int,int> mp;
for(auto to: g2) mp[to] ++;
for(auto to: g1) mp[to] --;
for(auto to: mp) {
if(to.S) {
ans[to.F^a[0]] |= (1 << i);
}
}
}
for(auto to: ans) {
a[to.S-1] = to.F;
}
return a;
}