# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581026 | KoD | Art Collections (BOI22_art) | C++17 | 1605 ms | 660 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 std::vector;
void solve(int N) {
vector<int> P(N), Q(N + 1), R(N);
std::iota(P.begin(), P.end(), 1);
for (int i = 0; i < N; ++i) {
Q[i] = publish(P);
std::rotate(P.begin(), P.begin() + 1, P.end());
}
Q[N] = Q[0];
for (int i = 0; i < N; ++i) {
R[(N - 1 - Q[i + 1] + Q[i]) / 2] = i + 1;
}
answer(R);
}
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... |