# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086397 | vjudge1 | Art Collections (BOI22_art) | C++17 | 1138 ms | 1708 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<algorithm>
using namespace std;
void solve(int n) {
vector<int> order(n);
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;
rotate(order.begin()+j, order.begin()+j+1, order.end());
int qq = publish(order);
int delta = curr - qq;
int x1 = (sz+delta)/2;
int x2 = sz - x1;
//assert(x1+x2 == sz);
//assert(x1-x2 == delta);
int correct_pos = n - x2 - 1;
rotate(order.begin()+correct_pos, order.begin()+n-1, order.end());
curr -= x1;
}
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... |