| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 721624 | kas_s | Art Collections (BOI22_art) | C++17 | 98 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 <bits/stdc++.h>
#include "art.h"
#pragma GCC optimize("Ofast")
using namespace std;
void solve(int N) {
    vector<int> a;
    for (int i = 1; i <= N; i++) a.push_back(i);
    int inv = publish(a);
    int pos = N-1;
    while (inv) {
        if (pos == 0) pos = N-1;
        swap(a[pos], a[pos-1]);
        int prev = inv;
        inv = publish(a);
        if (inv > prev) {
            inv = prev;
            swap(a[pos], a[pos-1]);
        }
        pos--;
    }
    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... | ||||
