# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086392 | vjudge1 | Art Collections (BOI22_art) | C++17 | 0 ms | 344 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"
using namespace std;
void solve(int n) {
vector<int> order(n), order2;
for (int i = 0; i < n; ++i) order[i] = i+1;
int curr = publish(order);
for (int sz = 1; sz < n; ++sz) {
int j = n-1-sz;
order2 = order;
for (int k = j+1; k < n; ++k) order2[k] -= 1;
order2[j] = n;
int qq = publish(order2);
int delta = curr - qq;
int correct_pos = n - delta;
int gt = 0;
for (int k = j+1; k < n; ++k) {
if (order[k] >= correct_pos) ++gt, order[k] -= 1;
}
order[j] = correct_pos;
curr -= gt;
}
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... |