# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149078 | Little Piplup (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 ms | 512 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 "unique.h"
std::vector<int> PickUnique(int N) {
std::vector<int> ans(N);
int ct = UniqueCount(0, N-1);
int sum;
if((sum=(UniqueCount(1,N-1)+1))==ct)
{
ans[0]=1;
}
else
{
ans[0]=0;
}
if(UniqueCount(0,N-2)+1==ct)
{
ans[N-1]=1;
}
else
{
ans[N-1]=0;
}
int temp = ans[0];
for(int i=1; i<N-1; i++)
{
int tmp2 = UniqueCount(0,i), tmp3 = UniqueCount(i+1,N-1);
if(tmp2+tmp3==sum&&tmp2>temp)
{
ans[i]=1;
}
else
ans[i]=0;
temp = tmp2;
sum = tmp2+tmp3;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |