제출 #471684

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