# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1132891 | rotated | List of Unique Integers (FXCUP4_unique) | C++20 | 0 ms | 0 KiB |
#include "unique.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
int* PickUnique(int N) {
int lcount[N];
int rcount[N];
int ans[N];
fill(ans,ans+N,1);
for (int i = 0; i < N; i++) {
lcount[i] = UniqueCount(0, i);
rcount[i] = UniqueCount(i, n - 1);
}
for (int i = 1; i < N; i++) {
if (UniqueCount(0,i) > UniqueCount(0,i-1)) ans[i] = 0;
}
for (int i = 0; i < N-1; i++) {
if (UniqueCount(0,i) > UniqueCount(0,i+1)) ans[i] = 0;
}
return ans;
}