# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148757 | 이 대회 미분 되나요? (#200) | List of Unique Integers (FXCUP4_unique) | C++17 | 5 ms | 384 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 <algorithm>
#include <cstdio>
using namespace std;
std::vector<int> PickUnique(int N) {
//UniqueCount(0, N-1);
//UniqueCount(1, N-2);
vector<int> ret(N, 0);
int l = 1, r = UniqueCount(1, N-1);
for (int i = 2; i < N; i++) {
int nl = UniqueCount(0, i-1);
int nr = UniqueCount(i, N-1);
if (nl == l+1 && nr == r-1) {
ret[i-1] = 1;
}
//printf("%d / l: %d, nl: %d / r: %d, nr: %d\n", i, l, nl, r, nr);
l = nl; r = nr;
}
//for (int i= 0; i < N; i++) printf("%d ", ret[i]);
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |