# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583388 | _Avocado_ | 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>
#define int int64_t
using namespace std;
#include "art.h"
void solve(int N){
vector<int>cur(N);
iota(cur.begin(), cur.end(), 1);
vector<int>beg(N);
vector<int>end(N);
for(int i = 0; i<N; ++i){
publish(cur);
int x; cin>>x;
beg[cur[0]-1] = x;
end[cur[N-1]-1] = x;
rotate(cur.begin(), cur.end()-1, cur.end());
}
vector<int>fred(N);
int add = 1-(N%2);
for(int i = 0; i<N; ++i){
int pos = ((beg[i]-end[i]+add)/2) + ((N-1)/2);
fred[pos] = i+1;
}
answer(fred);
}
/*
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin ("input.in");
//ofstream cout ("output.out");
cout<<'\n';
}
*/