# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471672 | 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;
vector<int> geuess(int n){
int a = ask(1);
vector<int> X , Y;
map<int , int> Z;
vector<int> ans;
ans.resize(n);
for(int i = 0; i< 7; ++i){
for(int k = 2; k <= n; ++k){
if(k>>i&1)X.emplace_back(k);
}
Y = X;
Y.emplace_back(1);
X = get_pairwise_xor(X);
Y = get_pairwise_xor(Y);
map<int , int> A;
for(int x : X) A[x]=1;
for(int x : Y){
if(!A[x] && x) Z[x] += 1 << i;
}
}
for(auto x : Z) ans[x.second] = x.first;
return ans;
}