#include "unique.h"
using namespace std;
int L[210], R[210];
std::vector<int> PickUnique(int N) {
int i;
for (i = 1; i <= N; i++) {
L[i] = UniqueCount(0, i - 1);
R[i] = UniqueCount(i - 1, N - 1);
}
L[0] = R[N + 1] = 0;
vector<int>Res(N);
for (i = 1; i <= N; i++) {
if (L[i] - L[i - 1] == 1 && R[i] - R[i + 1] == 1) {
Res[i-1] = 1;
}
}
return Res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Correct : C = 4 |
2 |
Correct |
6 ms |
384 KB |
Correct : C = 10 |
3 |
Correct |
5 ms |
384 KB |
Correct : C = 50 |
4 |
Correct |
5 ms |
384 KB |
Correct : C = 100 |
5 |
Correct |
5 ms |
384 KB |
Correct : C = 100 |
6 |
Correct |
5 ms |
384 KB |
Correct : C = 154 |
7 |
Correct |
5 ms |
384 KB |
Correct : C = 200 |
8 |
Correct |
5 ms |
512 KB |
Correct : C = 300 |
9 |
Correct |
5 ms |
384 KB |
Correct : C = 356 |
10 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |
11 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |
12 |
Correct |
5 ms |
436 KB |
Correct : C = 400 |
13 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
14 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
15 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |