# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012222 | zsombor | Art Collections (BOI22_art) | C++17 | 991 ms | 1348 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"
using namespace std;
int n, inv;
vector <int> ans;
int query(int x) {
vector <int> v(n);
for (int i = 0; i < x - 1; i++) v[i] = i + 1;
for (int i = x - 1; i < n - 1; i++) v[i] = i + 2;
v[n - 1] = x;
return publish(v);
}
void get(int x) {
int q = (x < n ? query(x) : inv);
int k = (inv - q + n - x) / 2;
for (int& i : ans) {
if (i) continue;
if (!k) { i = x; break; }
k--;
}
}
void solve(int N) {
n = N;
ans.assign(n, 0);
inv = query(n);
for (int i = 1; i <= n; i++) get(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... |