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