# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982428 | Aiperiii | Art Collections (BOI22_art) | C++17 | 1229 ms | 1636 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"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
void solve(int N){
vector <int> ord,l(N),res(N);
for(int i=1;i<=N;i++)ord.pb(i);
for(int i=0;i<N;i++){
l[i]=publish(ord);
ord.pb(ord.front());
ord.erase(ord.begin());
}
for(int i=0;i<N;i++){
int k=(-N+1+l[i]+l[(i+1)%N])/2;
int pos=l[i]-k;
res[pos]=i+1;
}
answer(res);
}
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... |