# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986572 | makrav | Art Collections (BOI22_art) | C++17 | 1241 ms | 1736 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> ord(n);
for (int i = 0; i < n; i++) ord[i] = i + 1;
int ans = publish(ord);
vector<int> answ(n);
for (int j = n; j >= 2; j--) {
vector<int> neww;
for (int i = j; i <= n; i++) neww.push_back(i);
for (int i = 1; i < j; i++) neww.push_back(i);
int neww_a = publish(neww);
int lol = (neww_a - ans + n - 1) / 2;
answ[lol] = j;
ans = neww_a;
}
for (int j =0; j < n; j++) if (answ[j] == 0) answ[j] = 1;
answer(answ);
}
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... |