Submission #735814

#	Time	Username	Problem	Language	Result	Execution time	Memory
735814		GrindMachine	Xoractive (IZhO19_xoractive)	C++17	100 / 100	5 ms	472 KiB

Xoractive

// 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 / 6
• Subtask 2: 94 / 94