# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597785 | yanndev | Art Collections (BOI22_art) | C++17 | 1589 ms | 636 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> posOfVal(n, -1);
// 0 indexed ranks
// newInv = oldInv - (rank) + (n - rank - 1)
// newInv = oldInv - (2 * rank) + (n - 1)
// rank = -(newInv - oldInv - (n - 1)) / 2
vector<int> ls (n);
for (int i = 0; i < n; i++)
ls[i] = i + 1;
int firstInv = publish(ls);
int oldInv = firstInv;
for (int i = 0; i < n; i++) {
rotate(ls.begin(), ls.begin() + 1, ls.end());
int newInv = firstInv;
if (i + 1 < n)
newInv = publish(ls);
posOfVal[i + 1] = -(newInv - oldInv - (n - 1)) / 2;
oldInv = newInv;
}
vector<int> ans (n, -1);
for (int i = 1; i <= n; i++)
ans[posOfVal[i]] = i;
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... |