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