Submission #471782

# Submission time Handle Problem Language Result Execution time Memory
471782 2021-09-10T20:19:31 Z nickmet2004 Xoractive (IZhO19_xoractive) C++11
0 / 100
6 ms 456 KB
#include<bits/stdc++.h>
#include "interactive.h"
using namespace std;

vector<int> guess(int n){
    int a = ask(1);
    map<int , int> T;
    for(int i = 0; i < 7; ++i){
        vector<int> x;
        for(int k = 1; k < n; ++k){
            if(k>>i&a)x.emplace_back(k + 1);
        }
        vector<int> X = get_pairwise_xor(x);
        x.push_back(1);
        vector<int> Y = get_pairwise_xor(x);
        map<int , int> A;
        for(int x : X) A[x]--;
        for(int x : Y) A[x] ++;
        for(auto x : A){
            if(x.second && x.first != 0) T[x.first ^ a] += (1<<i);
        }
    }
    vector<int> ans;
    ans.resize(n);
    ans[0] = a;
    for(auto x : T) ans[x.second] = x.first;
    return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Not correct size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 456 KB Not correct size
2 Halted 0 ms 0 KB -