# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841506 | Elvin_Fritl | Xoractive (IZhO19_xoractive) | C++17 | 6 ms | 464 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;
#include "interactive.h"
vector<int> guess(int n)
{
int eded = ask(1);
map<int,int>mm;
for(int mask=0;mask<7;mask++)
{
vector<int>v;
for(int i=2;i<=n;i++)
{
if(i&(1<<mask)){
v.push_back(i);
}
}
if(v.size() == 0)
{
continue;
}
vector<int> fi = get_pairwise_xor(v);
v.push_back(1);
vector<int> se = get_pairwise_xor(v);
map<int,int> m;
for(int i:fi)
{
m[i]--;
}
for(int i:se)
{
m[i]++;
}
vector<int>res;
for(int i=0;i<se.size();i++){
if(m[se[i]] > 0){
mm[se[i]^eded] |= (1<<mask);
}
}
}
vector<int>res(n);
res[0] = eded;
for(auto [x,i]:mm){
res[i-1] = x;
}
for(int i=0;i<n;i++){
cerr<<res[i]<<" ";
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |