이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "gondola.h"
#include <bits/stdc++.h>
int valid(int n, int inputSeq[]){
int mni = 0;
for (int i = 0; i < n; ++i){
if (inputSeq[i] < inputSeq[mni]) mni = i;
}
if (mni > n) return 1;
int k = mni - 1, x = inputSeq[mni] - 1;
while (x > 0) {
if (k == -1) k = n-1;
if (inputSeq[k] != x && inputSeq[k] <= n) return 0;
inputSeq[k] = x;
k--, x--;
}
k = mni + 1, x = inputSeq[mni] + 1;
while (x <= n){
if (k == n) k = 0;
if (inputSeq[k] != x && inputSeq[k] <= n) return 0;
inputSeq[k] = x;
k++, x++;
}
return 1;
}
//----------------------
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... |