Submission #154987

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
154987	2019-09-25T19:25:34 Z	Pankin	Xoractive (IZhO19_xoractive)	C++14	Compilation error	0 ms	0 KB

Xoractive

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

#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fs first
#define sc second
#define getfiles ifstream cin("input.txt"); ofstream cout("output.txt");
#define endl '\n'
#define con continue
#define pii pair<ll, ll>
#define all(x) x.begin(), x.end()

using namespace std;

vector<int> a;

set<int> getMn(set<int> ind) {
    vector<int> pos;
    for (auto i = ind.begin(); i != ind.end(); i++)
        pos.pb(*i);
    pos.pb(1);
    vector<int> px1 = get_pairwise_xor(pos);
    pos.pop_back();
    vector<int> px2 = get_pairwise_xor(pos);
    set<int> ans;
    multiset<int> temp;
    for (int i = 0; i < px1.size(); i++)
        temp.insert(px1[i]);
    for (int i = 0; i < px2.size(); i++)
        temp.erase(temp.find(px2[i]));
    for (auto i = temp.begin(); i != temp.end(); i++)
        ans.insert(*i ^ a[1]);
    ans.erase(a[1]);
    return ans;
}

vector<int> guess(int n) {
    a.resize(n + 1);
	set<int> all;
    a[1] = ask(1);
    vector< vector< set<int> > > mn(7, vector< set<int> >(2)), ind(7, vector< set<int> >(2));
    for (int i = 2; i <= n; i++) {
        for (int j = 6; j >= 0; j--) {
            ind[j][(i>>j)%2].pb(i);
        }
    }
    for (int j = 6; j >= 0; j--) {
        mn[j][1] = getMn(ind[j][1]);
        for (auto i = mn[j][1].begin(); i != mn[j][1].end(); i++)
            all.insert(*i);
    }

    for (int j = 6; j >= 0; j--) {
        mn[j][0] = all;
        for (auto i = mn[j][1].begin(); i != mn[j][1].end(); i++)
            mn[j][0].erase(*i);
    }

    for (int i = 2; i <= n; i++) {
        set<int> cur = all;
        for (int j = 6; j >= 0; j--) {
            for (auto it = all.begin(); it != all.end(); it++) {
                if (mn[j][(i>>j)%2].find(*it) == mn[j][(i>>j)%2].end())
                    cur.erase(*it);
            }
        }
        a[i] = *cur.begin();
    }
    a.erase(a.begin());
    return a;
}

Compilation message

Xoractive.cpp: In function 'std::set<int> getMn(std::set<int>)':
Xoractive.cpp:31:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < px1.size(); i++)
                     ~~^~~~~~~~~~~~
Xoractive.cpp:33:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < px2.size(); i++)
                     ~~^~~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:7:12: error: '__gnu_cxx::__alloc_traits<std::allocator<std::set<int> > >::value_type {aka class std::set<int>}' has no member named 'push_back'
 #define pb push_back
            ^
Xoractive.cpp:48:30: note: in expansion of macro 'pb'
             ind[j][(i>>j)%2].pb(i);
                              ^~