# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282381 | 2020-08-24T11:17:08 Z | iliccmarko | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" using namespace std; int valid(int n, int p[]) { for(int i = 1;i<n;i++) { if(p[i]==1&&p[i-1]<n) return 0; if(p[i]!=p[i-1]-1&&p[i-1]<=n) return 0; } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]); { return 1; } int countReplacement(int n, int inputSeq[]) { return 1; }