| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 343343 | Tosic | 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 <bits/stdc++.h>
using namespace std;
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(MSG);
exit(0);
}
}
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) {
cerr << positions.size() << ' ';
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;
}
multiset<int> s1[7],s0[7];
void toMs(vector<int>& tmp, multiset<int>& ms){
for(auto i : tmp){
if(!i){
continue;
}
ms.insert(i);
}
}
map<int, int> idx;
vector<int> guess(int n){
int fr = ask(1);
for(int j = 0; j <= 6; ++j){
vector<int >a1;
for(int i = 2; i <= n; ++i){
if((i>>j)&1){
a1.push_back(i);
}
}
vector<int>a2 = a1;
if(a2.empty()){
continue;
}
for(auto y : a1){
cout << y << ' ';
}
cout << '\n';
a2.push_back(1);
a2=get_pairwise_xor(a2);
a1=get_pairwise_xor(a1);
multiset<int> tmp;
toMs(a2, tmp);
for(auto i : a1){
if(i and tmp.find(i) != tmp.end()){
tmp.erase(tmp.find(i));
}
}
for(auto i = tmp.begin(); i != tmp.end(); ++i){
idx[fr^*i] += (1<<j);
++i;
}
}
vector<int> ans(n, 0);
for(auto pr:idx){
ans[pr.second-1] = pr.first;
}
ans [0] =fr;
return ans;
}
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;
}