# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868722 | Ludissey | Art Collections (BOI22_art) | C++17 | 0 ms | 344 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;
vector<int> order;
int N;
int findNumb(int x) {
for (int i = 0; i < N; i++) if(order[i]==x) return i;
}
void findOrder(int l, int r){
if(r-l<2) return;
vector<int> new_order=order;
int i=l;
int minOrder=publish(order);
int iOrder=i;
for (int j = i+1; j < r; j++)
{
swap(new_order[j-1],new_order[j]);
int val=publish(new_order);
if(val<minOrder) {
minOrder=val;
iOrder=j;
}
}
for (int j = l; j < iOrder; j++)
{
swap(order[j],order[j+1]);
}
findOrder(l, iOrder);
findOrder(iOrder+1, r);
}
void solve(int n) {
N=n;
order.resize(N);
for (int i = 0; i < N; i++) order[i]=i+1;
vector<bool> skip(n,false);
findOrder(0,N);
answer(order);
}
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... |