Submission #954542

#TimeUsernameProblemLanguageResultExecution timeMemory
954542boris_mihovXoractive (IZhO19_xoractive)C++17
0 / 100
0 ms344 KiB
#include "interactive.h" #include <vector> #include <map> #include <set> const int MAXN = 100 + 10; std::map <int,int> map; 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); } } std::vector <int> without = get_pairwise_xor(v); v.push_back(0); std::vector <int> with = get_pairwise_xor(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; vals.erase(vals.find(0)); 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...