| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 148645 | Little Piplup (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 5 ms | 256 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> ans;
void fillvec(int L, int R, int ct);
std::vector<int> PickUnique(int N) {
ans.resize(N);
int ct = UniqueCount(0, N-1);
fillvec(0,N-1,ct);
return ans;
}
void fillvec(int L, int R, int ct)
{
if(L==R)
{
ans[L]=(ct==1);
return;
}
int mid = (L+R)/2;
int a = UniqueCount(L,mid), b = UniqueCount(mid+1,R);
int k = (a+b-ct)/2;
fillvec(L,mid,a-k); fillvec(mid+1,R,b-k);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||