#include<bits/stdc++.h>
#include "art.h"
using namespace std;
#define pii pair<int,int>
void solve(int n){
    vector<int> perm(n);
    iota(perm.begin(),perm.end(), 1);
    vector<pii> results; 
    for(int i = 0; i < n; i++){
        int ans = publish(perm);
        vector<int> nPerm(n);
        results.push_back({ans, i});
        for(int j = 0; j < n; j++){
            nPerm[(j+1)%n] = perm[j];
        }
    }
    sort(results.rbegin(), results.rend());
    vector<int> res(n);
    for(int i = 0; i < n; i++){
        res[i] = results[i].second;
    }
    answer(res);
}
| # | 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... |