#include "unique.h"
std::vector<int> PickUnique(int N) {
int c = UniqueCount(0, N - 1);
std::vector<int>L(N);
std::vector<int>R(N);
L[N-1] = R[0] = c;
for (int i = 1; i < N - 1; i++)L[i] = UniqueCount(0, i);
for (int j = N - 2; j >= 0; j--)R[j] = UniqueCount(j, N - 1);
std::vector <int> out(N);
out[0] = R[0] > R[1];
for (int i = 1; i < N-1; i++) {
if (R[i] > R[i + 1] && L[i - 1] < L[i])out[i] = 1;
}
out[N - 1] = L[N - 1] > L[N - 2];
return out;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
304 KB |
Correct : C = 2 |
2 |
Correct |
7 ms |
256 KB |
Correct : C = 8 |
3 |
Correct |
5 ms |
128 KB |
Correct : C = 48 |
4 |
Correct |
5 ms |
304 KB |
Correct : C = 98 |
5 |
Correct |
5 ms |
256 KB |
Correct : C = 98 |
6 |
Correct |
6 ms |
384 KB |
Correct : C = 152 |
7 |
Correct |
6 ms |
384 KB |
Correct : C = 198 |
8 |
Correct |
6 ms |
384 KB |
Correct : C = 298 |
9 |
Correct |
6 ms |
512 KB |
Correct : C = 354 |
10 |
Correct |
5 ms |
512 KB |
Correct : C = 398 |
11 |
Correct |
5 ms |
512 KB |
Correct : C = 398 |
12 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
13 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
14 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
15 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |