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