# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387209 | 2021-04-08T06:42:15 Z | Kalashnikov | Xoractive (IZhO19_xoractive) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include <xoractive.h> using namespace std; vector<int> guess(int n) { vector<int> a(n); a[0] = ask(1); map<int,int> ans; for(int i = 0; (1 << i) <= n; i ++) { vector<int> p; for(int j = 2; j <= n; j ++) { if(j & (1 << i)) { p.push_back(j); } } auto g1 = get_pairwise_xor(p); p.push_back(1); auto g2 = get_pairwise_xor(p); map<int,int> mp; for(auto to: g2) mp[to] ++; for(auto to: g1) mp[to] --; for(auto to: mp) { if(to.S) { ans[to.F^a[0]] |= (1 << i); } } } for(auto to: ans) { a[to.S-1] = to.F; } return a; }