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