Submission #401195

#	Time	Username	Problem	Language	Result	Execution time	Memory
401195		Victor	Xoractive (IZhO19_xoractive)	C++17	100 / 100	8 ms	584 KiB

Xoractive

#include <bits/stdc++.h>

#include "interactive.h"

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

umap<int, bitset<101>> nums;

umap<int, int> process(vi vec) {
    umap<int, int> ret;
    rep(i, sqrt(sz(vec)), sz(vec))++ ret[vec[i++]];
    return ret;
}

bitset<101> pos_queries[15], dummy;
uset<int> nums_queries[15];
int cur_query = 0;

void queryyy(vi vec, int &last, int &n) {
    bitset<101> &pos_query = pos_queries[cur_query];
    auto &num_query = nums_queries[cur_query++];

    trav(num, vec) pos_query[num] = 1;

    auto prev = process(get_pairwise_xor(vec));
    vec.pb(n);
    auto cur = process(get_pairwise_xor(vec));

    trav(element, cur) {
        int num, cnt;
        tie(num, cnt) = element;

        if (prev[num] != cnt) {
            int num_add = num ^ last;
            num_query.insert(num_add);
            if (!nums.count(num_add)) nums[num_add] = dummy;
        }
    }
}

vector<int> guess(int n) {
    vector<int> ans(n, -1), qvec;
    int last = ask(n), queries = ceil(log2(n)), twopow = 1 << queries;
    vvi groups(1, vi());
    rep(i, 1, twopow + 1) groups[0].pb(i);

    rep(i, 1, n) dummy[i] = 1;

    rep(i, 0, queries) {
        vvi n_groups(sz(groups) << 1);
        int idx = 0;

        trav(group, groups) {

            rep(j, 0, sz(group) >> 1) {
                n_groups[idx].pb(group[j]);
                if (group[j] < n) qvec.pb(group[j]);
            }

            ++idx;
            rep(j, sz(group) >> 1, sz(group)) n_groups[idx].pb(group[j]);
            ++idx;
        }

        queryyy(qvec,last,n);
        groups = n_groups;
        qvec.clear();
    }

    rep(i, 0, queries) {
        bitset<101> &pos_query = pos_queries[i], rev = ~pos_query;
        auto &num_query = nums_queries[i];

        trav(element, nums) {
            int num = element.first;
            auto &positions = element.second;

            if (num_query.count(num))
                positions &= pos_query;

            else
                positions &= rev;
        }
    }

    trav(element, nums) {
        int num = element.first;
        auto &positions = element.second;
        ans[positions._Find_first()-1]=num;
    }

    ans[n - 1] = last;
    return ans;
}

Compilation message (stderr)

Xoractive.cpp: In function 'std::unordered_map<int, int> process(vi)':
Xoractive.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
Xoractive.cpp:31:5: note: in expansion of macro 'rep'
   31 |     rep(i, sqrt(sz(vec)), sz(vec))++ ret[vec[i++]];
      |     ^~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
Xoractive.cpp:75:13: note: in expansion of macro 'rep'
   75 |             rep(j, 0, sz(group) >> 1) {
      |             ^~~
Xoractive.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
Xoractive.cpp:81:13: note: in expansion of macro 'rep'
   81 |             rep(j, sz(group) >> 1, sz(group)) n_groups[idx].pb(group[j]);
      |             ^~~

• Subtask 1: 6 / 6
• Subtask 2: 94 / 94