# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572695 | dolphingarlic | Art Collections (BOI22_art) | C++17 | 1828 ms | 612 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"
void solve(int N) {
std::vector<int> o(N), q(N);
for (int i = 0; i < N; i++) o[i] = i + 1;
for (int i = 0; i < N; i++) {
q[i] = publish(o);
for (int j = 0; j < N; j++) o[j] = o[j] % N + 1;
}
for (int i = 0; i < N; i++)
o[(q[i] - q[(i + 1) % N] + N) / 2] = i + 1;
answer(o);
}
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... |