#include "art.h"
using namespace std;
void solve(int N) {
    vector<int> order;
    for(int i=1; i<=N; i++){
        order.push_back(i);
    }
    int last_ans = publish(order);
    int i=0;
    int j = 0;
    while(last_ans > 0){
        int i=0;
        while(i<N-1){
            swap(order[i], order[i+1]);
            int new_ans = publish(order);
            if(new_ans > last_ans){
                swap(order[i], order[i+1]);
            } else {
                last_ans = new_ans;
            }
            i++;
        }
        j++;
    }
    answer(order);
}
| # | 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... |