Submission #1132312

#TimeUsernameProblemLanguageResultExecution timeMemory
1132312stdfloatXoractive (IZhO19_xoractive)C++20
100 / 100
3 ms672 KiB
#include "bits/stdc++.h" #include "interactive.h" // #include "grader.cpp" using namespace std; #define sz(v) (int)(v).size() #define all(v) (v).begin(), (v).end() vector<int> guess(int n) { int a1 = ask(1); map<int, int> m; m[a1] = 1; for (int x = 0; x < 10; x++) { vector<int> v; for (int i = 2; i <= n; i++) if ((i >> x) & 1) v.push_back(i); if (v.empty()) continue; vector<int> u = get_pairwise_xor(v); multiset<int> s(all(u)); v.push_back(1); u = get_pairwise_xor(v); multiset<int> t(all(u)); set<int> z = {a1}; for (auto i : t) { if (s.find(i) != s.end()) s.erase(s.find(i)); else if (z.find(i ^ a1) == z.end()) { z.insert(i ^ a1); m[i ^ a1] ^= 1 << x; } } } vector<int> v(n); for (auto [x, y] : m) v[y - 1] = x; return v; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...