# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954546 | 2024-03-28T06:35:55 Z | boris_mihov | Xoractive (IZhO19_xoractive) | C++17 | 1 ms | 344 KB |
#include "interactive.h" #include <vector> #include <map> #include <set> const int MAXN = 100 + 10; std::map <int,int> map; std::vector <int> query(std::vector <int> v) { std::vector <int> res; std::vector <int> returned = get_pairwise_xor(v); for (int i = v.size() ; i < returned.size() ; i += 2) { res.push_back(returned[i]); } return res; } std::vector <int> guess(int n) { std::vector <int> result(n); result[0] = ask(0); for (int bit = 0 ; (1 << bit) < n ; ++bit) { std::vector <int> v; for (int i = 1 ; i < n ; ++i) { if (i & (1 << bit)) { v.push_back(i); } } if (v.empty()) { continue; } std::vector <int> without = query(v); v.push_back(0); std::vector <int> with = query(v); std::multiset <int> vals; for (const int &val : with) { vals.insert(val); } for (const int &val : without) { vals.erase(vals.find(val)); } int last = -1; for (const int &val : vals) { if (val == last) { continue; } map[val ^ result[0]] |= (1 << bit); last = val; } } for (const auto &[key, value] : map) { result[value] = key; } return result; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct position |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Not correct position |
2 | Halted | 0 ms | 0 KB | - |