| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 587100 | Cyanmond | Art Collections (BOI22_art) | C++17 | 1573 ms | 912 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 <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define REP_3(i, l, r) for (int i = (l); i < (r); ++i)
#define RVP_3(i, l, r) for (int i = (r - 1); i >= (l); --i)
#define REP(i, N) REP_3(i, 0, N)
#define RVP(i, N) RVP_3(i, 0, N)
int Publish(vector<int> v) {
for (auto &e : v) ++e;
return publish(v);
}
void Answer(vector<int> v) {
for (auto &e : v) ++e;
answer(v);
exit(0);
}
void solve(int N) {
vector<int> order(N);
iota(ALL(order), 0);
vector<int> result(N);
REP(i, N) {
result[i] = Publish(order);
rotate(order.begin(), order.begin() + 1, order.end());
}
result.push_back(result[0]);
vector<int> ans(N);
REP(i, N) ans[((result[i] - result[i + 1]) + N - 1) / 2] = 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... | ||||
