#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, 1);
int prv = 1, now;
for (int i = 1; i < N; i++) {
now = UniqueCount(0, i);
//printf("%d: %d %d\n", i, prv, now);
if (prv >= now) ret[i] = 0;
prv = now;
}
prv = 1;
for (int i = N-2; i >= 0; i--) {
now = UniqueCount(i, N-1);
if (prv >= now) ret[i] = 0;
prv = now;
}
//for (int i = 0; i < N; i++) printf("%d ", ret[i]);
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Correct : C = 2 |
2 |
Correct |
5 ms |
256 KB |
Correct : C = 8 |
3 |
Correct |
5 ms |
384 KB |
Correct : C = 48 |
4 |
Correct |
6 ms |
384 KB |
Correct : C = 98 |
5 |
Correct |
6 ms |
256 KB |
Correct : C = 98 |
6 |
Correct |
5 ms |
384 KB |
Correct : C = 152 |
7 |
Correct |
5 ms |
464 KB |
Correct : C = 198 |
8 |
Correct |
6 ms |
384 KB |
Correct : C = 298 |
9 |
Correct |
6 ms |
384 KB |
Correct : C = 354 |
10 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
11 |
Correct |
6 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 |
5 ms |
464 KB |
Correct : C = 398 |