# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101880 | 0pt1mus23 | List of Unique Integers (FXCUP4_unique) | C++17 | 1 ms | 612 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;
#define ins insert
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define _ << " " <<
mt19937 rng(time(0));
const int mod = 1e9 +9,
sze = 5e3 +23,
inf = INT_MAX,
LL = 20;
std::vector<int> PickUnique(int n) {
vector<int> ans(n,0);
vector<int> pr(n+10,0);
vector<int> sf(n+10,0);
sf[0]=UniqueCount(0,n-1);
for(int i=0;i<n;i++){
int a=0;
int b=0;
int c=0;
int d=0;
if(i){
a = pr[i-1];
}
b = UniqueCount(0,i);
if(i+1<n){
d = UniqueCount(i+1,n-1);
}
c = sf[i];
if(a<b && c>d){
ans[i]=1;
}
pr[i]=b;
sf[i+1]=d;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |