#include "unique.h"
#include <bits/stdc++.h>
using namespace std;
int pref[100005], suff[100005];
bool ok[100005];
std::vector<int> PickUnique(int N) {
pref[0] = 1;
for(int i = 1; i < N ; ++i) pref[i] = UniqueCount(0, i);
suff[N - 1] = 1;
for(int i = N - 2; i >= 0 ; --i) suff[i] = UniqueCount(i, N - 1);
for(int i = 0; i < N ; ++i) ok[i] = 1;
for(int i = 1; i < N ; ++i) if(pref[i] <= pref[i - 1]) ok[i] = 0;
for(int i = N - 2; i >= 0 ; --i) if(suff[i] <= suff[i + 1]) ok[i] = 0;
vector <int> sol;
for(int i = 0; i < N ; ++i) sol.push_back(ok[i]);
return sol;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Correct : C = 2 |
2 |
Correct |
6 ms |
256 KB |
Correct : C = 8 |
3 |
Correct |
5 ms |
256 KB |
Correct : C = 48 |
4 |
Correct |
5 ms |
384 KB |
Correct : C = 98 |
5 |
Correct |
5 ms |
256 KB |
Correct : C = 98 |
6 |
Correct |
6 ms |
384 KB |
Correct : C = 152 |
7 |
Correct |
6 ms |
384 KB |
Correct : C = 198 |
8 |
Correct |
6 ms |
512 KB |
Correct : C = 298 |
9 |
Correct |
6 ms |
512 KB |
Correct : C = 354 |
10 |
Correct |
6 ms |
384 KB |
Correct : C = 398 |
11 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
12 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
13 |
Correct |
6 ms |
384 KB |
Correct : C = 398 |
14 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |
15 |
Correct |
6 ms |
512 KB |
Correct : C = 398 |