# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
720737 | NeroZein | Art Collections (BOI22_art) | C++17 | 1617 ms | 748 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) {
int n = N;
vector<int> Ans(n);
for (int i = 1; i <= n; ++i) {
vector<int> order = {i};
for (int j = 1; j <= n; ++j) {
if (j != i) {
order.push_back(j);
}
}
int org = publish(order);
order.clear();
for (int j = 1; j <= n; ++j) {
if (j != i) {
order.push_back(j);
}
}
order.push_back(i);
int New = publish(order);
int x = (n - 1 - org + New) / 2;
int y = n - 1 - x;
Ans[y] = 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... |