제출 #728042

#제출 시각아이디문제언어결과실행 시간메모리
728042bitaro1337Xoractive (IZhO19_xoractive)C++14
100 / 100
4 ms464 KiB
#include "bits/stdc++.h"
#include "interactive.h"
using namespace std;

vector<int> guess(int n) {
    if(n <= 4) {
        vector<int> ans(n, 0);
        for(int i = 0; i < n; ++i) ans[i] = ask(i + 1);
        return ans;
    }
    vector<int> ans(n, 0);
    ans[0] = ask(1);
    map<int, int> pos;
    for(int i = 0; i < 7; ++i) {
        vector<int> v;
        for(int j = 1; j < n; ++j) {
            if(j >> i & 1) {
                v.push_back(j + 1);
            }
        }
        vector<int> A = get_pairwise_xor(v);
        v.push_back(1);
        vector<int> B = get_pairwise_xor(v);
        map<int, int> cnt;
        for(auto x: A) if(x) ++cnt[x];
        for(auto x: B) if(x) --cnt[x];
        for(auto x: cnt) {
            if(x.second) {
                pos[x.first ^ ans[0]] += (1 << i); 
            }
        }
    }
    for(auto x: pos) ans[x.second] = x.first;
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...