#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 sorted = 1;
while(last_ans > 0){
int x = order[sorted];
order.erase(order.begin() + sorted);
order.insert(order.begin(), x);
int a = last_ans;
int b = publish(order);
int k = (sorted-a+b)/2;
int hafo = b-k;
order.erase(order.begin());
order.insert(order.begin()+k, x);
last_ans = hafo;
sorted++;
}
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... |