# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445582 | DavidDamian | Gondola (IOI14_gondola) | C++11 | 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>
#define debug(x) std::cout << #x << " = " << x << '\n'
int valid(int n, int inputSeq[])
{
int firstPos = -1;
int correctNumber = 0;
for (int i = 0; i < n; i++) {
if (inputSeq[i] <= n && firstPos == -1) {
firstPos = i;
correctNumber = inputSeq[i];
}
if (firstPos != -1) {
if (inputSeq[i] <= n && correctNumber != inputSeq[i]) {
return 0;
}
correctNumber = (correctNumber == n)? 1 : correctNumber + 1;
}
}
int bucket[250005];
memset(bucket, 0, sizeof(bucket));
for (int i = 0; i < n; i++) {
if (bucket[inputSeq[i]] == 1)
return 0;
bucket[inputSeq[i]] = 1;
}
return 1;
}