# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955085 | 4QT0R | 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 <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
int valid(int n, int inputSeq[]){
set<int> s(inputSeq,inputSeq+n);
if ((int)s.size()<n)return 0;
pii mn={n+1,-1};
for (int i = 0; i<n; i++){
if (inputSeq[i]<mn.first)mn={inputSeq[i],i};
}
int cur=mn.first;
for (int i = mn.second+1; i<n; i++){
if (inputSeq[i]<=n && inputSeq[i]!=++cur)return 0;
}
for (int i = 0; ++cur<=n; i++){
if (inputSeq[i]<=n && inputSeq[i]!=cur)return 0;
}
return 1;
}