This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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... |