#include <bits/stdc++.h>
int publish(std::vector<int>);
void answer(std::vector<int>);
void solve(int N) {
  std::vector<int> front(N + 1);
  for (int i = 1; i <= N; ++i) {
    std::vector<int> a;
    for (int j = 1; j <= N; ++j) {
      if (i != j) {
        a.push_back(j);
      }
    }
    a.insert(a.begin(), i);
    front[i] = publish(a);
  }
  std::vector<int> ans = {1};
  for (int i = 2; i <= N; ++i) {
  	ans.insert(ans.begin() + (front[i] - front[1] + i - 1) / 2, i);
  }
  answer(ans);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |