# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714240 | vjudge1 | 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 <art.h>
#include <bits/stdc++.h>
using namespace std;
void solve(int N){
vector<int> a(N);
for(int i=0 ; i<N ; i++){
a[i] = i + 1;
}
int now = publish(a);
if(now == 0){
answer(a);
}
set<pair<int , int>> ch;
for(int i=0 ; i<N ; i++){
for(int j=i+1 ; j<N ; j++){
if(ch.count({a[i] , a[j]})){
continue;
}
swap(a[i] , a[j]);
ch.ins(a[i] , a[j]);
int deyer1 = publish(a);
if(deyer1 < now){
now = deyer1;
}
else{
swap(a[i] , a[j]);
}
}
}
answer(a);
}