# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598968 | Vanilla | Art Collections (BOI22_art) | C++17 | 1876 ms | 480 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 <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int n) {
vector <int> sum;
for (int i = 0; i < n; i++){
vector <int> order;
for (int j = 0; j < n; j++){
order.push_back((i + j) % n + 1);
}
sum.push_back(publish(order));
// cout << sum.back() << "\n";
}
vector <int> rs(n);
for (int i = 0; i < n; i++){
int j = (i == n - 1 ? 0: i + 1);
rs[(sum[i] - sum[j] + n - 1) / 2] = i + 1;
}
answer(rs);
}
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... |