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