# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782319 | 2023-07-13T19:29:29 Z | sofija6 | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> ///#include "gondola.h" using namespace std; int valid(int n, int inputSeq[]) { int pos=-1,cnt=n,cur; set<int> s; for (int i=0;i<n;i++) { if (s.count(inputSeq[i])) return 0; s.insert(inputSeq[i]); if (inputSeq[i]<=n) pos=i; } if (pos==-1) return 1; cur=inputSeq[pos]; while (cnt--) { if (inputSeq[pos]<=n && inputSeq[pos]!=cur) return 0; cur++; pos++; if (pos>=n) pos=0; if (cur>n) cur=1; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }