/*
Code written by Talant I.D.
*/
#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
inline bool isvowel(char ch){
ch = tolower(ch);
return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
inline bool isprime(int n){
if(n < 2 || (n%2 == 0 && n != 2)) return false;
for(int i = 3; i*i <= n; i++)
if(n%i == 0) return false;
return true;
}
class Union{
private:
vector <int> saizu, link;
public:
Union(int n){
saizu.assign(n, 1); link.resize(n);
iota(all(link), 0);
}
int find(int n){
if(link[n] == n) return n;
return link[n] = find(link[n]);
}
int same(int a, int b){
return find(a) == find(b);
}
void unite(int a, int b){
if(same(a, b)) return;
a = find(a); b = find(b);
if(saizu[a] < saizu[b]) swap(a, b);
saizu[a] += saizu[b];
link[b] = a;
}
int getsize(int a){
return saizu[find(a)];
}
};
const int mod = 1e9+7;
ll mode(ll a){
a %= mod;
if(a < 0) a += mod;
return a;
}
ll subt(ll a, ll b){
return mode(mode(a)-mode(b));
}
ll add(ll a, ll b){
return mode(mode(a)+mode(b));
}
ll mult(ll a, ll b){
return mode(mode(a)*mode(b));
}
ll binpow(ll a, ll b){
ll res = 1;
while(b){
if(b&1) res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
map <int, vector <int>> location;
vector <int> guess(int n){
vector <int> ans(n);
ans[0] = ask(1);
set <int> st;
for(int bit = 0; bit < 7; bit++){
vector <int> pos;
for(int i = 1; i < n; i++){
if(i&(1<<bit)) pos.pb(i+1);
}
if(sz(pos)){
vector <int> tmp1 = get_pairwise_xor(pos);
pos.pb(1);
vector <int> tmp2 = get_pairwise_xor(pos);
vector <int> tmp;
for(auto to : tmp2) if(to && !binary_search(all(tmp1), to) && (!sz(tmp) || tmp.back() != to)) tmp.pb(to);
for(auto &to : tmp) to ^= ans[0];
for(auto to : tmp) location[to].pb(bit);
for(auto to : tmp) st.insert(to);
}
}
for(auto to : st) {
int aa = 0;
for(auto to2 : location[to]) aa ^= (1<<to2);
ans[aa] = to;
}
return ans;
}
Compilation message
/tmp/ccJzEXzo.o: In function `query()':
grader.cpp:(.text+0x30): multiple definition of `query()'
/tmp/cc2fPPuh.o:Xoractive.cpp:(.text+0x30): first defined here
/tmp/ccJzEXzo.o: In function `ask(int)':
grader.cpp:(.text+0x60): multiple definition of `ask(int)'
/tmp/cc2fPPuh.o:Xoractive.cpp:(.text+0x60): first defined here
/tmp/ccJzEXzo.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cc2fPPuh.o:Xoractive.cpp:(.text.startup+0x0): first defined here
/tmp/ccJzEXzo.o: In function `get_pairwise_xor(std::vector<int, std::allocator<int> >)':
grader.cpp:(.text+0xc0): multiple definition of `get_pairwise_xor(std::vector<int, std::allocator<int> >)'
/tmp/cc2fPPuh.o:Xoractive.cpp:(.text+0x350): first defined here
collect2: error: ld returned 1 exit status
