# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951620 | phoenix0423 | 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;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
void solve(int n){
vector<int> p(n), ans(n, -1);
iota(p.begin(), p.end(), 1);
int prv = 0;
for(int i = 0; i < n; i++){
int cur = publish(p);
if(i){
ans[(n - 1 - (cur - prv)) / 2] = p[n - 1];
}
prv = cur;
p.pb(p.front());
p.erase(p.begin());
}
for(int i = 0; i < n; i++){
if(ans[i] == -1){
ans[i] = p[n - 1];
break;
}
}
answer(ans);
}