이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 );
}
if( shift_max < 0 )
return true;
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... |