oj.uz

Submission #613664

# Submission time Handle Problem Language Result Execution time Memory
613664 2022-07-30T09:03:25 Z tengiz05 Two Antennas (JOI19_antennas) C++17
13 / 100
 3000 ms 14784 KB 
#include <bits/stdc++.h>

using i64 = long long;
using namespace std;

constexpr int N = 2E5;
constexpr i64 inf = 1E18;

i64 A[N], historyMax[N];

void update(int p, i64 x) {
    A[p] = x;
}
void decrease(int l, int r, int x) {
    for (int i = l; i < r; i++) {
        A[i] -= x;
        historyMax[i] = max(historyMax[i], A[i]);
    }
}
void increase(int l, int r, int x) {
    for (int i = l; i < r; i++) {
        A[i] += x;
    }
}
int query(int l, int r) {
    i64 res = -1;
    for (int i = l; i < r; i++) {
        res = max(res, historyMax[i]);
    }
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    for (int i = 0; i < N; i++) {
        A[i] = -inf;
        historyMax[i] = -1;
    }
    
    int n;
    cin >> n;
    
    vector<int> h(n), a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> h[i] >> a[i] >> b[i];
    }
    
    vector<array<int, 3>> g;
    for (int i = 0; i < n; i++) {
        g.push_back({i + a[i], 1, i});
        g.push_back({i + b[i] + 1, -1, i});
    }
    
    sort(g.begin(), g.end());
    
    int q;
    cin >> q;
    
    vector<vector<array<int, 2>>> Q(n);
    vector<int> ans(q);
    for (int i = 0; i < q; i++) {
        int l, r;
        cin >> l >> r;
        l--;
        r--;
        Q[r].push_back({l, i});
    }
    
    int k = 0;
    
    for (int i = 0; i < n; i++) {
        while (k < int(g.size()) && g[k][0] == i) {
            int p = g[k][2];
            if (g[k][1] == 1) {
                update(p, h[p]);
            } else {
                update(p, -inf);
            }
            k++;
        }
        int L = max(0, i - b[i]);
        int R = max(0, i - a[i] + 1);
        decrease(L, R, h[i]);
        for (auto [l, id] : Q[i]) {
            ans[id] = query(l, i + 1);
        }
        increase(L, R, h[i]);
    }
    
    for (int i = 0; i < N; i++) {
        A[i] = -inf;
        historyMax[i] = -1;
    }
    
    k = 0;
    
    for (int i = 0; i < n; i++) {
        while (k < int(g.size()) && g[k][0] == i) {
            int p = g[k][2];
            if (g[k][1] == 1) {
                update(p, -h[p]);
            } else {
                update(p, -inf);
            }
            k++;
        }
        int L = max(0, i - b[i]);
        int R = max(0, i - a[i] + 1);
        decrease(L, R, -h[i]);
        for (auto [l, id] : Q[i]) {
            ans[id] = max(ans[id], query(l, i + 1));
        }
        increase(L, R, -h[i]);
    }
    
    for (int i = 0; i < q; i++) {
        cout << ans[i] << "\n";
    }
    
    return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 3 ms 3368 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3452 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 2 ms 3412 KB Output is correct
24 Correct 2 ms 3460 KB Output is correct
25 Correct 103 ms 7896 KB Output is correct
26 Correct 23 ms 4112 KB Output is correct
27 Correct 215 ms 9264 KB Output is correct
28 Correct 254 ms 9296 KB Output is correct
29 Correct 103 ms 7848 KB Output is correct
30 Correct 162 ms 7628 KB Output is correct
31 Correct 72 ms 8624 KB Output is correct
32 Correct 246 ms 9292 KB Output is correct
33 Correct 163 ms 9036 KB Output is correct
34 Correct 119 ms 6492 KB Output is correct
35 Correct 194 ms 9264 KB Output is correct
36 Correct 257 ms 9300 KB Output is correct
37 Correct 139 ms 6604 KB Output is correct
38 Correct 240 ms 8396 KB Output is correct
39 Correct 38 ms 4328 KB Output is correct
40 Correct 243 ms 8320 KB Output is correct
41 Correct 173 ms 7228 KB Output is correct
42 Correct 256 ms 8396 KB Output is correct
43 Correct 85 ms 5280 KB Output is correct
44 Correct 241 ms 8320 KB Output is correct
45 Correct 45 ms 4464 KB Output is correct
46 Correct 242 ms 8380 KB Output is correct
47 Correct 63 ms 4916 KB Output is correct
48 Correct 240 ms 8320 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3035 ms 14784 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 3 ms 3368 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3452 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 2 ms 3412 KB Output is correct
24 Correct 2 ms 3460 KB Output is correct
25 Correct 103 ms 7896 KB Output is correct
26 Correct 23 ms 4112 KB Output is correct
27 Correct 215 ms 9264 KB Output is correct
28 Correct 254 ms 9296 KB Output is correct
29 Correct 103 ms 7848 KB Output is correct
30 Correct 162 ms 7628 KB Output is correct
31 Correct 72 ms 8624 KB Output is correct
32 Correct 246 ms 9292 KB Output is correct
33 Correct 163 ms 9036 KB Output is correct
34 Correct 119 ms 6492 KB Output is correct
35 Correct 194 ms 9264 KB Output is correct
36 Correct 257 ms 9300 KB Output is correct
37 Correct 139 ms 6604 KB Output is correct
38 Correct 240 ms 8396 KB Output is correct
39 Correct 38 ms 4328 KB Output is correct
40 Correct 243 ms 8320 KB Output is correct
41 Correct 173 ms 7228 KB Output is correct
42 Correct 256 ms 8396 KB Output is correct
43 Correct 85 ms 5280 KB Output is correct
44 Correct 241 ms 8320 KB Output is correct
45 Correct 45 ms 4464 KB Output is correct
46 Correct 242 ms 8380 KB Output is correct
47 Correct 63 ms 4916 KB Output is correct
48 Correct 240 ms 8320 KB Output is correct
49 Execution timed out 3035 ms 14784 KB Time limit exceeded
50 Halted 0 ms 0 KB -