# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230307 | joaquin | Gondola (IOI14_gondola) | C++14 | 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 <gondola.h>
int vaued(int n,int inputSeq[])
{
int r=1:
for(int i=1;i<n;i++){
if(inputSeq[i]==1 && inputSeq[i-1]!=n){
r=0;
break;
}
else if(inputSeq[i-1]+1 != inputSeq[i]){
r=0;
break;
}
}
}
//-------------
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return -2;
}
//------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}