# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127710 | Dr_Cow | 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 <bits/stdc++.h>
#include "gondola.h"
int valid(int n, int inputSeq[]){
int ip=-1;
for (int i=0;i<n;i++){
if (inputSeq[i]<=n){
ip=i;break;
}
}
if (ip==-1) return 1;
else {
n[ip]=inputSeq[ip];
for (int i=ip+1;i<n;i++) {
n[i]=n[i-1]+1;
if (n[i]>n) n[i]-=n;
}
for (int i=ip-1;i>=0;i--){
n[i]=n[i+1]-1;
if (n[i]<=0) n[i]+=n;
}
}
for (int i=0;i<n;i++)
if (inputSeq[i]<=n && inputSeq[i]!=n[i]) return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}