| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 154984 | Pankin | Xoractive (IZhO19_xoractive) | C++14 | 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"
using namespace std;
vector<int> a;
set<int> getMn(set<int> ind) {
vector<int> pos;
for (auto i = ind.begin(); i != ind.end(); i++)
pos.pb(*i);
pos.pb(1);
vector<int> px1 = get_pairwise_xor(pos);
pos.pop_back();
vector<int> px2 = get_pairwise_xor(pos);
set<int> ans;
multiset<int> temp;
for (int i = 0; i < px1.size(); i++)
temp.insert(px1[i]);
for (int i = 0; i < px2.size(); i++)
temp.erase(temp.find(px2[i]));
for (auto i = temp.begin(); i != temp.end(); i++)
ans.insert(*i ^ a[1]);
ans.erase(a[1]);
return ans;
}
vector<int> guess(int n) {
a.resize(n + 1);
set<int> all;
a[1] = ask(1);
vector< vector< set<int> > > mn(7, vector< set<int> >(2)), ind(7, vector< set<int> >(2));
for (int i = 2; i <= n; i++) {
for (int j = 6; j >= 0; j--) {
ind[j][(i>>j)%2].pb(i);
}
}
for (int j = 6; j >= 0; j--) {
mn[j][1] = getMn(ind[j][1]);
for (auto i = mn[j][1].begin(); i != mn[j][1].end(); i++)
all.insert(*i);
}
for (int j = 6; j >= 0; j--) {
mn[j][0] = all;
for (auto i = mn[j][1].begin(); i != mn[j][1].end(); i++)
mn[j][0].erase(*i);
}
for (int i = 2; i <= n; i++) {
set<int> cur = all;
for (int j = 6; j >= 0; j--) {
for (auto it = all.begin(); it != all.end(); it++) {
if (mn[j][(i>>j)%2].find(*it) == mn[j][(i>>j)%2].end())
cur.erase(*it);
}
}
a[i] = *cur.begin();
}
a.erase(a.begin());
return a;
}