# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588796 | ParsaEs | Art Collections (BOI22_art) | C++17 | 1684 ms | 636 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.
//InTheNameOfGOD
//PRS;)
#include "art.h"
#pragma GCC optimize("unroll-loops", "Ofast", "O3")
#include<bits/stdc++.h>
#define rep(i, l, r) for(ll i = l; i < r; i++)
#define per(i, l, r) for(ll i = r - 1; i >= l; i--)
typedef int ll;
using namespace std;
constexpr ll xn = 4e3;
ll a[xn], ans[xn];
void solve(ll n)
{
vector<ll> v(n);
rep(i, 0, n) v[i] = a[i] = i + 1, ans[i] = -1;
ll ls = publish(v), t = n - 1;
while(t--)
{
per(i, 0, n - 1) swap(a[i], a[i + 1]);
rep(i, 0, n) v[i] = a[i];
ll x = publish(v);
ans[(n - ls + x - 1) >> 1] = a[0], ls = x;
}
rep(i, 0, n) if(ans[i] < 0) ans[i] = a[n - 1];
rep(i, 0, n) v[i] = ans[i];
answer(v);
}
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... |