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