#include "towers.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
vector<int> v,pre;
void init(int n, vector<int> h) {
v=h;
pre.resize(n);
for(int i=1;i+1<n;i++){
if(v[i]<v[i-1] && v[i]<v[i+1]){
pre[i]=1;
}
}
for(int i=1;i<n;i++){
pre[i]+=pre[i-1];
}
}
int max_towers(int l, int r, int d) {
if(l==r){
return 1;
}
int u=pre[r-1];
if(l){
u-=pre[l];
}
if(v[l]<v[l+1]){
u++;
}
if(v[r]<v[r-1]){
u++;
}
return u;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
292 ms |
1188 KB |
2nd lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
489 ms |
1836 KB |
Output is correct |
2 |
Correct |
596 ms |
1876 KB |
Output is correct |
3 |
Correct |
627 ms |
1744 KB |
Output is correct |
4 |
Correct |
523 ms |
1872 KB |
Output is correct |
5 |
Correct |
558 ms |
1848 KB |
Output is correct |
6 |
Correct |
550 ms |
1824 KB |
Output is correct |
7 |
Correct |
489 ms |
1844 KB |
Output is correct |
8 |
Correct |
557 ms |
1872 KB |
Output is correct |
9 |
Correct |
515 ms |
1844 KB |
Output is correct |
10 |
Correct |
370 ms |
1840 KB |
Output is correct |
11 |
Correct |
645 ms |
1848 KB |
Output is correct |
12 |
Correct |
608 ms |
1856 KB |
Output is correct |
13 |
Correct |
565 ms |
1872 KB |
Output is correct |
14 |
Correct |
0 ms |
208 KB |
Output is correct |
15 |
Correct |
0 ms |
208 KB |
Output is correct |
16 |
Correct |
1 ms |
208 KB |
Output is correct |
17 |
Correct |
11 ms |
1832 KB |
Output is correct |
18 |
Correct |
16 ms |
1828 KB |
Output is correct |
19 |
Correct |
16 ms |
1844 KB |
Output is correct |
20 |
Correct |
9 ms |
1872 KB |
Output is correct |
21 |
Correct |
9 ms |
1824 KB |
Output is correct |
22 |
Correct |
15 ms |
1872 KB |
Output is correct |
23 |
Correct |
9 ms |
1872 KB |
Output is correct |
24 |
Correct |
10 ms |
1844 KB |
Output is correct |
25 |
Correct |
11 ms |
1872 KB |
Output is correct |
26 |
Correct |
16 ms |
1824 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 |
208 KB |
Output is correct |
33 |
Correct |
0 ms |
208 KB |
Output is correct |
34 |
Correct |
1 ms |
208 KB |
Output is correct |
35 |
Correct |
0 ms |
208 KB |
Output is correct |
36 |
Correct |
0 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
196 ms |
592 KB |
1st lines differ - on the 1st token, expected: '7197', found: '8004' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
292 ms |
1188 KB |
2nd lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |