# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978355 | 2024-05-09T07:00:44 Z | Amaarsaa | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> //#include "gondola.h" using namespace std; int valid(int n, int a[]) { int cnt = 0, mn = n, ind = 0; for (int i = 0; i < n; i ++) { if ( a[i] <=n) { cnt ++; if ( mn >= a[i]) { mn = a[i]; ind = i; } } } sort ( a + 1, a + n + 1); for (int i = 1; i < n; i ++) if ( a[i] == a[i - 1]) return 0; if ( cnt == 0) return 1; int last = 0; for (int j = 0; j < n; j ++) { if ( a[ind] > last) { last = a[ind]; cnt --; } ind = (ind + 1) % n; } if ( cnt == 0) return 1; return 0; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }