# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733668 | tudor | Art Collections (BOI22_art) | C++17 | 1437 ms | 840 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 <iostream>
#include <vector>
using namespace std;
vector < int > perm, a;
void solve ( int n ) {
a.resize ( n );
perm.resize ( n );
for ( int i = 1; i <= n; i++ )
perm[i - 1] = i;
int last = publish ( perm );
if ( last == 0 )
answer ( perm );
else {
int s = n * ( n + 1 ) / 2;
for ( int i = 1; i < n; i++ ) {
int x = perm[n - 1];
for ( int j = n - 1; j > 0; j-- )
perm[j] = perm[j - 1];
perm[0] = x;
int next = publish ( perm );
int inv = ( n + next - last - 1 ) / 2;
a[inv] = x;
s -= x;
last = next;
}
for ( int i = 0; i < n; i++ )
if ( a[i] == 0 )
a[i] = s;
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... |