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