#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
using mim = pair<pair<int,int>,int>;
const int maxn=1e5+10;
const int logg=18;
int n;
int h[maxn];
int pref[maxn];
void init(int _n, vector<int> _h) {
n=_n;
for(int i=0;i<n;i++) h[i]=_h[i];
for(int i=1;i<n-1;i++){
pref[i]=pref[i-1];
if(h[i]<h[i+1] && h[i]<h[i-1]) pref[i]++;
}
}
int max_towers(int l, int r, int d) {
int ret=int(l==r);
if(l+1<=r-1) ret+=pref[r-1]-pref[l];
if(r-l>0 && h[l]<h[l+1]) ret++;
if(r-l>0 && h[r]<h[r-1]) ret++;
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
266 ms |
1232 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 |
516 ms |
1856 KB |
Output is correct |
2 |
Correct |
844 ms |
1828 KB |
Output is correct |
3 |
Correct |
720 ms |
1736 KB |
Output is correct |
4 |
Correct |
660 ms |
1836 KB |
Output is correct |
5 |
Correct |
751 ms |
1864 KB |
Output is correct |
6 |
Correct |
659 ms |
1860 KB |
Output is correct |
7 |
Correct |
536 ms |
1840 KB |
Output is correct |
8 |
Correct |
675 ms |
1848 KB |
Output is correct |
9 |
Correct |
574 ms |
1808 KB |
Output is correct |
10 |
Correct |
659 ms |
1844 KB |
Output is correct |
11 |
Correct |
781 ms |
1844 KB |
Output is correct |
12 |
Correct |
707 ms |
1832 KB |
Output is correct |
13 |
Correct |
752 ms |
1832 KB |
Output is correct |
14 |
Correct |
0 ms |
208 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
1 ms |
336 KB |
Output is correct |
17 |
Correct |
15 ms |
1856 KB |
Output is correct |
18 |
Correct |
15 ms |
1852 KB |
Output is correct |
19 |
Correct |
10 ms |
1828 KB |
Output is correct |
20 |
Correct |
9 ms |
1820 KB |
Output is correct |
21 |
Correct |
9 ms |
1844 KB |
Output is correct |
22 |
Correct |
11 ms |
1856 KB |
Output is correct |
23 |
Correct |
10 ms |
1836 KB |
Output is correct |
24 |
Correct |
9 ms |
1832 KB |
Output is correct |
25 |
Correct |
10 ms |
1832 KB |
Output is correct |
26 |
Correct |
16 ms |
1844 KB |
Output is correct |
27 |
Correct |
1 ms |
336 KB |
Output is correct |
28 |
Correct |
0 ms |
336 KB |
Output is correct |
29 |
Correct |
0 ms |
336 KB |
Output is correct |
30 |
Correct |
1 ms |
308 KB |
Output is correct |
31 |
Correct |
1 ms |
336 KB |
Output is correct |
32 |
Correct |
1 ms |
208 KB |
Output is correct |
33 |
Correct |
1 ms |
208 KB |
Output is correct |
34 |
Correct |
1 ms |
336 KB |
Output is correct |
35 |
Correct |
1 ms |
336 KB |
Output is correct |
36 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
135 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 |
266 ms |
1232 KB |
2nd lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |