#include "unique.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> PickUnique(int N)
{
vector<int> ans, pre(N + 2, 0), suf(N + 2, 0);
for (int i = 1; i <= N; i++)
{
pre[i] = UniqueCount(0, i - 1);
suf[i] = UniqueCount(i - 1, N - 1);
}
for (int i = 1; i <= N; i++)
ans.push_back(pre[i] > pre[i - 1] && suf[i] > suf[i + 1]);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Correct : C = 4 |
2 |
Correct |
2 ms |
376 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 |
376 KB |
Correct : C = 100 |
6 |
Correct |
2 ms |
376 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 |
376 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 |
504 KB |
Correct : C = 400 |
15 |
Correct |
2 ms |
376 KB |
Correct : C = 400 |