# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387151 | kevinxiehk | 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 "interactive.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> guess(int n) {
int ans[n];
ans[0] = ask(1);
vector<int> hm[7];
vector<int> hv[7];
set<int> tot;
for(int i = 0; i <= 6; i++) {
for(int j = 2; j <= n; j++) {
if(j & (1 << i)) hm[i].emplace_back(j);
}
if(hm[i].empty()) break;
vector<int> have = get_pairwise_xor(hm[i]);
hm[i].emlace_back(1);
vector<int> have2 = get_pairwise_xor(hm[i]);
int add = 0;
for(int j = 0; j < have.size(); j++) {
while(have[j] != have2[j + add]){
hv[i].emplace_back(have2[j + add] ^ ans[0]);
tot.insert(have2[j + add] ^ ans[0]);
add += 2;
}
}
}
for(auto x: tot) {
int id = 0;
for(int i = 0; i < 6; i++) {
for(auto y: hv[i]) {
if(x == y) {
id += (1 << i);
}
}
}
ans[id - 1] = x;
}
return ans;
}