# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102550 | Leonardo_Paes | Gondola (IOI14_gondola) | C++11 | 0 ms | 0 KiB |
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;
bool valid(int n, int vet[]){
int x=0;
bool ok=true;
for(int i=0; i<n; i++){
if(vet[i]>n or vet[i+1]>n){
continue;
}
else{
if(i==n-1){
if(vet[0]<vet[i]){
if(x==0){
x=1;
}
else{
ok=false;
}
}
}
else if(vet[i+1]<vet[i]){
if(x==0){
x=1;
}
else{
ok=false;
}
}
}
}
return ok;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
}
int countReplacement(int n, int inputSeq[]){
}