# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595614 | ThegeekKnight16 | Art Collections (BOI22_art) | C++17 | 0 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;
void solve(int N)
{
vector<int> v;
int pos[N+10];
for (int i = 1; i <= N; i++) {v.push_back(i); pos[i] = i-1;}
int lastPermut = publish(v);
for (int i = 2; i <= N; i++)
{
while (true)
{
swap(v[pos[i]], v[pos[i]-1]);
int newPermut = publish(v);
if (newPermut > lastPermut) {swap(v[pos[i]], v[pos[i]-1]); break;}
pos[v[pos[i]-1]]++;
pos[i]--;
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... |