# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588868 | snasibov05 | 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"
#include <bits/stdc++.h>
int valid(int n, int inputSeq[]){
int mni = 0;
set<int> st;
for (int i = 0; i < n; ++i){
st.insert(inputSeq[i]);
if (inputSeq[i] < inputSeq[mni]) mni = i;
}
if (inputSeq[mni] > n) return 1;
if (st.size() < n) return 0;
int k = mni - 1, x = inputSeq[mni] - 1;
while (x > 0) {
if (k == -1) k = n-1;
if (inputSeq[k] != x && inputSeq[k] <= n) return 0;
inputSeq[k] = x;
k--, x--;
}
k = mni + 1, x = inputSeq[mni] + 1;
while (x <= n){
if (k == n) k = 0;
if (inputSeq[k] != x && inputSeq[k] <= n) return 0;
inputSeq[k] = x;
k++, x++;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}