# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
748072 | vjudge1 | Art Collections (BOI22_art) | C++17 | 0 ms | 0 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>
using namespace std;
void solve(inr n){
vector<int> a(n);
iota(a.begin(), a.end(), 1);
int k = publish(a);
vector<int> ans(n);
for(int i=0;i<n;i++){
a.push_back(a.front());
a.erase(a.begin(), a.begin()+1);
int k1=publish(a);
ans[(n-1-k+k1)/2] = i + 1;
k = k1;
}
answer(ans);
return;
}