# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636390 | Darren0724 | 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(int n){
vector<int> rec(n+2);
for(int i=1;i<=n;i++){
vector<int> v;
for(int j=i;j<=n;j++){
v.push_back(j);
}
for(int j=1;j<i;j++){
v.push_back(j);
}
rec[i]=publish(v);
}
vector<int> ans(n);
for(int i=1;i<=n;i++){
int k=rec[i+1]-rec[i];
k=2*(n-1)-k;
k/=2;
k--;
ans[k]=i;
}
answer(ans);
}