# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982286 | Aiperiii | 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"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
void solve(int N){
vector <int> v;
for(int i=1;i<=N;i++)v.pb(i);
int x=publish(v);
if(!x){
answer(v);return;
}
else{
for(int i=0;i<N;i++){
for(int j=N-1;j>=i+1;j--){
swap(v[i],v[j]);
int cnt=publish(v);
if(cnt<x){
x=cnt;
if(x==0){
answer(v);return;
}
}
else {
swap(v[i],v[j]);
break;
}
}
}
}
answer(v);
}
/*int main(){
int n;
cin>>n;
solve(n);
}*/