# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722342 | 2023-04-11T18:57:04 Z | tvladm2009 | List of Unique Integers (FXCUP4_unique) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "unique.h" using namespace std; typedef long long ll; const int N_MAX = 200; int pref[N_MAX + 2], suff[N_MAX + 2]; bool answer[N_MAX + 2] int[] PickUnique(int N) { for (int i = 1; i <= N; i++) { pref[i] = UniqueCount(0, i - 1); } for (int i = N; i >= 1; i--) { suff[i] = UniqueCount(i - 1, N - 1); } for (int i = 1; i <= N; i++) { if (pref[i] == pref[i - 1] + 1 && suff[i] == suff[i + 1] + 1) { answer[i - 1] = 1; } else { answer[i - 1] = 0; } } return answer; }