# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471765 | nickmet2004 | Xoractive (IZhO19_xoractive) | C++11 | 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 "interactive.h"
using namespace std;
map<int , int> Z;
vector<int> guess(int n){
int a = ask(1);
for(int i = 0; i < 7; ++i){
vector<int> x , y;
for(int k = 1; k < n; ++k){
if(k >> i & 1) x.emplace_back(k + 1) , y.emplace_back(k + 1);
}
}
vector<int> X = get_pairwise_xor(x);
y.emplace_back(1);
vector<int> Y = get_pairwise_xor(y);
map<int , int> A;
for(int x : X)A[x]--;
for(int x : Y)A[x]++;
for(auto x : A){
if(x.second>0)Z[x.first^a]+= 1<<i;
}
vector<int> ans;
ans.resize(n);
ans[0] = a;
for(auto x : Z)ans[Z.second]=Z.first;
return ans;
}