oj.uz

Submission #735814

# Submission time Handle Problem Language Result Execution time Memory
735814 2023-05-04T17:29:18 Z GrindMachine Xoractive (IZhO19_xoractive) C++17
100 / 100
 5 ms 472 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://github.com/stefdasca/CompetitiveProgramming/blob/master/IZhO/IZhO%2019-xoractive.cpp

*/

#include "interactive.h"

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> guess(int n) {
    int val1 = ask(1);
    map<ll, ll> mp_pos;

    rep(bit, 7) {
        int f = 1 << bit;
        vector<int> pos;
        for (int i = 2; i <= n; ++i) {
            if (i & f) {
                pos.pb(i);
            }
        }

        if (pos.empty()) conts;

        auto v1 = get_pairwise_xor(pos);

        pos.pb(1);
        auto v2 = get_pairwise_xor(pos);

        map<ll, ll> mp_vals;
        trav(xo, v2) {
            if (xo) {
                mp_vals[xo]++;
            }
        }
        trav(xo, v1) {
            if (xo) {
                mp_vals[xo]--;
            }
        }

        // anything that remains in mp is extra
        // i.e multiset of {val1 ^ ai} for all i that have bit set

        for (auto [v, c] : mp_vals) {
            if (!c) conts;
            mp_pos[v ^ val1] |= f;
        }
    }

    vector<int> ans(n);
    ans[0] = val1;

    trav(p, mp_pos) {
        ans[p.ss - 1] = p.ff;
    }

    return ans;
}

Subtask #1
6.0 / 6.0

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