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