#include <bits/stdc++.h>
#include "unique.h"
using namespace std;
vector<int> PickUnique(int n) {
vector<int> ans(n, 1);
int last = 0;
for (int i = 0; i < n; ++i) {
int curr = UniqueCount(0, i);
if (curr <= last) {
ans[i] = 0;
}
last = curr;
}
last = 0;
for (int i = n - 1; i >= 0; --i) {
int curr = UniqueCount(i, n - 1);
if (curr <= last) {
ans[i] = 0;
}
last = curr;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Correct : C = 4 |
2 |
Correct |
2 ms |
248 KB |
Correct : C = 10 |
3 |
Correct |
2 ms |
376 KB |
Correct : C = 50 |
4 |
Correct |
2 ms |
248 KB |
Correct : C = 100 |
5 |
Correct |
2 ms |
248 KB |
Correct : C = 100 |
6 |
Correct |
2 ms |
296 KB |
Correct : C = 154 |
7 |
Correct |
2 ms |
376 KB |
Correct : C = 200 |
8 |
Correct |
2 ms |
376 KB |
Correct : C = 300 |
9 |
Correct |
2 ms |
376 KB |
Correct : C = 356 |
10 |
Correct |
2 ms |
504 KB |
Correct : C = 400 |
11 |
Correct |
2 ms |
376 KB |
Correct : C = 400 |
12 |
Correct |
2 ms |
376 KB |
Correct : C = 400 |
13 |
Correct |
2 ms |
376 KB |
Correct : C = 400 |
14 |
Correct |
2 ms |
376 KB |
Correct : C = 400 |
15 |
Correct |
2 ms |
376 KB |
Correct : C = 400 |