oj.uz

Submission #268658

# Submission time Handle Problem Language Result Execution time Memory
268658 2020-08-16T16:27:09 Z aZvezda Xoractive (IZhO19_xoractive) C++14
0 / 100
 3 ms 384 KB 
#include <iostream>
#include <bits/stdc++.h>

#include "interactive.h"
using namespace std;

/*abcdefghijklmnopqrstuvwxyz
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1234567890*/


map<int, int> mp;

vector<int> guess(int n) {
    int zer = ask(1);
    vector<int> ret(n);
    for(int bit = 0; bit < 7; bit ++) {
        vector<int> curr;
        for(int i = 0; i < n; i ++) if(i & (1 << bit)) {
            curr.push_back(i + 1);
        }
        if(curr.empty()) {continue;}
        vector<int> ans1, ans2, ans3;
        ans1 = get_pairwise_xor(curr);
        curr.push_back(1);
        ans2 = get_pairwise_xor(curr);
        int cnt = 0;
        ans1.push_back(-1);
        for(int i = ans1.size() - 2; i >= 0; i --) {
            ans1[i + 1] = ans1[i];
        }
        ans1[0] = 0;
        for(auto it : ans2) {
            if(cnt >= (int)ans1.size() || ans1[cnt] != it) {
                ans3.push_back(it ^ zer);
            } else {
                cnt ++;
            }
        }
        for(auto it : ans3) {
            mp[it] |= (1 << bit);
        }
    }
    for(auto it : mp) {
        ret[it.second] = it.first;
    }
    return ret;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output is not correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output is not correct
2 Halted 0 ms 0 KB -