# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231875 | palpatinezw | List of Unique Integers (FXCUP4_unique) | C++17 | 5 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 <bits/stdc++.h>
#include "unique.h"
using namespace std;
int toN[205], fr0[205];
vector<int> ans;
vector<int> PickUnique(int N) {
ans.resize(N);
for (int i = 0; i < N; i++) {
fr0[i] = UniqueCount(0, i);
}
for (int i = 0; i < N; i++) {
toN[i] = UniqueCount(i, N-1);
}
for (int i = 1; i < N-1; i++) {
if (fr0[i] - fr0[i-1] == 1 && toN[i] - toN[i+1] == 1) ans[i] = 1;
}
if (toN[0] - toN[1] == 1) ans[0] = 1;
if (fr0[N-1] - fr0[N-2] == 1) ans[N-1] = 1;
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |