# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573611 | eecs | Art Collections (BOI22_art) | C++17 | 1591 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 "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n) {
vector<int> arr(n), pos(n);
iota(arr.begin(), arr.end(), 1);
int x = publish(arr), o = x;
for (int i = 0; i < n; i++) {
rotate(arr.begin(), next(arr.begin()), arr.end());
int y = i + 1 == n ? o : publish(arr);
pos[i] = x - (x + y - n + 1) / 2, x = y;
}
vector<int> res(n);
for (int i = 0; i < n; i++) {
res[i] = find(pos.begin(), pos.end(), i) - pos.begin() + 1;
}
answer(res);
}
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... |