oj.uz

Submission #375849

# Submission time Handle Problem Language Result Execution time Memory
375849 2021-03-10T04:34:15 Z 2qbingxuan Two Antennas (JOI19_antennas) C++14
2 / 100
 97 ms 36620 KB 
#include <bits/stdc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\n")));
}
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
 
using namespace std;
const int maxn = 200025;
 
int H[maxn], A[maxn], B[maxn];

int ans[2001][2001];
 
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> H[i] >> A[i] >> B[i];
    memset(ans, -1, sizeof ans);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            if (max(A[i], A[j]) <= (i-j) && (i-j) <= min(B[i], B[j]))
                ans[j][i] = abs(H[i] - H[j]);
        }
    }
    for (int l = n; l >= 1; l--) {
        for (int r = 1; r <= n; r++)
            ans[l][r] = max({ ans[l][r], ans[l+1][r], ans[l][r-1] });
    }
    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        cout << ans[l][r] << '\n';
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15980 KB Output is correct
2 Correct 10 ms 15980 KB Output is correct
3 Correct 10 ms 15980 KB Output is correct
4 Correct 11 ms 15980 KB Output is correct
5 Correct 10 ms 15980 KB Output is correct
6 Correct 10 ms 15980 KB Output is correct
7 Correct 10 ms 15980 KB Output is correct
8 Correct 10 ms 16040 KB Output is correct
9 Correct 9 ms 15980 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 9 ms 15980 KB Output is correct
12 Correct 10 ms 15980 KB Output is correct
13 Correct 10 ms 15980 KB Output is correct
14 Correct 10 ms 15980 KB Output is correct
15 Correct 10 ms 15980 KB Output is correct
16 Correct 10 ms 15980 KB Output is correct
17 Correct 12 ms 15980 KB Output is correct
18 Correct 10 ms 15980 KB Output is correct
19 Correct 9 ms 15980 KB Output is correct
20 Correct 10 ms 15980 KB Output is correct
21 Correct 9 ms 15980 KB Output is correct
22 Correct 10 ms 15980 KB Output is correct
23 Correct 10 ms 16068 KB Output is correct
24 Correct 12 ms 15980 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15980 KB Output is correct
2 Correct 10 ms 15980 KB Output is correct
3 Correct 10 ms 15980 KB Output is correct
4 Correct 11 ms 15980 KB Output is correct
5 Correct 10 ms 15980 KB Output is correct
6 Correct 10 ms 15980 KB Output is correct
7 Correct 10 ms 15980 KB Output is correct
8 Correct 10 ms 16040 KB Output is correct
9 Correct 9 ms 15980 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 9 ms 15980 KB Output is correct
12 Correct 10 ms 15980 KB Output is correct
13 Correct 10 ms 15980 KB Output is correct
14 Correct 10 ms 15980 KB Output is correct
15 Correct 10 ms 15980 KB Output is correct
16 Correct 10 ms 15980 KB Output is correct
17 Correct 12 ms 15980 KB Output is correct
18 Correct 10 ms 15980 KB Output is correct
19 Correct 9 ms 15980 KB Output is correct
20 Correct 10 ms 15980 KB Output is correct
21 Correct 9 ms 15980 KB Output is correct
22 Correct 10 ms 15980 KB Output is correct
23 Correct 10 ms 16068 KB Output is correct
24 Correct 12 ms 15980 KB Output is correct
25 Correct 59 ms 17260 KB Output is correct
26 Incorrect 41 ms 16236 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 97 ms 36620 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15980 KB Output is correct
2 Correct 10 ms 15980 KB Output is correct
3 Correct 10 ms 15980 KB Output is correct
4 Correct 11 ms 15980 KB Output is correct
5 Correct 10 ms 15980 KB Output is correct
6 Correct 10 ms 15980 KB Output is correct
7 Correct 10 ms 15980 KB Output is correct
8 Correct 10 ms 16040 KB Output is correct
9 Correct 9 ms 15980 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 9 ms 15980 KB Output is correct
12 Correct 10 ms 15980 KB Output is correct
13 Correct 10 ms 15980 KB Output is correct
14 Correct 10 ms 15980 KB Output is correct
15 Correct 10 ms 15980 KB Output is correct
16 Correct 10 ms 15980 KB Output is correct
17 Correct 12 ms 15980 KB Output is correct
18 Correct 10 ms 15980 KB Output is correct
19 Correct 9 ms 15980 KB Output is correct
20 Correct 10 ms 15980 KB Output is correct
21 Correct 9 ms 15980 KB Output is correct
22 Correct 10 ms 15980 KB Output is correct
23 Correct 10 ms 16068 KB Output is correct
24 Correct 12 ms 15980 KB Output is correct
25 Correct 59 ms 17260 KB Output is correct
26 Incorrect 41 ms 16236 KB Output isn't correct
27 Halted 0 ms 0 KB -