# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232001 | 2020-05-15T16:51:11 Z | Blerargh | List of Unique Integers (FXCUP4_unique) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int[] PickUnique(int N){ int ans[N], prevL=0, prevR=UniqueCounnt(0,N-1); memset(ans, 0, sizeof(ans)); for (int i=0; i<=N-1; i++){ int newL = UniqueCount(0,i); if (i!=N-1) int newR = UniqueCount(i+1,N-1); if (newL == prevL+1 && newR == prevR+1) { ans[i]=1; } prevL = newL; prevR = newR; } return ans; }