# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231271 | origami100 | List of Unique Integers (FXCUP4_unique) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
#include "unique.h"
using namespace std;
vector <int> PickUnique(int N){
vector <int> res;
for(int i = 0; i < n; i++){
res.push_back(1);
}
int cur, prev = 1;
for(int i = 1; i < n; i++){
cur = UniqueCount(0, i);
if(cur <= prev){
res[i] = 0;
}
}
prev = 1;
for(int i = n - 2; i >= 0; i--){
cur = UniqueCount(i, n - 1);
if(cur <= prev){
res[i] = 0;
}
}
return res;
}