# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784730 | Soumya1 | Xoractive (IZhO19_xoractive) | C++17 | 4 ms | 456 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;
int a0;
vector<int> get_values(vector<int> v) {
int has = -1;
for (int i = 0; i < v.size(); i++) {
if (v[i] == 1) has = i;
}
if (has != -1) v.erase(v.begin() + has);
auto v1 = get_pairwise_xor(v);
v.push_back(1);
auto v2 = get_pairwise_xor(v);
vector<int> final;
multiset<int> s;
for (int i : v2) s.insert(i);
for (int i : v1) s.erase(s.find(i));
s.erase(s.find(0));
set<int> ss;
for (int i : s) ss.insert(i);
for (int i : ss) final.push_back(i ^ a0);
if (has != -1) final.push_back(a0);
sort(final.begin(), final.end());
return final;
}
vector<int> guess(int n) {
a0 = ask(1);
vector<int> ans(n);
map<int, int> pos;
for (int bit = 0; bit < 7; bit++) {
vector<int> p;
for (int i = 1; i <= n; i++) {
if (i >> bit & 1) p.push_back(i);
}
if (p.empty()) continue;
p = get_values(p);
for (int i : p) pos[i] |= (1 << bit);
}
for (auto [x, y] : pos) {
ans[y - 1] = x;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |