# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
652623 | ymm | Art Collections (BOI22_art) | C++17 | 1651 ms | 760 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>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 4000;
int st[N], ord[N];
int n;
void solve(int _N)
{
n = _N;
vector<int> vec(n);
iota(vec.begin(), vec.end(), 1);
Loop (_,0,n) {
st[vec[0]-1] = publish(vec);
int x = vec.back();
vec.pop_back();
vec.insert(vec.begin(), x);
}
Loop (i,0,n)
ord[i] = (st[i] - st[(i+1)%n] + (n-1))/2;
vector<int> ans(n);
Loop (i,0,n)
ans[ord[i]] = i+1;
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... |