#include <bits/stdc++.h>
#define int long long
using namespace std;
const int O = 2e5 + 5;
const int inf = 1e16;
int n, q, l[O], r[O], h[O], a[O], b[O], res[O], tree[O * 4], Min[O * 4], Max[O * 4];
vector <int> qu[O], in[O], out[O];
int Beauti(int x){
return max(1ll, x);
}
void Push(int id){
int &x = Min[id];
if (x == inf) return;
for (int i = 2 * id; i <= 2 * id + 1; ++ i){
Min[i] = min(Min[i], x);
tree[i] = max(tree[i], Max[i] - Min[i]);
}
x = inf; return;
}
void UpdateMax(int id, int l, int r, int u, int x){
if (l > u || r < u) return;
if (l == r){
Max[id] = x;
Min[id] = inf;
tree[id] = max(tree[id], Max[id] - Min[id]);
return;
}
int mid = (l + r) / 2; Push(id);
UpdateMax(id << 1, l, mid, u, x);
UpdateMax(id << 1 | 1, mid + 1, r, u, x);
tree[id] = max({tree[id], tree[id << 1], tree[id << 1 | 1], Max[id] - Min[id]});
Max[id] = max(Max[id << 1], Max[id << 1 | 1]);
}
void UpdateMin(int id, int l, int r, int u, int v, int x){
if (l > v || r < u) return;
if (u <= l && r <= v){
Min[id] = min(Min[id], x);
tree[id] = max(tree[id], Max[id] - Min[id]);
return;
}
int mid = (l + r) / 2; Push(id);
UpdateMin(id << 1, l, mid, u, v, x);
UpdateMin(id << 1 | 1, mid + 1, r, u, v, x);
tree[id] = max({tree[id], tree[id << 1], tree[id << 1 | 1], Max[id] - Min[id]});
Max[id] = max(Max[id << 1], Max[id << 1 | 1]);
}
int Get(int id, int l, int r, int u, int v){
if (l > v || r < u) return -inf;
if (u <= l && r <= v) return tree[id];
int mid = (l + r) / 2; Push(id);
return max(Get(id << 1, l, mid, u, v), Get(id << 1 | 1, mid + 1, r, u, v));
}
void solve(){
for (int i = 1; i <= q; ++ i) qu[r[i]].push_back(i);
for (int i = 1; i < O; ++ i){
tree[i] = -inf;
Max[i] = -inf;
Min[i] = inf;
}
for (int i = 1; i <= n; ++ i){
for (int j : in[i]){
UpdateMax(1, 1, n, j, h[j]);
}
for (int j : out[i]){
UpdateMax(1, 1, n, j, -inf);
}
if (i - a[i] >= 1) UpdateMin(1, 1, n, Beauti(i - b[i]), Beauti(i - a[i]), h[i]);
for (int j : qu[i]){
res[j] = max(res[j], Get(1, 1, n, l[j], i));
}
if (i + a[i] <= n) in[i + a[i]].push_back(i);
if (i + b[i] + 1 <= n) out[i + b[i] + 1].push_back(i);
}
for (int i = 1; i <= n; ++ i){
qu[i].clear();
in[i].clear();
out[i].clear();
}
}
main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++ i) cin >> h[i] >> a[i] >> b[i];
cin >> q;
for (int i = 1; i <= q; ++ i){
cin >> l[i] >> r[i];
res[i] = -1;
}
solve();
reverse(h + 1, h + n + 1);
reverse(a + 1, a + n + 1);
reverse(b + 1, b + n + 1);
for (int i = 1; i <= q; ++ i){
l[i] = n - l[i] + 1;
r[i] = n - r[i] + 1;
swap(l[i], r[i]);
}
solve();
for (int i = 1; i <= q; ++ i) cout << res[i] << "\n";
}
Compilation message
antennas.cpp:100:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
100 | main(){
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
19148 KB |
Output is correct |
2 |
Correct |
14 ms |
19132 KB |
Output is correct |
3 |
Correct |
11 ms |
19188 KB |
Output is correct |
4 |
Correct |
11 ms |
19204 KB |
Output is correct |
5 |
Correct |
12 ms |
19148 KB |
Output is correct |
6 |
Correct |
11 ms |
19148 KB |
Output is correct |
7 |
Correct |
14 ms |
19188 KB |
Output is correct |
8 |
Correct |
11 ms |
19148 KB |
Output is correct |
9 |
Correct |
10 ms |
19068 KB |
Output is correct |
10 |
Correct |
11 ms |
19204 KB |
Output is correct |
11 |
Correct |
11 ms |
19148 KB |
Output is correct |
12 |
Correct |
10 ms |
19200 KB |
Output is correct |
13 |
Correct |
10 ms |
19080 KB |
Output is correct |
14 |
Correct |
11 ms |
19120 KB |
Output is correct |
15 |
Correct |
13 ms |
19148 KB |
Output is correct |
16 |
Correct |
11 ms |
19148 KB |
Output is correct |
17 |
Correct |
11 ms |
19148 KB |
Output is correct |
18 |
Correct |
11 ms |
19172 KB |
Output is correct |
19 |
Correct |
11 ms |
19148 KB |
Output is correct |
20 |
Correct |
11 ms |
19148 KB |
Output is correct |
21 |
Correct |
11 ms |
19276 KB |
Output is correct |
22 |
Correct |
10 ms |
19148 KB |
Output is correct |
23 |
Correct |
11 ms |
19168 KB |
Output is correct |
24 |
Correct |
10 ms |
19080 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
19148 KB |
Output is correct |
2 |
Correct |
14 ms |
19132 KB |
Output is correct |
3 |
Correct |
11 ms |
19188 KB |
Output is correct |
4 |
Correct |
11 ms |
19204 KB |
Output is correct |
5 |
Correct |
12 ms |
19148 KB |
Output is correct |
6 |
Correct |
11 ms |
19148 KB |
Output is correct |
7 |
Correct |
14 ms |
19188 KB |
Output is correct |
8 |
Correct |
11 ms |
19148 KB |
Output is correct |
9 |
Correct |
10 ms |
19068 KB |
Output is correct |
10 |
Correct |
11 ms |
19204 KB |
Output is correct |
11 |
Correct |
11 ms |
19148 KB |
Output is correct |
12 |
Correct |
10 ms |
19200 KB |
Output is correct |
13 |
Correct |
10 ms |
19080 KB |
Output is correct |
14 |
Correct |
11 ms |
19120 KB |
Output is correct |
15 |
Correct |
13 ms |
19148 KB |
Output is correct |
16 |
Correct |
11 ms |
19148 KB |
Output is correct |
17 |
Correct |
11 ms |
19148 KB |
Output is correct |
18 |
Correct |
11 ms |
19172 KB |
Output is correct |
19 |
Correct |
11 ms |
19148 KB |
Output is correct |
20 |
Correct |
11 ms |
19148 KB |
Output is correct |
21 |
Correct |
11 ms |
19276 KB |
Output is correct |
22 |
Correct |
10 ms |
19148 KB |
Output is correct |
23 |
Correct |
11 ms |
19168 KB |
Output is correct |
24 |
Correct |
10 ms |
19080 KB |
Output is correct |
25 |
Correct |
93 ms |
26416 KB |
Output is correct |
26 |
Correct |
22 ms |
20028 KB |
Output is correct |
27 |
Correct |
136 ms |
28996 KB |
Output is correct |
28 |
Correct |
152 ms |
28708 KB |
Output is correct |
29 |
Correct |
113 ms |
26540 KB |
Output is correct |
30 |
Correct |
97 ms |
25764 KB |
Output is correct |
31 |
Correct |
106 ms |
28356 KB |
Output is correct |
32 |
Correct |
141 ms |
28808 KB |
Output is correct |
33 |
Correct |
131 ms |
28676 KB |
Output is correct |
34 |
Correct |
71 ms |
23796 KB |
Output is correct |
35 |
Correct |
137 ms |
29200 KB |
Output is correct |
36 |
Correct |
134 ms |
28692 KB |
Output is correct |
37 |
Correct |
80 ms |
24236 KB |
Output is correct |
38 |
Correct |
136 ms |
27836 KB |
Output is correct |
39 |
Correct |
29 ms |
20420 KB |
Output is correct |
40 |
Correct |
142 ms |
27716 KB |
Output is correct |
41 |
Correct |
116 ms |
25708 KB |
Output is correct |
42 |
Correct |
144 ms |
27716 KB |
Output is correct |
43 |
Correct |
53 ms |
22196 KB |
Output is correct |
44 |
Correct |
136 ms |
27808 KB |
Output is correct |
45 |
Correct |
35 ms |
20688 KB |
Output is correct |
46 |
Correct |
135 ms |
27808 KB |
Output is correct |
47 |
Correct |
50 ms |
21396 KB |
Output is correct |
48 |
Correct |
132 ms |
27716 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
387 ms |
36044 KB |
Output is correct |
2 |
Correct |
394 ms |
37096 KB |
Output is correct |
3 |
Correct |
270 ms |
34036 KB |
Output is correct |
4 |
Incorrect |
388 ms |
37304 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
19148 KB |
Output is correct |
2 |
Correct |
14 ms |
19132 KB |
Output is correct |
3 |
Correct |
11 ms |
19188 KB |
Output is correct |
4 |
Correct |
11 ms |
19204 KB |
Output is correct |
5 |
Correct |
12 ms |
19148 KB |
Output is correct |
6 |
Correct |
11 ms |
19148 KB |
Output is correct |
7 |
Correct |
14 ms |
19188 KB |
Output is correct |
8 |
Correct |
11 ms |
19148 KB |
Output is correct |
9 |
Correct |
10 ms |
19068 KB |
Output is correct |
10 |
Correct |
11 ms |
19204 KB |
Output is correct |
11 |
Correct |
11 ms |
19148 KB |
Output is correct |
12 |
Correct |
10 ms |
19200 KB |
Output is correct |
13 |
Correct |
10 ms |
19080 KB |
Output is correct |
14 |
Correct |
11 ms |
19120 KB |
Output is correct |
15 |
Correct |
13 ms |
19148 KB |
Output is correct |
16 |
Correct |
11 ms |
19148 KB |
Output is correct |
17 |
Correct |
11 ms |
19148 KB |
Output is correct |
18 |
Correct |
11 ms |
19172 KB |
Output is correct |
19 |
Correct |
11 ms |
19148 KB |
Output is correct |
20 |
Correct |
11 ms |
19148 KB |
Output is correct |
21 |
Correct |
11 ms |
19276 KB |
Output is correct |
22 |
Correct |
10 ms |
19148 KB |
Output is correct |
23 |
Correct |
11 ms |
19168 KB |
Output is correct |
24 |
Correct |
10 ms |
19080 KB |
Output is correct |
25 |
Correct |
93 ms |
26416 KB |
Output is correct |
26 |
Correct |
22 ms |
20028 KB |
Output is correct |
27 |
Correct |
136 ms |
28996 KB |
Output is correct |
28 |
Correct |
152 ms |
28708 KB |
Output is correct |
29 |
Correct |
113 ms |
26540 KB |
Output is correct |
30 |
Correct |
97 ms |
25764 KB |
Output is correct |
31 |
Correct |
106 ms |
28356 KB |
Output is correct |
32 |
Correct |
141 ms |
28808 KB |
Output is correct |
33 |
Correct |
131 ms |
28676 KB |
Output is correct |
34 |
Correct |
71 ms |
23796 KB |
Output is correct |
35 |
Correct |
137 ms |
29200 KB |
Output is correct |
36 |
Correct |
134 ms |
28692 KB |
Output is correct |
37 |
Correct |
80 ms |
24236 KB |
Output is correct |
38 |
Correct |
136 ms |
27836 KB |
Output is correct |
39 |
Correct |
29 ms |
20420 KB |
Output is correct |
40 |
Correct |
142 ms |
27716 KB |
Output is correct |
41 |
Correct |
116 ms |
25708 KB |
Output is correct |
42 |
Correct |
144 ms |
27716 KB |
Output is correct |
43 |
Correct |
53 ms |
22196 KB |
Output is correct |
44 |
Correct |
136 ms |
27808 KB |
Output is correct |
45 |
Correct |
35 ms |
20688 KB |
Output is correct |
46 |
Correct |
135 ms |
27808 KB |
Output is correct |
47 |
Correct |
50 ms |
21396 KB |
Output is correct |
48 |
Correct |
132 ms |
27716 KB |
Output is correct |
49 |
Correct |
387 ms |
36044 KB |
Output is correct |
50 |
Correct |
394 ms |
37096 KB |
Output is correct |
51 |
Correct |
270 ms |
34036 KB |
Output is correct |
52 |
Incorrect |
388 ms |
37304 KB |
Output isn't correct |
53 |
Halted |
0 ms |
0 KB |
- |