| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 148382 | Torat (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 7 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"
#include <bits/stdc++.h>
using namespace std;
int get(int l,int r)
{
if (r<l)
return 0;
return UniqueCount(l,r);
}
vector<int> PickUnique(int n)
{
vector<int> ans(n);
for (int i=0;i<n;i++)
ans[i]=(get(0,i)-get(0,i-1)>0 && get(i,n-1)-get(i+1,n-1)>0);
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||