#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
int n;
cin >> n;
vector<int> H(n + 1);
vector<int> A(n + 1);
vector<int> B(n+ 1);
for(int i = 1; i <= n; i++){
cin >> H[i] >> A[i] >> B[i];
}
int q;
cin >> q;
while(q--){
int l, r, ans = -1;
cin >> l >> r;
set<int> S[n + 1];
for(int i = l; i <= r; i++){
for(int j = max(1ll, i - B[i]); j <= max(0ll, i - A[i]); j++){
if(j < l || r < j)continue;
if(S[j].count(i)) ans = max(ans, abs(H[i] - H[j]));
S[i].insert(j);
}
for(int j = min(n + 1, i + A[i]); j <= min(n, i + B[i]); j++){
if(j < l || r < j)continue;
if(S[j].count(i)) ans = max(ans, abs(H[i] - H[j]));
S[i].insert(j);
}
}
cout << ans << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
376 KB |
Output is correct |
2 |
Correct |
39 ms |
1148 KB |
Output is correct |
3 |
Correct |
29 ms |
888 KB |
Output is correct |
4 |
Correct |
53 ms |
1272 KB |
Output is correct |
5 |
Correct |
13 ms |
632 KB |
Output is correct |
6 |
Correct |
34 ms |
1144 KB |
Output is correct |
7 |
Correct |
48 ms |
1144 KB |
Output is correct |
8 |
Correct |
54 ms |
1144 KB |
Output is correct |
9 |
Correct |
13 ms |
376 KB |
Output is correct |
10 |
Correct |
51 ms |
1404 KB |
Output is correct |
11 |
Correct |
7 ms |
376 KB |
Output is correct |
12 |
Correct |
58 ms |
1272 KB |
Output is correct |
13 |
Correct |
22 ms |
764 KB |
Output is correct |
14 |
Correct |
15 ms |
632 KB |
Output is correct |
15 |
Correct |
18 ms |
760 KB |
Output is correct |
16 |
Correct |
11 ms |
504 KB |
Output is correct |
17 |
Correct |
26 ms |
1016 KB |
Output is correct |
18 |
Correct |
26 ms |
760 KB |
Output is correct |
19 |
Correct |
7 ms |
632 KB |
Output is correct |
20 |
Correct |
14 ms |
632 KB |
Output is correct |
21 |
Correct |
14 ms |
632 KB |
Output is correct |
22 |
Correct |
20 ms |
712 KB |
Output is correct |
23 |
Correct |
17 ms |
760 KB |
Output is correct |
24 |
Correct |
21 ms |
760 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
376 KB |
Output is correct |
2 |
Correct |
39 ms |
1148 KB |
Output is correct |
3 |
Correct |
29 ms |
888 KB |
Output is correct |
4 |
Correct |
53 ms |
1272 KB |
Output is correct |
5 |
Correct |
13 ms |
632 KB |
Output is correct |
6 |
Correct |
34 ms |
1144 KB |
Output is correct |
7 |
Correct |
48 ms |
1144 KB |
Output is correct |
8 |
Correct |
54 ms |
1144 KB |
Output is correct |
9 |
Correct |
13 ms |
376 KB |
Output is correct |
10 |
Correct |
51 ms |
1404 KB |
Output is correct |
11 |
Correct |
7 ms |
376 KB |
Output is correct |
12 |
Correct |
58 ms |
1272 KB |
Output is correct |
13 |
Correct |
22 ms |
764 KB |
Output is correct |
14 |
Correct |
15 ms |
632 KB |
Output is correct |
15 |
Correct |
18 ms |
760 KB |
Output is correct |
16 |
Correct |
11 ms |
504 KB |
Output is correct |
17 |
Correct |
26 ms |
1016 KB |
Output is correct |
18 |
Correct |
26 ms |
760 KB |
Output is correct |
19 |
Correct |
7 ms |
632 KB |
Output is correct |
20 |
Correct |
14 ms |
632 KB |
Output is correct |
21 |
Correct |
14 ms |
632 KB |
Output is correct |
22 |
Correct |
20 ms |
712 KB |
Output is correct |
23 |
Correct |
17 ms |
760 KB |
Output is correct |
24 |
Correct |
21 ms |
760 KB |
Output is correct |
25 |
Execution timed out |
3074 ms |
8436 KB |
Time limit exceeded |
26 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1984 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
376 KB |
Output is correct |
2 |
Correct |
39 ms |
1148 KB |
Output is correct |
3 |
Correct |
29 ms |
888 KB |
Output is correct |
4 |
Correct |
53 ms |
1272 KB |
Output is correct |
5 |
Correct |
13 ms |
632 KB |
Output is correct |
6 |
Correct |
34 ms |
1144 KB |
Output is correct |
7 |
Correct |
48 ms |
1144 KB |
Output is correct |
8 |
Correct |
54 ms |
1144 KB |
Output is correct |
9 |
Correct |
13 ms |
376 KB |
Output is correct |
10 |
Correct |
51 ms |
1404 KB |
Output is correct |
11 |
Correct |
7 ms |
376 KB |
Output is correct |
12 |
Correct |
58 ms |
1272 KB |
Output is correct |
13 |
Correct |
22 ms |
764 KB |
Output is correct |
14 |
Correct |
15 ms |
632 KB |
Output is correct |
15 |
Correct |
18 ms |
760 KB |
Output is correct |
16 |
Correct |
11 ms |
504 KB |
Output is correct |
17 |
Correct |
26 ms |
1016 KB |
Output is correct |
18 |
Correct |
26 ms |
760 KB |
Output is correct |
19 |
Correct |
7 ms |
632 KB |
Output is correct |
20 |
Correct |
14 ms |
632 KB |
Output is correct |
21 |
Correct |
14 ms |
632 KB |
Output is correct |
22 |
Correct |
20 ms |
712 KB |
Output is correct |
23 |
Correct |
17 ms |
760 KB |
Output is correct |
24 |
Correct |
21 ms |
760 KB |
Output is correct |
25 |
Execution timed out |
3074 ms |
8436 KB |
Time limit exceeded |
26 |
Halted |
0 ms |
0 KB |
- |