# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377089 | eulerdesoja | 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>
#include<fstream>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) int(x.size())
typedef pair<int,int>ii;
typedef vector<int> vi;
vi guess(int n){
int a0=ask(1);
vi ans;
multiset<int> tab[7];
for(int k=0;k<7;k++){
vi ax,ax1;
ax1.pb(1);
for(int i=1;i<n;i++){
if(i&(1<<k)){
ax.pb(i+1);
ax1.pb(i+1);
}
}
vi q=get_pairwise_xor(ax);
vi q1=get_pairwise_xor(ax1);
int i=0,i1=0;
while(!q[i])i++;
while(!q1[i1])i1++;