# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521915 | 2022-02-03T12:44:38 Z | dostigator | Xoractive (IZhO19_xoractive) | C++17 | 0 ms | 0 KB |
#include "interactive.h" #include <bits/stdc++.h> using namespace std; vector<int> guess(int n) { vector <int> ans(n+2); int base=ask(1); ans[1]=base; map<int,int>res; for(int i=0; i<7; ++i){ vector<int>v; for(int x=1; x<=n; ++x) if((x>>i)&1) v.push_back(x); vector<int>get=get_pairwise_xor(v); v.push_back(1); vector<int>GET=get_pairwise_xor(v); map<int,int>mp; for(int x:get) mp[x]++; for(int x:GET){ if(mp[x]==0) res[x^base]|=(1<<i); mp[x]--; } } for(int z:res){ ans[z->second]=z->first; } return ans; }