제출 #471773

#제출 시각아이디문제언어결과실행 시간메모리
471773nickmet2004Xoractive (IZhO19_xoractive)C++11
0 / 100
5 ms484 KiB
#include<bits/stdc++.h> #include "interactive.h" using namespace std; vector<int> guess(int n){ map<int , int> Z; int a = ask(1); for(int i = 0; i < 7; ++i){ vector<int> x; for(int k = 1; k < n; ++k){ if(k >> i & 1) x.emplace_back(k + 1); } vector<int> X = get_pairwise_xor(x); x.emplace_back(1); vector<int> Y = get_pairwise_xor(x); map<int , int> A; for(int x : X)A[x^a]--; for(int x : Y)A[x^a]++; for(auto x : A){ if(x.second&&x.first!=0)Z[x.first] += 1<<i; } } vector<int> ans; ans.resize(n); ans[0] = a; for(auto x : Z)ans[x.second]=x.first; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...