# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
926493 | math_rabbit_1028 | Art Collections (BOI22_art) | C++17 | 1140 ms | 1900 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> ans(N);
vector<int> ord(N+1);
int a, b, st;
vector<int> vec;
for (int i = 1; i <= N; i++) vec.push_back(i);
st = a = publish(vec);
for (int i = 1; i <= N; i++) {
vec.erase(vec.begin());
vec.push_back(i);
if (i < N) b = publish(vec);
else b = st;
ord[i] = (a-b+N-1)/2;
assert(0 <= ord[i] && ord[i] < N);
a = b;
}
for (int i = 1; i <= N; i++) ans[ord[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... |