oj.uz

답안 #868930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868930 2023-11-02T12:51:13 Z rockstar Two Antennas (JOI19_antennas) C++17
13 / 100
 250 ms 524288 KB 
// #pragma GCC optimize("O3,unroll-loops,inline,no-stack-protector")
// #pragma GCC target("avx,avx2,sse3,ssse3,sse4.1,sse4.2,fma,bmi2,abm,popcnt,mmx,tune=native")

#include <bits/stdc++.h>

using namespace std;

#define trace(x) cerr << #x << ": " << (x) << endl;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

using ll = long long;

#define int ll

constexpr int INF = numeric_limits<int>::max() / 2;

struct node {
    int h, a, b;
};

void solve() {
    int n;
    cin >> n;
    vector<node> v(n);
    for (auto& i : v)
        cin >> i.h >> i.a >> i.b;
    vector<vector<int>> pref(n, vector<int>(n, -1));
    for (int i = 0; i < n; ++i)
        for (int j = i + 1; j < n; ++j)
            if (v[i].a + i <= j && v[i].b + i >= j && j - v[j].a >= i && j - v[j].b <= i)
                pref[n - i - 1][j] = abs(v[i].h - v[j].h);
    for (int i = 1; i < n; ++i)
        pref[i][0] = max(pref[i][0], pref[i - 1][0]), pref[0][i] = max(pref[0][i], pref[0][i - 1]);
    for (int i = 1; i < n; ++i)
        for (int j = 1; j < n; ++j)
            pref[i][j] = max(pref[i][j], max(pref[i - 1][j], pref[i][j - 1]));
    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        --l, --r;
        cout << pref[n - l - 1][r] << '\n';
    }
}

signed main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
#ifdef LOCAL
    cerr << '\n' << "time = " << clock() * 1.0 / CLOCKS_PER_SEC << '\n';
#endif
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 31 ms 8540 KB Output is correct
26 Correct 34 ms 32176 KB Output is correct
27 Correct 63 ms 25016 KB Output is correct
28 Correct 83 ms 35496 KB Output is correct
29 Correct 37 ms 9996 KB Output is correct
30 Correct 66 ms 34064 KB Output is correct
31 Correct 35 ms 3844 KB Output is correct
32 Correct 85 ms 35496 KB Output is correct
33 Correct 48 ms 15184 KB Output is correct
34 Correct 55 ms 33444 KB Output is correct
35 Correct 60 ms 20936 KB Output is correct
36 Correct 103 ms 35380 KB Output is correct
37 Correct 53 ms 31824 KB Output is correct
38 Correct 74 ms 32780 KB Output is correct
39 Correct 34 ms 30804 KB Output is correct
40 Correct 76 ms 32888 KB Output is correct
41 Correct 59 ms 32176 KB Output is correct
42 Correct 72 ms 32976 KB Output is correct
43 Correct 43 ms 30968 KB Output is correct
44 Correct 82 ms 32848 KB Output is correct
45 Correct 36 ms 30980 KB Output is correct
46 Correct 78 ms 32872 KB Output is correct
47 Correct 39 ms 31032 KB Output is correct
48 Correct 75 ms 32848 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 250 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 976 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 31 ms 8540 KB Output is correct
26 Correct 34 ms 32176 KB Output is correct
27 Correct 63 ms 25016 KB Output is correct
28 Correct 83 ms 35496 KB Output is correct
29 Correct 37 ms 9996 KB Output is correct
30 Correct 66 ms 34064 KB Output is correct
31 Correct 35 ms 3844 KB Output is correct
32 Correct 85 ms 35496 KB Output is correct
33 Correct 48 ms 15184 KB Output is correct
34 Correct 55 ms 33444 KB Output is correct
35 Correct 60 ms 20936 KB Output is correct
36 Correct 103 ms 35380 KB Output is correct
37 Correct 53 ms 31824 KB Output is correct
38 Correct 74 ms 32780 KB Output is correct
39 Correct 34 ms 30804 KB Output is correct
40 Correct 76 ms 32888 KB Output is correct
41 Correct 59 ms 32176 KB Output is correct
42 Correct 72 ms 32976 KB Output is correct
43 Correct 43 ms 30968 KB Output is correct
44 Correct 82 ms 32848 KB Output is correct
45 Correct 36 ms 30980 KB Output is correct
46 Correct 78 ms 32872 KB Output is correct
47 Correct 39 ms 31032 KB Output is correct
48 Correct 75 ms 32848 KB Output is correct
49 Runtime error 250 ms 524288 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -