# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148880 | 오리버스부릉부릉 (#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 <vector>
#include <cstring>
using namespace std;
int l[201], r[201], x;
vector<int> vec;
std::vector<int> PickUnique(int N) {
memset(l, 0, sizeof(l));
memset(r, 0, sizeof(r));
for (int i = 0; i < N; i++) {
l[i] = UniqueCount(i, N - 1);
}
for (int i = N - 1; i >= 0; i--) {
r[i] = UniqueCount(0, i);
}
if (l[1] < l[0]) vec.push_back(1);
else vec.push_back(0);
for (int i = 1; i < N - 1; i++) {
if (l[i] > l[i + 1] && r[i] > r[i - 1]) vec.push_back(1);
else vec.push_back(0);
}
if (r[N-1] > r[N-2]) vec.push_back(1);
else vec.push_back(0);
return vec;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |