oj.uz

Submission #583689

# Submission time Handle Problem Language Result Execution time Memory
583689 2022-06-26T04:44:16 Z KoD Xoractive (IZhO19_xoractive) C++17
100 / 100
 8 ms 516 KB 
#include "interactive.h"
#include <bits/stdc++.h>

using ll = long long;
using std::vector;
using std::array;
using std::pair;
using std::tuple;

template <class T>
constexpr T infty = std::numeric_limits<T>::max() / 2;

vector<int> guess(int N) {
    vector<int> ans(N);
    ans[0] = ask(1);
    const auto calc = [&](vector<int> pos) -> std::set<int> {
        if (pos.empty()) {
            return {};
        }
        for (auto& x : pos) {
            x += 1;
        }
        std::map<int, int> count;
        for (const int x : get_pairwise_xor(pos)) {
            count[x] -= 1;
        }
        pos.push_back(1);
        for (const int x : get_pairwise_xor(pos)) {
            count[x] += 1;
        }
        std::set<int> ret;
        for (const auto& [x, c] : count) {
            if (c - (x == 0) > 0) {
                ret.insert(x ^ ans[0]);
            } 
        }
        return ret;
    };
    const int LOG = 7;
    array<std::set<int>, LOG> set = {};
    for (int k = 0; k < LOG; ++k) {
        vector<int> pos;
        for (int i = 0; i < N; ++i) {
            if (i >> k & 1) {
                pos.push_back(i);
            }
        }
        set[k] = calc(pos);
    }
    for (int i = 1; i < N; ++i) {
        std::set<int> add, del;
        for (int k = 0; k < LOG; ++k) {
            if (i >> k & 1) {
                if (add.empty()) {
                    add = set[k];
                } else {
                    std::set<int> next;
                    for (const int x : set[k]) {
                        if (add.find(x) != add.end()) {
                            next.insert(x);
                        }
                    }
                    add = std::move(next);
                }
            } else {
                for (const int x : set[k]) {
                    del.insert(x);
                }
            }
        }
        for (const int x : del) {
            add.erase(x);
        }
        ans[i] = *add.begin();
    }
    return ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct

Subtask #2
94.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Correct 5 ms 336 KB Output is correct
3 Correct 4 ms 272 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 5 ms 336 KB Output is correct
6 Correct 6 ms 336 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 6 ms 392 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 388 KB Output is correct
11 Correct 4 ms 336 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 5 ms 336 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 4 ms 336 KB Output is correct
16 Correct 6 ms 392 KB Output is correct
17 Correct 6 ms 336 KB Output is correct
18 Correct 5 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 6 ms 336 KB Output is correct
21 Correct 6 ms 336 KB Output is correct
22 Correct 6 ms 464 KB Output is correct
23 Correct 4 ms 336 KB Output is correct
24 Correct 8 ms 516 KB Output is correct
25 Correct 5 ms 336 KB Output is correct
26 Correct 6 ms 400 KB Output is correct
27 Correct 5 ms 336 KB Output is correct
28 Correct 5 ms 336 KB Output is correct
29 Correct 6 ms 380 KB Output is correct
30 Correct 5 ms 336 KB Output is correct
31 Correct 4 ms 336 KB Output is correct
32 Correct 6 ms 336 KB Output is correct
33 Correct 7 ms 336 KB Output is correct
34 Correct 5 ms 336 KB Output is correct
35 Correct 6 ms 336 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 6 ms 336 KB Output is correct
38 Correct 5 ms 336 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
40 Correct 6 ms 336 KB Output is correct
41 Correct 5 ms 336 KB Output is correct
42 Correct 5 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 5 ms 336 KB Output is correct
45 Correct 5 ms 336 KB Output is correct
46 Correct 5 ms 336 KB Output is correct
47 Correct 4 ms 336 KB Output is correct
48 Correct 5 ms 336 KB Output is correct
49 Correct 5 ms 336 KB Output is correct
50 Correct 5 ms 336 KB Output is correct
51 Correct 5 ms 336 KB Output is correct
52 Correct 5 ms 336 KB Output is correct
53 Correct 7 ms 336 KB Output is correct
54 Correct 6 ms 336 KB Output is correct
55 Correct 4 ms 464 KB Output is correct
56 Correct 5 ms 388 KB Output is correct
57 Correct 5 ms 336 KB Output is correct
58 Correct 5 ms 336 KB Output is correct
59 Correct 4 ms 336 KB Output is correct
60 Correct 6 ms 388 KB Output is correct
61 Correct 5 ms 372 KB Output is correct
62 Correct 6 ms 336 KB Output is correct
63 Correct 4 ms 336 KB Output is correct
64 Correct 7 ms 392 KB Output is correct
65 Correct 6 ms 336 KB Output is correct
66 Correct 6 ms 336 KB Output is correct
67 Correct 4 ms 336 KB Output is correct
68 Correct 6 ms 336 KB Output is correct
69 Correct 5 ms 388 KB Output is correct
70 Correct 6 ms 392 KB Output is correct
71 Correct 5 ms 336 KB Output is correct
72 Correct 6 ms 336 KB Output is correct
73 Correct 5 ms 336 KB Output is correct
74 Correct 5 ms 336 KB Output is correct
75 Correct 4 ms 336 KB Output is correct
76 Correct 6 ms 392 KB Output is correct
77 Correct 5 ms 336 KB Output is correct
78 Correct 5 ms 336 KB Output is correct
79 Correct 4 ms 336 KB Output is correct
80 Correct 5 ms 384 KB Output is correct
81 Correct 6 ms 336 KB Output is correct
82 Correct 5 ms 336 KB Output is correct
83 Correct 5 ms 344 KB Output is correct
84 Correct 6 ms 336 KB Output is correct
85 Correct 6 ms 392 KB Output is correct
86 Correct 6 ms 336 KB Output is correct
87 Correct 5 ms 336 KB Output is correct
88 Correct 6 ms 396 KB Output is correct
89 Correct 5 ms 336 KB Output is correct
90 Correct 5 ms 336 KB Output is correct
91 Correct 4 ms 336 KB Output is correct
92 Correct 5 ms 336 KB Output is correct
93 Correct 5 ms 336 KB Output is correct
94 Correct 6 ms 336 KB Output is correct
95 Correct 4 ms 336 KB Output is correct
96 Correct 6 ms 336 KB Output is correct
97 Correct 6 ms 336 KB Output is correct
98 Correct 6 ms 336 KB Output is correct
99 Correct 4 ms 336 KB Output is correct
100 Correct 6 ms 336 KB Output is correct