oj.uz

Submission #686661

# Submission time Handle Problem Language Result Execution time Memory
686661 2023-01-25T17:33:02 Z Alcabel Xoractive (IZhO19_xoractive) C++17
94 / 100
 3 ms 464 KB 
#include <interactive.h>
#include <bits/stdc++.h>
using namespace std;
/*vector<int> unk;

int ask(int i) {
    return unk[i - 1];
}

vector<int> get_pairwise_xor(vector<int> a) {
    vector<int> res;
    for (const int& i : a) {
        for (const int& j : a) {
            res.emplace_back(unk[i - 1] ^ unk[j - 1]);
        }
    }
    sort(res.begin(), res.end());
    return res;
}
*/
vector<int> guess(int n) {
    vector<int> toAsk, x1, x2, ans(n);
    ans[0] = ask(1);
    unordered_map<int, int> idxOf;
    for (int bit = 31 - __builtin_clz(n); bit >= 0; --bit) {
        toAsk.clear();
        for (int i = 1; i < n; ++i) {
            if ((i & (1 << bit)) != 0) {
                toAsk.emplace_back(i + 1);
            }
        }
        x1 = get_pairwise_xor(toAsk);
        toAsk.emplace_back(1);
        x2 = get_pairwise_xor(toAsk);
        int ptr1 = (int)toAsk.size() - 1, ptr2 = (int)toAsk.size();
        while (ptr2 < (int)x2.size()) {
            if (ptr1 < (int)x1.size()) {
                if (x1[ptr1] == x2[ptr2]) {
                    ptr1 += 2, ptr2 += 2;
                } else if (x1[ptr1] < x2[ptr2]) {
                    ptr1 += 2;
                } else {
                    idxOf[x2[ptr2] ^ ans[0]] ^= (1 << bit);
                    ptr2 += 2;
                }
            } else {
                idxOf[x2[ptr2] ^ ans[0]] ^= (1 << bit);
                ptr2 += 2;
            }
        }
    }
    for (const auto& [num, idx] : idxOf) {
        ans[idx] = num;
    }
    return ans;
}
/*
void solve() {
    int n;
    cin >> n;
    unk.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> unk[i];
    }
    unk = guess(n);
    for (const int& x : unk) {
        cout << x << ' ';
    }
    cout << endl;
}

int main() {
    // ios_base::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}


*/

Subtask #1
0 / 6.0

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

Subtask #2
94.0 / 94.0

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