oj.uz

답안 #146190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146190 2019-08-22T18:01:57 Z imeimi2000 Xoractive (IZhO19_xoractive) C++17
0 / 100
 9 ms 504 KB 
#include "interactive.h"
#include <vector>
#include <set>

using namespace std;

multiset<int> query(vector<int> pos) {
    multiset<int> sp;
    if (pos.empty()) return sp;
    for (int i : get_pairwise_xor(pos)) sp.insert(i);
    return sp;
}

vector<int> guess(int n) {
    vector<int> ret;
    ret.push_back(ask(1));
    set<int> in[7];
    set<int> all;
    for (int i = 0; i < 7; ++i) {
        vector<int> B;
        for (int j = 2; j <= n; ++j) {
            if (((j >> i) & 1) == 0) continue;
            B.push_back(j);
        }
        multiset<int> sp2 = query(B);
        B.push_back(1);
        multiset<int> sp1 = query(B);
        sp1.erase(sp1.find(0));
        for (int j : sp2) sp1.erase(sp1.find(j));
        for (int j : sp1) {
            in[i].insert(j ^= ret[0]);
            all.insert(j);
        }
    }
    for (int i = 2; i <= n; ++i) {
        set<int> sp = all;
        for (int j = 0; j < 7; ++j) {
            if ((i >> j) & 1) continue;
            for (int k : in[j]) {
                auto it = sp.find(k);
                if (it == sp.end()) continue;
                sp.erase(it);
            }
        }
        ret.push_back(*sp.begin());
    }
    return ret;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 380 KB Output is not correc
2 Halted 0 ms 0 KB -

Subtask #2
0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 504 KB Output is not correc
2 Halted 0 ms 0 KB -