#include <vector>
int n;
std::vector<int> h;
std::vector<int> minima_sums;
void init(int N, std::vector<int> H) {
n = N;
h = H;
minima_sums.reserve(N + 1);
minima_sums.push_back(0);
for (int i = 0; i < N; i++) {
bool left_ok = i == 0 || H[i - 1] > H[i];
bool right_ok = i + 1 == N || H[i + 1] > H[i];
minima_sums.push_back(minima_sums.back() + (left_ok && right_ok));
}
}
int max_towers(int L, int R, int D) {
if (L == R) return 1;
R += 1;
int total = minima_sums[R - 1] - minima_sums[L + 1];
if (h[L + 1] > h[L]) {
total += 1;
}
if (h[R - 2] > h[R - 1]) {
total += 1;
}
return total;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
205 ms |
1164 KB |
2nd lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
1st lines differ - on the 1st token, expected: '13', found: '16' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
1st lines differ - on the 1st token, expected: '13', found: '16' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
487 ms |
1808 KB |
Output is correct |
2 |
Correct |
620 ms |
1796 KB |
Output is correct |
3 |
Correct |
614 ms |
1804 KB |
Output is correct |
4 |
Correct |
793 ms |
1820 KB |
Output is correct |
5 |
Correct |
650 ms |
1776 KB |
Output is correct |
6 |
Correct |
581 ms |
1744 KB |
Output is correct |
7 |
Correct |
640 ms |
1804 KB |
Output is correct |
8 |
Correct |
574 ms |
1816 KB |
Output is correct |
9 |
Correct |
569 ms |
1816 KB |
Output is correct |
10 |
Correct |
803 ms |
1744 KB |
Output is correct |
11 |
Correct |
595 ms |
1744 KB |
Output is correct |
12 |
Correct |
717 ms |
1736 KB |
Output is correct |
13 |
Correct |
702 ms |
1836 KB |
Output is correct |
14 |
Correct |
0 ms |
208 KB |
Output is correct |
15 |
Correct |
0 ms |
208 KB |
Output is correct |
16 |
Correct |
0 ms |
208 KB |
Output is correct |
17 |
Correct |
9 ms |
1736 KB |
Output is correct |
18 |
Correct |
9 ms |
1736 KB |
Output is correct |
19 |
Correct |
9 ms |
1744 KB |
Output is correct |
20 |
Correct |
9 ms |
1744 KB |
Output is correct |
21 |
Correct |
8 ms |
1800 KB |
Output is correct |
22 |
Correct |
12 ms |
1836 KB |
Output is correct |
23 |
Correct |
9 ms |
1824 KB |
Output is correct |
24 |
Correct |
9 ms |
1804 KB |
Output is correct |
25 |
Correct |
9 ms |
1816 KB |
Output is correct |
26 |
Correct |
14 ms |
1736 KB |
Output is correct |
27 |
Correct |
0 ms |
208 KB |
Output is correct |
28 |
Correct |
0 ms |
208 KB |
Output is correct |
29 |
Correct |
0 ms |
208 KB |
Output is correct |
30 |
Correct |
0 ms |
208 KB |
Output is correct |
31 |
Correct |
0 ms |
208 KB |
Output is correct |
32 |
Correct |
0 ms |
260 KB |
Output is correct |
33 |
Correct |
0 ms |
208 KB |
Output is correct |
34 |
Correct |
0 ms |
208 KB |
Output is correct |
35 |
Correct |
0 ms |
208 KB |
Output is correct |
36 |
Correct |
1 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
222 ms |
648 KB |
1st lines differ - on the 1st token, expected: '7197', found: '8004' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
1st lines differ - on the 1st token, expected: '13', found: '16' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
205 ms |
1164 KB |
2nd lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |