#include <vector> #include "art.h" using namespace std; int n; int p; vector < int > a; vector < int > ans; vector < int > invs; void solve(int N) { n = N; a.resize(n); ans.resize(n); invs.resize(n); for(int i = 0; i < n; i++) { a[i] = i + 1; } for(int i = 1; i <= n; i++) { invs[i] = publish(a); for(int j = 0; j < n - 1; j++) { swap(a[j], a[j + 1]); } } for(int i = 1; i <= n; i++) { int nxt = i + 1; if(nxt == n + 1) nxt = 1; int x = invs[i] - invs[nxt]; int pos = (N + x - 1) / 2; ans[pos] = i; } answer(ans); }