# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604283 | Plurm | Art Collections (BOI22_art) | C++17 | 107 ms | 280 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> order(N);
iota(order.begin(), order.end(), 1);
for (int it = N; it >= 1; it--) {
int idx = find(order.begin(), order.end(), N - it + 1) - order.begin();
order.erase(order.begin() + idx);
order.insert(order.begin(), N - it + 1);
int last = publish(order);
for (int i = 1; i < N; i++) {
swap(order[i - 1], order[i]);
int cur = publish(order);
// printf("PUBLISH got %d\n", cur);
if (cur >= last) {
swap(order[i - 1], order[i]);
break;
}
last = cur;
}
}
answer(order);
}
Compilation message (stderr)
# | 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... |