Submission #435357

# Submission time Handle Problem Language Result Execution time Memory
435357 2021-06-23T08:36:00 Z 2qbingxuan Xoractive (IZhO19_xoractive) C++17
100 / 100
4 ms 336 KB
#include "interactive.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(args...) qqbx(#args, args)
#define pary(args...) danb(#args, args)
template <typename ...T> void qqbx(const char *s, T ...args) {
    int cnt = sizeof...(T);
    if(!cnt) return std::cerr << "\033[1;32m() = ()\033\[0m\n", void();
    (std::cerr << "\033[1;32m(" << s << ") = (" , ... , (std::cerr << args << (--cnt ? ", " : ")\033[0m\n")));
}
template <typename T> void danb(const char *s, T L, T R) {
    std::cerr << "\033[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L) std::cerr << (f++ ? ", " : "") << *L;
    std::cerr << " ]\033[0m\n";
}
#else
#define debug(...) ((void)0)
#define pary(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
using namespace std;
 
vector<int> guess(int n) {
    int xn = ask(n);
    vector<int> ms[7][2];
    for (int b = 0; b < 7; b++) {
        vector<int> v;
        for (int i = 1; i < n; i++) if (i >> b & 1) v.push_back(i);
        if (v.empty()) {
            continue;
        }
        auto A = get_pairwise_xor(v);
        v.push_back(n);
        auto B = get_pairwise_xor(v);
        sort(all(A)), sort(all(B));
        ms[b][1].resize(B.size() - A.size());
        set_difference(all(B), all(A), ms[b][1].begin());
        ms[b][1].erase(ms[b][1].begin()); // xn ^ xn == 0
        for (int &x: ms[b][1]) x ^= xn;
        sort(all(ms[b][1])), ms[b][1].erase(unique(all(ms[b][1])), ms[b][1].end());
    }
    for (int b = 0; b < 7; b++)
        debug(b), pary(all(ms[b][1]));
    vector<int> tot;
    for (int b = 0; b < 7; b++)
        for (int x: ms[b][1])
            tot.push_back(x);
    sort(all(tot)), tot.erase(unique(all(tot)), tot.end());
    for (int b = 0; b < 7; b++)
        set_difference(all(tot), all(ms[b][1]), back_inserter(ms[b][0]));
 
    pary(all(tot));
    vector<int> ans;
    for (int i = 1; i < n; i++) {
        vector<int> cur = tot;
        for (int b = 0; b < 7; b++) {
            vector<int> tmp;
            set_intersection(all(cur), all(ms[b][i >> b & 1]), back_inserter(tmp));
            cur = tmp;
        }
        pary(all(cur));
        assert (cur.size() == 1);
        ans.push_back(cur[0]);
    }
    ans.push_back(xn);
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 328 KB Output is correct
2 Correct 3 ms 328 KB Output is correct
3 Correct 3 ms 328 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 3 ms 328 KB Output is correct
10 Correct 4 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 3 ms 328 KB Output is correct
13 Correct 3 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 3 ms 328 KB Output is correct
16 Correct 3 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 3 ms 328 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 4 ms 328 KB Output is correct
26 Correct 3 ms 328 KB Output is correct
27 Correct 3 ms 328 KB Output is correct
28 Correct 3 ms 328 KB Output is correct
29 Correct 3 ms 328 KB Output is correct
30 Correct 3 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 3 ms 328 KB Output is correct
33 Correct 3 ms 328 KB Output is correct
34 Correct 3 ms 328 KB Output is correct
35 Correct 3 ms 328 KB Output is correct
36 Correct 3 ms 328 KB Output is correct
37 Correct 3 ms 328 KB Output is correct
38 Correct 4 ms 332 KB Output is correct
39 Correct 3 ms 328 KB Output is correct
40 Correct 3 ms 328 KB Output is correct
41 Correct 4 ms 328 KB Output is correct
42 Correct 4 ms 328 KB Output is correct
43 Correct 3 ms 328 KB Output is correct
44 Correct 3 ms 328 KB Output is correct
45 Correct 3 ms 328 KB Output is correct
46 Correct 3 ms 328 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 4 ms 328 KB Output is correct
49 Correct 3 ms 328 KB Output is correct
50 Correct 3 ms 328 KB Output is correct
51 Correct 3 ms 328 KB Output is correct
52 Correct 3 ms 328 KB Output is correct
53 Correct 3 ms 328 KB Output is correct
54 Correct 3 ms 328 KB Output is correct
55 Correct 3 ms 212 KB Output is correct
56 Correct 3 ms 328 KB Output is correct
57 Correct 3 ms 328 KB Output is correct
58 Correct 3 ms 328 KB Output is correct
59 Correct 3 ms 328 KB Output is correct
60 Correct 4 ms 328 KB Output is correct
61 Correct 3 ms 328 KB Output is correct
62 Correct 3 ms 328 KB Output is correct
63 Correct 3 ms 328 KB Output is correct
64 Correct 3 ms 328 KB Output is correct
65 Correct 3 ms 328 KB Output is correct
66 Correct 3 ms 328 KB Output is correct
67 Correct 3 ms 328 KB Output is correct
68 Correct 3 ms 328 KB Output is correct
69 Correct 3 ms 328 KB Output is correct
70 Correct 4 ms 328 KB Output is correct
71 Correct 4 ms 328 KB Output is correct
72 Correct 3 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 3 ms 328 KB Output is correct
77 Correct 3 ms 328 KB Output is correct
78 Correct 3 ms 328 KB Output is correct
79 Correct 3 ms 328 KB Output is correct
80 Correct 3 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 3 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 4 ms 328 KB Output is correct
87 Correct 3 ms 328 KB Output is correct
88 Correct 3 ms 328 KB Output is correct
89 Correct 3 ms 328 KB Output is correct
90 Correct 3 ms 332 KB Output is correct
91 Correct 3 ms 328 KB Output is correct
92 Correct 3 ms 328 KB Output is correct
93 Correct 3 ms 328 KB Output is correct
94 Correct 3 ms 328 KB Output is correct
95 Correct 3 ms 328 KB Output is correct
96 Correct 3 ms 328 KB Output is correct
97 Correct 3 ms 328 KB Output is correct
98 Correct 3 ms 328 KB Output is correct
99 Correct 3 ms 328 KB Output is correct
100 Correct 3 ms 328 KB Output is correct