//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
// swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
// g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;
#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);
// concurrent sorts
// https://en.wikipedia.org/wiki/Bitonic_sorter
void solve(int n, int v) {
// 60%
vector<int> at(n);
iota(all(at), 1);
vector<pair<pair<int, int>, int>> queries;
auto query = [&](int a, int b, const int &par) -> void {
if (par == 0) {
swap(a, b);
}
schedule(at[a], at[b]);
queries.push_back({{a, b}, par});
};
auto handle = [&]() -> void {
vector<int> res = visit();
int m = queries.size();
int a, b, par;
};
for (int k = 2; k <= n; k *= 2) {
for (int j = k/2; j > 0; j /= 2) {
for (int i = 0; i < n; i++) {
int l = i ^ j;
if (l > i) {
query(i, l, i & k);
}
}
handle();
}
}
reverse(all(at));
answer(at);
}
