# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590098 | fabijan_cikac | 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;
const int MAXN = 4010;
int publish(vector<int> v){
int x; cin >> x; return x;
}
void answer(vector<int> v){
return;
}
int l[MAXN]; int bio[MAXN] = { 0 };
void solve(int N){
vector<int> sol; vector<int> v;
for (int i = 1; i <= N; ++i)
v.push_back(i);
for (int i = 0; i < N; ++i){
l[i] = publish(v); reverse(v.begin(), v.end());
v.pop_back(); v.push_back(i + 2);
}
for (int i = 0; i < N; ++i){
int x = 0;
while (l[x] - l[x - 1] != N - i - 1) ++x;
sol.push_back(x + 1); int kx = (x - 1 + N) % N; int cnt = 1;
while (kx != x){
l[kx] -= cnt; ++cnt; kx = (kx - 1 + N) % N;
}
}
answer(sol);
}