# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149055 | GojekKawe (#200) | 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>
using namespace std;
int PickUnique (int N){
int U[N];
memset(U,0,N);
if(UniqueCount(0,N-1)==UniqueCount(0,N-2)+1){
U[N-1]=1;
}
if(UniqueCount(0,N-1)==UniqueCount(1,N-1)+1){
U[0]=1;
}
for(int i=N-2; i>0;i--){
if(UniqueCount(0,i)==UniqueCount(0,i-1)+1){
if(UniqueCount(i,N-1)==UniqueCount(i+1,N-1)+1){
U[i]=1;
}
}
}
return U;
}
int main(){
int N;
cin>>N;
PickUnique(N);
}