#include "unique.h"
#include<bits/stdc++.h>
using namespace std;
int p[205], s[205];
vector<int> PickUnique(int N) {
for(int i=1;i<=N;i++) {
p[i] = UniqueCount(0, i-1);
s[i] = UniqueCount(i-1, N-1);
}
vector<int> R;
for(int i=1;i<=N;i++) {
R.push_back(p[i] == p[i-1] + 1 && s[i] == s[i+1] + 1);
}
return R;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
380 KB |
Correct : C = 154 |
7 |
Correct |
2 ms |
376 KB |
Correct : C = 200 |
8 |
Correct |
2 ms |
380 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 |
504 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 |
508 KB |
Correct : C = 400 |