# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232002 | Blerargh | List of Unique Integers (FXCUP4_unique) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "unique.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;
}