| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1007459 | kebine | Art Collections (BOI22_art) | C++17 | 1269 ms | 968 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;
#define pb push_back
#define pi pair<int, int>
#define endl '\n'
#define all(v) v.begin(), v.end()
#define fr(m,n,k) for(int m=n;m<=k;m++)
#define vi vector<int>
int n;
void solve(int N) {
n = N;
vector<int> v; fr(i, 1, n) v.pb(i);
vector<pi> is;
int has[n + 2] = {};
fr(i, 1, n) {
int x;
has[i] = publish(v);
x = *v.begin();
v.pb(x); v.erase(v.begin());
}
has[n + 1] = has[1];
fr(i, 1, n) {
is.pb({has[i + 1] - has[i], i});
}
sort(is.rbegin(), is.rend());
vi an(n);
fr(i, 0, n - 1) {
auto [_, pos] = is[i];
an[i] = pos;
}
answer(an);
}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... | ||||
