#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
const int maxl = 20;
const int maxn = 100010;
const int inf = 1000000010;
int n;
int peak;
int v[maxn];
void init(int N, vector<int> H) {
n = N;
for(int i = 1 ; i <= n ; i++)
v[i] = H[i];
for(int i = 1 ; i <= n ; i++)
if( v[i - 1] < v[i] && v[i] > v[i + 1] ) peak = i;
}
int max_towers(int L, int R, int D)
{
if( peak < L || R < peak )
return 1;
if( v[L] <= v[peak] - D && v[R] <= v[peak] - D )
return 2;
return 1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
253 ms |
940 KB |
Output is correct |
2 |
Correct |
633 ms |
1488 KB |
Output is correct |
3 |
Correct |
620 ms |
1460 KB |
Output is correct |
4 |
Correct |
724 ms |
1460 KB |
Output is correct |
5 |
Correct |
836 ms |
1352 KB |
Output is correct |
6 |
Correct |
896 ms |
1448 KB |
Output is correct |
7 |
Incorrect |
905 ms |
1440 KB |
2632nd lines differ - on the 1st token, expected: '1', found: '2' |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
1st lines differ - on the 1st token, expected: '13', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
1st lines differ - on the 1st token, expected: '13', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
593 ms |
1444 KB |
1st lines differ - on the 1st token, expected: '11903', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
285 ms |
464 KB |
1st lines differ - on the 1st token, expected: '7197', 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: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
253 ms |
940 KB |
Output is correct |
2 |
Correct |
633 ms |
1488 KB |
Output is correct |
3 |
Correct |
620 ms |
1460 KB |
Output is correct |
4 |
Correct |
724 ms |
1460 KB |
Output is correct |
5 |
Correct |
836 ms |
1352 KB |
Output is correct |
6 |
Correct |
896 ms |
1448 KB |
Output is correct |
7 |
Incorrect |
905 ms |
1440 KB |
2632nd lines differ - on the 1st token, expected: '1', found: '2' |
8 |
Halted |
0 ms |
0 KB |
- |