# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974578 | hariaakas646 | 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 valid(int n, int inputSeq[])
{
pii mi = mp(2e9, 1e9);
frange(i, n) {
mi = min(mi, mp(inputSeq[i], i));
}
if(mi.f > n) return 1;
int v = mi.f;
forr(i, mi.s+1, n) {
if(inputSeq[i] <= n) {
if(inputSeq[i] > v) v = inputSeq[i];
else return 0;
}
}
forr(i, 0, mi.s) {
if(inputSeq[i] <= n) {
if(inputSeq[i] > v) v = inputSeq[i];
else return 0;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}