#include <bits/stdc++.h>
int publish(std::vector<int>);
void answer(std::vector<int>);
void solve(int N) {
std::vector<int> p(N);
std::iota(p.begin(), p.end(), 1);
auto comp = [&](int a, int b) {
std::vector<int> q;
for (int i = 1; i <= N; ++i) {
if (i != a and i != b) {
q.push_back(i);
}
}
q.push_back(a);
q.push_back(b);
int init = publish(q);
std::swap(q[N - 1], q[N - 2]);
int after = publish(q);
return init < after;
};
std::sort(p.begin(), p.end(), comp);
answer(p);
}
# | 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... |