# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230278 | 2020-05-09T13:25:10 Z | DanerZein | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { set<int>s; int x=inputSeq[0]; s.insert(inputSeq[i]); for(int i=1;i<n;i++){ s.insert(inputSeq[i]); if(x==n){ if(inputSeq[i]===1){ x=1; } else return 0; } else{ if(x==inputSeq[i]-1){ x=inputSeq[i]; } else return 0; } } if(s.size()!=n) return 0; return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }