# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714354 | vjudge1 | Art Collections (BOI22_art) | C++17 | 21 ms | 208 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);
set<int> ch;
while(now > 0){
for(int i=N-1 ; i>=0 ; i--){
int ind = -1;
if(ch.count(i) > 0){
continue;
}
for(int j=i-1 ; j>=0 ; j--){
swap(a[i] , a[j]);
int deyer = publish(a);
if(deyer <= now){
ind = j;
swap(a[i] , a[j]);
now = deyer;
}
else{
swap(a[i] , a[j]);
break;
}
}
if(ind >= 0){
swap(a[i] , a[ind]);
ch.insert(ind);
}
}
}
answer(a);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |