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