oj.uz

Submission #502625

# Submission time Handle Problem Language Result Execution time Memory
502625 2022-01-06T11:01:57 Z Mazaalai Xoractive (IZhO19_xoractive) C++17
0 / 100
 3 ms 328 KB 
#include <bits/stdc++.h>
#include "interactive.h"
 
using namespace std;
#define F first
#define S second
 
vector<int> guess(int n) {
    vector<int> a(n);
    a[0] = ask(1);
    map<int,int> ans;
    for(int i = 0; i <= n; i ++) {
        vector<int> p;
        for(int j = 2; j <= n; j ++) {
            if(j & (1 << i)) {
                p.push_back(j);
            }
        }
        auto g1 = get_pairwise_xor(p);
        p.push_back(1);
        auto g2 = get_pairwise_xor(p);
        map<int,int> mp;
        for(auto to: g2) mp[to] ++;
        for(auto to: g1) mp[to] --;
        for(auto to: mp) {
            if(to.S) {
                ans[to.F^a[0]] |= (1 << i);
            }
        }
    }
    for(auto to: ans) {
        a[to.S-1] = to.F;
    }
    return a;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Not correct size
2 Halted 0 ms 0 KB -

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 328 KB Not correct size
2 Halted 0 ms 0 KB -