# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954260 | PM1 | Art Collections (BOI22_art) | C++17 | 0 ms | 344 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;
const int mxn=4e3+5;
void solve(int n){
vector<int>v,ans;
int a[mxn],b[mxn];
for(int i=1;i<=n;i++){
v.push_back(i);
}
int pre=publish(v);
int y=pre;
for(int i=1;i<n;i++){
v.insert(v.begin(),v.back());
v.pop_back();
int x=publish(v);
a[v[0]]=x-pre;
a[v[0]]=(a[v[0]]-n+1)/2;
b[a[v[0]]]=v[0];
pre=x;
}
a[v.back()]=y-pre;
a[v.back()]=(a[v.back()-n+1])/2;
b[a[v.back()]]=v.back();
for(int i=1;i<=n;i++)
ans.push_back(b[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... |