#include <bits/stdc++.h>
#include "unique.h"
using namespace std;
int toN[205], fr0[205];
vector<int> ans;
vector<int> PickUnique(int N) {
ans.resize(N);
for (int i = 0; i < N; i++) {
fr0[i] = UniqueCount(0, i);
}
for (int i = 0; i < N; i++) {
toN[i] = UniqueCount(i, N-1);
}
for (int i = 1; i < N-1; i++) {
if (fr0[i] - fr0[i-1] == 1 && toN[i] - toN[i+1] == 1) ans[i] = 1;
}
if (toN[0] - toN[1] == 1) ans[0] = 1;
if (fr0[N-1] - fr0[N-2] == 1) ans[N-1] = 1;
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Correct : C = 4 |
2 |
Correct |
4 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 |
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 |
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 |
5 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 |