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