# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721625 | dxz05 | Art Collections (BOI22_art) | C++17 | 1489 ms | 872 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> p(N);
iota(p.begin(), p.end(), 1);
vector<int> result(N, -1);
int was = publish(p);
for (int i = 1; i < N; i++){
p.erase(p.begin());
p.push_back(i);
int now = publish(p);
int d = now - was;
int x = (d + N - 1) / 2;
result[N - 1 - x] = i;
was = now;
}
int pos_n = find(result.begin(), result.end(), -1) - result.begin();
result[pos_n] = N;
answer(result);
}
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... |