# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595647 | ThegeekKnight16 | Art Collections (BOI22_art) | C++17 | 95 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>
using namespace std;
const int MAXN = 4e3 + 10;
int pos[MAXN];
void solve(int N)
{
vector<int> v;
for (int i = 1; i <= N; i++) {v.push_back(i); pos[i] = i-1;}
int lastPermut = publish(v);
for (int i = 1; i < N; i++)
{
int x = v[i];
while (pos[x] > 0)
{
swap(v[pos[x]], v[pos[x]-1]);
int newPermut = publish(v);
if (newPermut > lastPermut) {swap(v[pos[x]], v[pos[x]-1]); break;}
pos[v[pos[x]]]++;
pos[x]--;
lastPermut = newPermut;
}
}
answer(v);
}
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... |