| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 401193 | Victor | 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 <bits/stdc++.h>
#include "interactive.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define umap unordered_map
#define uset unordered_set
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
const int INF = 1000000007;
umap<int, bitset<101>> nums;
umap<int, int> process(vi vec) {
umap<int, int> ret;
rep(i, sqrt(sz(vec)), sz(vec))++ ret[vec[i++]];
return ret;
}
bitset<101> pos_queries[15], dummy;
uset<int> nums_queries[15];
int cur_query = 0;
void queryyy(vi vec, int &last, int &n) {
bitset<101> &pos_query = pos_queries[cur_query];
auto &num_query = nums_queries[cur_query++];
trav(num, vec) pos_query[num] = 1;
auto prev = process(get_pairwise_xor(vec));
vec.pb(n);
auto cur = process(get_pairwise_xor(vec));
trav(element, cur) {
int num, cnt;
tie(num, cnt) = element;
if (prev[num] != cnt) {
int num_add = num ^ last;
num_query.insert(num_add);
if (!nums.count(num_add)) nums[num_add] = dummy;
}
}
}
vector<int> guess(int n) {
vector<int> ans(n, -1), qvec;
int last = ask(n), queries = ceil(log2(n)), twopow = 1 << queries;
vvi groups(1, vi());
rep(i, 1, twopow + 1) groups[0].pb(i);
rep(i, 1, n) dummy[i] = 1;
rep(i, 0, queries) {
vvi n_groups(sz(groups) << 1);
int idx = 0;
trav(group, groups) {
rep(j, 0, sz(group) >> 1) {
n_groups[idx].pb(group[j]);
if (group[j] < n) qvec.pb(group[j]);
}
++idx;
rep(j, sz(group) >> 1, sz(group)) n_groups[idx].pb(group[j]);
++idx;
}
queryyy(qvec,last,n);
groups = n_groups;
qvec.clear();
}
rep(i, 0, queries) {
bitset<101> &pos_query = pos_queries[i], rev = ~pos_query;
auto &num_query = nums_queries[i];
trav(element, nums) {
int num = element.first;
auto &positions = element.second;
if (num_query.count(num))
positions &= pos_query;
else
positions &= rev;
}
}
trav(element, nums) {
int num = element.first;
auto &positions = element.second;
ans[positions._Find_first()-1]=num;
}
ans[n - 1] = last;
return ans;
}
namespace {
const int MAX_VALUE_OF_N = 100;
const int MAX_VALUE_OF_Q = 200;
int numberOfQueries = 0;
int n;
std::vector<int> a;
void wrong_answer(const char *MSG) {
printf("-1\n");
exit(0);
}
} // namespace
void query() {
numberOfQueries++;
if (numberOfQueries > MAX_VALUE_OF_Q) {
wrong_answer("Number of queries exceeded");
}
}
int ask(int position) {
query();
if (position < 1 || position > n) {
wrong_answer("Not correct position");
}
return a[position - 1];
}
vector<int> get_pairwise_xor(vector<int> positions) {
query();
if (positions.empty() || positions.size() > n) {
wrong_answer("Not correct size");
}
sort(positions.begin(), positions.end());
for (int i = 1; i < positions.size(); i++) {
if (positions[i] == positions[i - 1]) {
wrong_answer("Not unique");
}
}
for (int i = 0; i < positions.size(); i++) {
if (positions[i] < 1 || positions[i] > n) {
wrong_answer("Not correct position");
}
}
vector<int> pairwise_xor;
for (int i = 0; i < positions.size(); i++) {
for (int j = 0; j < positions.size(); j++) {
pairwise_xor.push_back(a[positions[i] - 1] ^ a[positions[j] - 1]);
}
}
sort(pairwise_xor.begin(), pairwise_xor.end());
return pairwise_xor;
}
vector<int> guess(int n);
int main() {
assert(scanf("%d", &n) == 1);
assert(1 <= n && n <= MAX_VALUE_OF_N);
for (int i = 1; i <= n; i++) {
int x;
assert(scanf("%d", &x) == 1);
assert(x >= 0 && x <= 1000 * 1000 * 1000);
a.push_back(x);
}
vector<int> participant_solution = guess(n);
if (participant_solution.size() != n) {
wrong_answer("-1");
}
printf("%d\n", n);
for (auto i : participant_solution) {
printf("%d ", i);
}
printf("\n");
printf("%d\n", numberOfQueries);
return 0;
}