# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578236 | alirezasamimi100 | Gondola (IOI14_gondola) | C++17 | 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 valid(int n, int inputSeq[])
{
int ls = -1, cnt = 0;
map<int, int> mp;
for(int i = 0; i < n; i++){
cnt++;
if(mp[inputSeq[i]]) return 0;
mp[inputSeq[i]] = 1;
if(inputSeq[i] <= n){
if(ls != -1 && (ls + cnt - 1) % n + 1 != inputSeq[i]) return 0;
ls = inputSeq[i];
cnt = 0;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}