#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 2010;
int n, h[MAX_N], a[MAX_N], b[MAX_N];
int q, ql[MAX_N], qr[MAX_N], res[MAX_N];
int ans[MAX_N][MAX_N];
bool valid(int i, int j) {
if (i == j) return false;
int dis = abs(j - i);
return a[i] <= dis && dis <= b[i]
&& a[j] <= dis && dis <= b[j];
};
void precal() {
for (int i = 1;i <= n;++i)
for (int j = i;j <= n;++j) {
ans[i][j] = -1;
if (valid(i, j)) {
DE(i, j);
ans[i][j] = abs(h[i]-h[j]);
}
}
for (int w = 0;w < n;++w)
for (int l = 1;l + w <= n;++l) {
int r = l + w;
chmax(ans[l-1][r], ans[l][r]);
chmax(ans[l][r+1], ans[l][r]);
}
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.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 >> ql[i] >> qr[i];
if (n > 2000) return -1;
precal();
for (int i = 1;i <= q;++i)
res[i] = ans[ ql[i] ][ qr[i] ];
for (int i = 1;i <= q;++i)
cout << res[i] << '\n';
}
Compilation message
antennas.cpp: In function 'void precal()':
antennas.cpp:14:17: warning: statement has no effect [-Wunused-value]
14 | #define DE(...) 0
| ^
antennas.cpp:35:5: note: in expansion of macro 'DE'
35 | DE(i, j);
| ^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
876 KB |
Output is correct |
2 |
Correct |
2 ms |
1772 KB |
Output is correct |
3 |
Correct |
2 ms |
1388 KB |
Output is correct |
4 |
Correct |
2 ms |
1772 KB |
Output is correct |
5 |
Correct |
1 ms |
1516 KB |
Output is correct |
6 |
Correct |
2 ms |
1772 KB |
Output is correct |
7 |
Correct |
1 ms |
1644 KB |
Output is correct |
8 |
Correct |
2 ms |
1772 KB |
Output is correct |
9 |
Correct |
1 ms |
876 KB |
Output is correct |
10 |
Correct |
2 ms |
1772 KB |
Output is correct |
11 |
Correct |
1 ms |
620 KB |
Output is correct |
12 |
Correct |
2 ms |
1772 KB |
Output is correct |
13 |
Correct |
1 ms |
1516 KB |
Output is correct |
14 |
Correct |
1 ms |
1516 KB |
Output is correct |
15 |
Correct |
1 ms |
1516 KB |
Output is correct |
16 |
Correct |
2 ms |
1516 KB |
Output is correct |
17 |
Correct |
1 ms |
1516 KB |
Output is correct |
18 |
Correct |
1 ms |
1516 KB |
Output is correct |
19 |
Correct |
2 ms |
1516 KB |
Output is correct |
20 |
Correct |
1 ms |
1516 KB |
Output is correct |
21 |
Correct |
1 ms |
1516 KB |
Output is correct |
22 |
Correct |
1 ms |
1516 KB |
Output is correct |
23 |
Correct |
1 ms |
1516 KB |
Output is correct |
24 |
Correct |
2 ms |
1516 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
876 KB |
Output is correct |
2 |
Correct |
2 ms |
1772 KB |
Output is correct |
3 |
Correct |
2 ms |
1388 KB |
Output is correct |
4 |
Correct |
2 ms |
1772 KB |
Output is correct |
5 |
Correct |
1 ms |
1516 KB |
Output is correct |
6 |
Correct |
2 ms |
1772 KB |
Output is correct |
7 |
Correct |
1 ms |
1644 KB |
Output is correct |
8 |
Correct |
2 ms |
1772 KB |
Output is correct |
9 |
Correct |
1 ms |
876 KB |
Output is correct |
10 |
Correct |
2 ms |
1772 KB |
Output is correct |
11 |
Correct |
1 ms |
620 KB |
Output is correct |
12 |
Correct |
2 ms |
1772 KB |
Output is correct |
13 |
Correct |
1 ms |
1516 KB |
Output is correct |
14 |
Correct |
1 ms |
1516 KB |
Output is correct |
15 |
Correct |
1 ms |
1516 KB |
Output is correct |
16 |
Correct |
2 ms |
1516 KB |
Output is correct |
17 |
Correct |
1 ms |
1516 KB |
Output is correct |
18 |
Correct |
1 ms |
1516 KB |
Output is correct |
19 |
Correct |
2 ms |
1516 KB |
Output is correct |
20 |
Correct |
1 ms |
1516 KB |
Output is correct |
21 |
Correct |
1 ms |
1516 KB |
Output is correct |
22 |
Correct |
1 ms |
1516 KB |
Output is correct |
23 |
Correct |
1 ms |
1516 KB |
Output is correct |
24 |
Correct |
2 ms |
1516 KB |
Output is correct |
25 |
Incorrect |
5 ms |
5356 KB |
Output isn't correct |
26 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
492 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
876 KB |
Output is correct |
2 |
Correct |
2 ms |
1772 KB |
Output is correct |
3 |
Correct |
2 ms |
1388 KB |
Output is correct |
4 |
Correct |
2 ms |
1772 KB |
Output is correct |
5 |
Correct |
1 ms |
1516 KB |
Output is correct |
6 |
Correct |
2 ms |
1772 KB |
Output is correct |
7 |
Correct |
1 ms |
1644 KB |
Output is correct |
8 |
Correct |
2 ms |
1772 KB |
Output is correct |
9 |
Correct |
1 ms |
876 KB |
Output is correct |
10 |
Correct |
2 ms |
1772 KB |
Output is correct |
11 |
Correct |
1 ms |
620 KB |
Output is correct |
12 |
Correct |
2 ms |
1772 KB |
Output is correct |
13 |
Correct |
1 ms |
1516 KB |
Output is correct |
14 |
Correct |
1 ms |
1516 KB |
Output is correct |
15 |
Correct |
1 ms |
1516 KB |
Output is correct |
16 |
Correct |
2 ms |
1516 KB |
Output is correct |
17 |
Correct |
1 ms |
1516 KB |
Output is correct |
18 |
Correct |
1 ms |
1516 KB |
Output is correct |
19 |
Correct |
2 ms |
1516 KB |
Output is correct |
20 |
Correct |
1 ms |
1516 KB |
Output is correct |
21 |
Correct |
1 ms |
1516 KB |
Output is correct |
22 |
Correct |
1 ms |
1516 KB |
Output is correct |
23 |
Correct |
1 ms |
1516 KB |
Output is correct |
24 |
Correct |
2 ms |
1516 KB |
Output is correct |
25 |
Incorrect |
5 ms |
5356 KB |
Output isn't correct |
26 |
Halted |
0 ms |
0 KB |
- |