#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
int n, pre[200100], cnt[200100];
void init(int N, vector<int> H) {
for(int i = 1; i < N-1; i++)
pre[i]=pre[i-1]+(H[i]>max(H[i-1],H[i+1]));
pre[n-1] = pre[n-2];
}
int max_towers(int L, int R, int D) {
if(R-L<2)
return 1;
return pre[R-1]-pre[L]+1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
309 ms |
936 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 |
1 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 |
1 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 |
477 ms |
1452 KB |
Output is correct |
2 |
Correct |
540 ms |
1360 KB |
Output is correct |
3 |
Correct |
659 ms |
1432 KB |
Output is correct |
4 |
Correct |
546 ms |
1448 KB |
Output is correct |
5 |
Correct |
644 ms |
1444 KB |
Output is correct |
6 |
Correct |
702 ms |
1476 KB |
Output is correct |
7 |
Correct |
765 ms |
1464 KB |
Output is correct |
8 |
Correct |
581 ms |
1444 KB |
Output is correct |
9 |
Correct |
571 ms |
1444 KB |
Output is correct |
10 |
Correct |
575 ms |
1452 KB |
Output is correct |
11 |
Correct |
571 ms |
1456 KB |
Output is correct |
12 |
Correct |
432 ms |
1444 KB |
Output is correct |
13 |
Correct |
732 ms |
1444 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 |
1488 KB |
Output is correct |
18 |
Correct |
13 ms |
1468 KB |
Output is correct |
19 |
Correct |
9 ms |
1360 KB |
Output is correct |
20 |
Correct |
9 ms |
1460 KB |
Output is correct |
21 |
Correct |
9 ms |
1444 KB |
Output is correct |
22 |
Correct |
10 ms |
1488 KB |
Output is correct |
23 |
Correct |
9 ms |
1488 KB |
Output is correct |
24 |
Correct |
15 ms |
1444 KB |
Output is correct |
25 |
Correct |
9 ms |
1476 KB |
Output is correct |
26 |
Correct |
9 ms |
1448 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 |
1 ms |
220 KB |
Output is correct |
31 |
Correct |
0 ms |
208 KB |
Output is correct |
32 |
Correct |
0 ms |
208 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 |
214 ms |
464 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 |
1 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 |
309 ms |
936 KB |
2nd lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |