# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867695 | TAhmed33 | Art Collections (BOI22_art) | C++17 | 1233 ms | 1656 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 <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve (int n) {
vector <int> arr;
for (int i = 1; i <= n; i++) {
arr.push_back(i);
}
int cur = publish(arr);
for (int i = 1; i < n; i++) {
if (cur == 0) break;
vector <int> u = arr;
u.erase(u.begin() + i);
u.insert(u.begin(), arr[i]);
int alpha = publish(u) - cur; alpha *= -1;
int z = i;
int pos = (z - alpha) / 2; int gg = (z + alpha) / 2;
u.erase(u.begin());
u.insert(u.begin() + pos, arr[i]);
arr = u; cur -= gg;
}
answer(arr);
}
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... |