Submission #961833

#	Time	Username	Problem	Language	Result	Execution time	Memory
961833		steveonalex	Xoractive (IZhO19_xoractive)	C++17	0 / 100	4 ms	856 KiB

Xoractive

#include <bits/stdc++.h>
#include "interactive.h"

 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n"){
        for(auto i: a) cout << i << separator;
        cout << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


vector<int> guess(int n) {
    map<int, int> mp;
    vector <int> ans(n);
    ans[0] = ask(1);
    for(int j = 0; j < 7; ++j){
        vector<int> sigma;
        for(int i = 0; i<n; ++i){
            if (!GETBIT(i, j)) sigma.push_back(i + 1);
        }
        vector<int> S1 = get_pairwise_xor(sigma);
        sigma.erase(sigma.begin());
        vector<int> S2 = get_pairwise_xor(sigma);

        multiset<int> S(ALL(S1));
        for(int i: S2){
            S.erase(S.find(i));
        }

        for(int i: S) if (i) mp[i] += MASK(i);
    }

    for(pair<int, int> i: mp){
        ans[MASK(7) - 1 - i.second] = ans[0] ^ i.first;
    }
    return ans;
}
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);


//     return 0;
// }

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