#include "unique.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 210;
int ps[MAXN][2];
vector<int> PickUnique(int N) {
for (int i = 0; i < N; i++)
{
ps[i+1][0] = UniqueCount(0, i);
ps[i+1][1] = UniqueCount(i, N - 1);
}
ps[0][0] = ps[N+1][1] = 0;
vector <int> res;
for (int i = 1; i <= N; i++)
{
if (ps[i][0] > ps[i-1][0] && ps[i][1] > ps[i+1][1])
res.push_back(1);
else
res.push_back(0);
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Correct : C = 4 |
2 |
Correct |
5 ms |
256 KB |
Correct : C = 10 |
3 |
Correct |
6 ms |
384 KB |
Correct : C = 50 |
4 |
Correct |
6 ms |
384 KB |
Correct : C = 100 |
5 |
Correct |
5 ms |
384 KB |
Correct : C = 100 |
6 |
Correct |
6 ms |
384 KB |
Correct : C = 154 |
7 |
Correct |
5 ms |
384 KB |
Correct : C = 200 |
8 |
Correct |
6 ms |
512 KB |
Correct : C = 300 |
9 |
Correct |
5 ms |
512 KB |
Correct : C = 356 |
10 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
11 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
12 |
Correct |
6 ms |
560 KB |
Correct : C = 400 |
13 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
14 |
Correct |
6 ms |
512 KB |
Correct : C = 400 |
15 |
Correct |
6 ms |
560 KB |
Correct : C = 400 |