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