# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672142 | mseebacher | 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;
typedef long long ll;
typedef vector<int> vi;
#define MAXI (int)1e5
int valid(int n,int inputSeq[]){
map<int,bool> m;
int last = -1;
for(int i = 0;i<n;i++){
if(m[inputSeq[i]]){
return 0;
}else{
m.insert({inputSeq[i],1});
if(last == -1){
if(inputSeq[i] <= n){
last = inputSeq[i];
}
}else{
if(inputSeq[i] < last){
return 0;
}else{
if(inputSeq[i] == n){
last = 0;
}
if(inputSeq[i] < n) last = inputSeq[i];
}
}
}
}
return 1;
}