#include "unique.h"
int pre[222], suf[222];
std::vector<int> PickUnique(int N) {
for(int i=1; i<=N; i++){
pre[i]=UniqueCount(0, i-1);
suf[i]=UniqueCount(i-1, N-1);
}
std::vector<int> dap(N,0);
for(int i=1; i<=N; i++){
if(pre[i]==pre[i-1]+1 && suf[i]==suf[i+1]+1) dap[i-1]=1;
}
return dap;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Correct : C = 4 |
2 |
Correct |
6 ms |
256 KB |
Correct : C = 10 |
3 |
Correct |
5 ms |
344 KB |
Correct : C = 50 |
4 |
Correct |
5 ms |
304 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 |
384 KB |
Correct : C = 300 |
9 |
Correct |
5 ms |
512 KB |
Correct : C = 356 |
10 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
11 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |
12 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
13 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |
14 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |
15 |
Correct |
5 ms |
512 KB |
Correct : C = 400 |