# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148639 | Dopatii (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 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 pref[100005], suff[100005];
bool ok[100005];
std::vector<int> PickUnique(int N) {
pref[0] = 1;
for(int i = 1; i < N ; ++i) pref[i] = UniqueCount(0, i);
suff[N - 1] = 1;
for(int i = N - 2; i >= 0 ; --i) suff[i] = UniqueCount(i, N - 1);
for(int i = 0; i < N ; ++i) ok[i] = 1;
for(int i = 1; i < N ; ++i) if(pref[i] <= pref[i - 1]) ok[i] = 0;
for(int i = N - 2; i >= 0 ; --i) if(suff[i] <= suff[i + 1]) ok[i] = 0;
vector <int> sol;
for(int i = 0; i < N ; ++i) sol.push_back(ok[i]);
return sol;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |