#include "unique.h"
std::vector<int> ans;
void fillvec(int L, int R, int ct);
std::vector<int> PickUnique(int N) {
ans.resize(N);
int ct = UniqueCount(0, N-1);
if(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);
if((tmp2-((tmp2+UniqueCount(i+1,N-1)-ct)/2))>temp)
{
temp++;
ans[i]=1;
}
else
ans[i]=0;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Correct : C = 3 |
2 |
Correct |
5 ms |
256 KB |
Correct : C = 9 |
3 |
Incorrect |
6 ms |
384 KB |
Wrong |
4 |
Halted |
0 ms |
0 KB |
- |