# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604276 | Plurm | Art Collections (BOI22_art) | C++17 | 1 ms | 208 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 mx = -1;
int midx = -1;
for (int i = 0; i < it; i++) {
int num = order[i];
order.erase(order.begin() + i);
order.insert(order.begin(), num);
int cur = publish(order);
// printf("PUBLISH got %d\n", cur);
if (cur > mx) {
mx = cur;
midx = i;
}
order.erase(order.begin());
order.insert(order.begin() + i, num);
}
// printf("DBG %d %d\n", mx, midx);
swap(order[midx], order[it - 1]);
}
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... |