#include <bits/stdc++.h>
#include "unique.h"
using namespace std;
int pre[202],post[202];
std::vector<int> PickUnique(int N) {
vector<int> v(N,0);
for (int i = 1; i <= N; i++){
pre[i] = UniqueCount(0,i-1);
post[i] = UniqueCount(i-1,N-1);
}
for (int i = 1; i <= N; i++){
if (pre[i] > pre[i-1] && post[i] > post[i+1]) v[i-1] = 1;
}
return v;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Correct : C = 4 |
2 |
Correct |
5 ms |
256 KB |
Correct : C = 10 |
3 |
Correct |
4 ms |
384 KB |
Correct : C = 50 |
4 |
Correct |
4 ms |
384 KB |
Correct : C = 100 |
5 |
Correct |
4 ms |
384 KB |
Correct : C = 100 |
6 |
Correct |
4 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 |
512 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 |
512 KB |
Correct : C = 400 |
13 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
14 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |
15 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |