# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1121215 | 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>
#include "art.h"
using namespace std;
void solve(int n) {
deque<int> a;
for(int i=1 ; i <= n ; i++)
a.push_back(i);
int ls=publish(a);
deque<int> ans;
for(int i=1 ; i < n ; i++){
int x=a.back();
a.pop_back();
a.push_front(x);
int nw=publish(a);
a+b=n-1
a-b=ls-nw
2a=n-1+ls-nw
ans.pb((ls-nw+n-1)/2);
}
ans.pb(a[0]);
answer(ans);
}