# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108624 | Ariadna | 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>
using namespace std;
int valid(int n, int inputSeq[]) {
unordered_map<int, int> cnt;
for (int i = 0; i < n; ++i) cnt[inputSeq[i]]++;
if ((int)cnt.size() < n) return 0;
for (int i = 1; inputSeq[0]+i <= n; ++i) {
if (inputSeq[i] <= n && inputSeq[i] != inputSeq[0]+i) return 0;
}
for (int i = 1; inputSeq[0]-i > 0; ++i) {
if (inputSeq[n-i] <= n && inputSeq[n-i] != inputSeq[0]-i) return 0;
}
return 1;
}
/*int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
}
int countReplacement(int n, int inputSeq[]) {
}*/