이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include<gondola.h>
using namespace std ;
#define endl '\n'
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MOD 1000000007
int occ[100005];
int valid(int n, int a[])
{
for(int i=0;i<n;i++)
{
occ[a[i]]++;
}
for(int i=0;i<n;i++)
{
if(occ[a[i]]>1)return 0;
}
for(int i=1;i<n;i++)
{
if(a[i]<=n && a[i]>a[i-1]+1)
return 0;
}
return 1;
}
int replacement( int n, int gondolaSeq[],int replacementSeq []){return 0;}
int countReplacement(int n, int inputSeq[]){return 0;}
# | 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... |