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 ,Y;
y.emplace_back(1);
X = get_pairwise_xor(x);
Y = get_pairwise_xor(y);
set<int> s;
for(int x : X) if(x) s.insert(x);
for(int x : Y) if(x && s.find(x) == s.end()) Z[x ^ a] += 1 << i;
}
vector<int> ans;
ans.resize(n);
for(auto x : Z) ans[x.second] = x.first;
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |