# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138912 | monkey133 | List of Unique Integers (FXCUP4_unique) | C++20 | 0 ms | 324 KiB |
#include <vector>
using namespace std;
int UniqueCount(int L, int R);
std::vector<int> PickUnique(int N)
{
int n = N;
vector<int> ans(n);
vector<int> pref(n + 5, 0), suff(n + 5, 0);
pref[0] = suff[n + 1] = 0, pref[1] = suff[n] = 1;
for (int i=1; i<n; ++i) pref[i+1] = UniqueCount(0, i);
for (int i=0; i<n-1; ++i) suff[i+1] = UniqueCount(i, n-1);
for (int i=1; i<=n; ++i) ans[i-1] = int(pref[i] >= pref[i-1] && suff[i] > suff[i+1]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |