# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711493 | becaido | Art Collections (BOI22_art) | C++17 | 1636 ms | 656 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 <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int N) {
vector<int> v(N), ans(N);
iota(v.begin(), v.end(), 1);
int last = publish(v);
for (int i = 1; i < N; i++) {
v.insert(v.begin(), v.back());
v.pop_back();
int cur = publish(v), delta = cur - last, rk = (delta + N + 1) / 2;
ans[rk - 1] = N - i + 1;
last = cur;
}
for (int &x : ans) if (!x) x = 1;
answer(ans);
}
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... |