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 "gondola.h"
#include <algorithm>
int valid( int n, int inputSeq[] ) {
int shift_min = n, shift_max = -1;
for( int i = 0 ; i < n ; i++ ){
if( inputSeq[i] > n )
continue;
int shift = (inputSeq[i] - 1 + n - i) % n;
shift_min = std::min( shift_min, shift );
shift_max = std::max( shift_max, shift );
}
return shift_min == shift_max;
}
//----------------------
int replacement( int n, int gondolaSeq[], int replacementSeq[] ) {
return -2;
}
//----------------------
int countReplacement( int n, int inputSeq[] ) {
return -3;
}
# | 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... |
# | 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... |