# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841544 | 2023-09-01T16:19:01 Z | Elvin_Fritl | Xoractive (IZhO19_xoractive) | C++17 | 0 ms | 0 KB |
#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=6;mask>=0;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]++; } for(int i=0;i<se.size();i++){ if(m[se[i]] > 0){ mm[(se[i]^eded)] |= (1<<mask); } } } int anss[n + 1]; for(pair<int, int>p : mm){ anss[p.second] = p.first; } anss[1] = x; vector<int> ans; for (int i=1;i<=n;i++){ ans.push_back(anss[i]); } return ans; }