#include <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int n) {
int a[n + 1][2];
vector<int> order;
for (int i = 1; i <= n; i ++){
order.clear();
for (int j = i; j < i + n; j ++){
int val = j % n;
if (val == 0)
val = n;
order.push_back(val);
}
a[order[0]][0] = a[order.back()][1] = publish(order);
}
order.resize(n);
for (int i = 1; i <= n; i ++){
int d = -a[i][0] + a[i][1];
d += n;
d /= 2;
int pos = n - d - 1;
order[pos] = i;
}
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... |