# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157137 | the_ZHER | Art Collections (BOI22_art) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int N){
vector<int>ans;
int pos[5000];
for(int i=1;i<=n;i++){
ans.push_back(i);
pos[i]=i-1;
}
int was[5000];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(was[j]==1){
continue;
}
pos[ans[0]]=ans[j];
swap(ans[pos[j]],ans[0]);
pos[j]=0;
int x=publish(v);
pos[ans[0]]=n-i;
pos[ans[n-i]]=0;
swap(ans[0],ans[n-i]);
}
}
answer(ans);
}