oj.uz

Submission #366884

# Submission time Handle Problem Language Result Execution time Memory
366884 2021-02-15T15:57:49 Z valerikk Two Antennas (JOI19_antennas) C++17
100 / 100
 1032 ms 45540 KB 
#include <bits/stdc++.h>
using namespace std;
  
const int N = 3e5 + 7;
const int INF = 1e9 + 1010;
  
int n, q;
int h[N], a[N], b[N];
int L[N], R[N];
int ans[N];
int c[N];
int t[4 * N]; // max d[i]
int min_h[4 * N]; 
int max_c[4 * N];
vector<pair<int, int>> events[N];
vector<int> here[N];
  
void upd(int i, int val) {
    /*if (i == 9 && val == 3) {
        cout << max_c[i] << endl;
    }*/
    min_h[i] = min(min_h[i], val);
    t[i] = max(t[i], max_c[i] - min_h[i]);
    /*if (i == 9 && val == 3) {
        cout << t[i] << " " << max_c[i] << " " << min_h[i] << endl;
    }*/
}
  
void push(int i) {
    upd(2 * i, min_h[i]);
    upd(2 * i + 1, min_h[i]);
    min_h[i] = INF;
}
  
void pull(int i) {
    max_c[i] = max(max_c[2 * i], max_c[2 * i + 1]);
    t[i] = max({t[i], max_c[i] - min_h[i], t[2 * i], t[2 * i + 1]});
} 
 
void upd_seg(int i, int l, int r, int ql, int qr, int val) {
    if (l >= qr || r <= ql)
        return;
    if (l >= ql && r <= qr) {
        /*if (val == 3) {
            cout << i << " " << l << " " << r << endl;
        }*/
        upd(i, val);
        /*if (val == 3) {
            cout << t[i] << endl;
        }*/
        return;
    }
  
    push(i);
    int m = (l + r) / 2;
    upd_seg(2 * i, l, m, ql, qr, val);
    upd_seg(2 * i + 1, m, r, ql, qr, val);
    pull(i);
}
  
void upd_c(int i, int l, int r, int pos, int new_c) {
    if (r - l == 1) {
        min_h[i] = INF;
        c[pos] = max_c[i] = new_c;
    } else {
        push(i);
        int m = (l + r) / 2;
        if (pos < m)
            upd_c(2 * i, l, m, pos, new_c);
        else
            upd_c(2 * i + 1, m, r, pos, new_c);
        pull(i);
    }
}
  
int get_max(int i, int l, int r, int ql, int qr) {
    if (l >= qr || r <= ql)
        return -1;
    if (l >= ql && r <= qr) {
        //cout << i << " " << l << " " << r << " " << t[i] << endl;
        return t[i];
    }
    push(i);
    int m = (l + r) / 2;
    return max(get_max(2 * i, l, m, ql, qr), get_max(2 * i + 1, m, r, ql, qr));
}
  
void build(int i, int l, int r) {
    min_h[i] = INF;
    max_c[i] = -1;
    t[i] = -1;
    if (r - l == 1) {
        c[l] = -1;
    } else {
        int m = (l + r) / 2;
        build(2 * i, l, m);
        build(2 * i + 1, m, r);
    }
}
  
void solve() {
    for (int i = 0; i <= n; i++) {
        events[i].clear();
        here[i].clear();
    }
    for (int i = 0; i < n; i++) {
        int l = i + a[i], r = min(n, i + b[i] + 1);
        if (l < r) {
            events[l].emplace_back(i, h[i]);
            events[r].emplace_back(i, -INF);
        }
    }
      
    for (int i = 0; i < q; i++) 
        here[R[i]].push_back(i);
      
    build(1, 0, n);
    for (int i = 0; i <= n; i++) {
        for (int qid : here[i]) 
            ans[qid] = max(ans[qid], get_max(1, 0, n, L[qid], R[qid]));
  
        for (auto [pos, new_c] : events[i]) {
            //cout << "upd_c " << pos << " " << new_c << endl;
            upd_c(1, 0, n, pos, new_c);
        }
        if (i != n) {
            int l = max(0, i - b[i]), r = i - a[i] + 1;
            //cout << "segadd " << i << " " << l << " " << r << " " << h[i] << endl;
            /*if (h[i] == 3) 
                cout << l << " " << r << endl;*/
            if (l < r)
                upd_seg(1, 0, n, l, r, h[i]);
        }
    }
}
  
int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) 
        cin >> h[i] >> a[i] >> b[i];
    cin >> q;
    for (int i = 0; i < q; i++) {
        cin >> L[i] >> R[i];
        L[i]--;
        ans[i] = -1;
    }
      
    for (int _ = 0; _ < 2; _++) {
        solve();
        reverse(h, h + n);
        reverse(a, a + n);
        reverse(b, b + n);
        for (int i = 0; i < q; i++) {
            R[i]--;
            L[i] = n - 1 - L[i];
            R[i] = n - 1 - R[i];
            swap(L[i], R[i]);
            R[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 10 ms 14444 KB Output is correct
2 Correct 11 ms 14572 KB Output is correct
3 Correct 12 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 10 ms 14572 KB Output is correct
6 Correct 12 ms 14572 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 12 ms 14564 KB Output is correct
9 Correct 11 ms 14572 KB Output is correct
10 Correct 13 ms 14572 KB Output is correct
11 Correct 12 ms 14476 KB Output is correct
12 Correct 11 ms 14572 KB Output is correct
13 Correct 10 ms 14572 KB Output is correct
14 Correct 11 ms 14572 KB Output is correct
15 Correct 11 ms 14572 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14572 KB Output is correct
18 Correct 11 ms 14572 KB Output is correct
19 Correct 10 ms 14572 KB Output is correct
20 Correct 11 ms 14572 KB Output is correct
21 Correct 10 ms 14572 KB Output is correct
22 Correct 11 ms 14572 KB Output is correct
23 Correct 12 ms 14572 KB Output is correct
24 Correct 12 ms 14572 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 11 ms 14572 KB Output is correct
3 Correct 12 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 10 ms 14572 KB Output is correct
6 Correct 12 ms 14572 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 12 ms 14564 KB Output is correct
9 Correct 11 ms 14572 KB Output is correct
10 Correct 13 ms 14572 KB Output is correct
11 Correct 12 ms 14476 KB Output is correct
12 Correct 11 ms 14572 KB Output is correct
13 Correct 10 ms 14572 KB Output is correct
14 Correct 11 ms 14572 KB Output is correct
15 Correct 11 ms 14572 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14572 KB Output is correct
18 Correct 11 ms 14572 KB Output is correct
19 Correct 10 ms 14572 KB Output is correct
20 Correct 11 ms 14572 KB Output is correct
21 Correct 10 ms 14572 KB Output is correct
22 Correct 11 ms 14572 KB Output is correct
23 Correct 12 ms 14572 KB Output is correct
24 Correct 12 ms 14572 KB Output is correct
25 Correct 144 ms 19948 KB Output is correct
26 Correct 32 ms 15360 KB Output is correct
27 Correct 211 ms 22380 KB Output is correct
28 Correct 210 ms 22252 KB Output is correct
29 Correct 142 ms 20076 KB Output is correct
30 Correct 145 ms 19820 KB Output is correct
31 Correct 156 ms 21484 KB Output is correct
32 Correct 211 ms 22124 KB Output is correct
33 Correct 178 ms 21868 KB Output is correct
34 Correct 108 ms 18548 KB Output is correct
35 Correct 210 ms 22404 KB Output is correct
36 Correct 206 ms 22124 KB Output is correct
37 Correct 122 ms 18540 KB Output is correct
38 Correct 207 ms 21228 KB Output is correct
39 Correct 46 ms 15724 KB Output is correct
40 Correct 194 ms 21356 KB Output is correct
41 Correct 153 ms 19564 KB Output is correct
42 Correct 221 ms 21228 KB Output is correct
43 Correct 78 ms 16876 KB Output is correct
44 Correct 215 ms 21356 KB Output is correct
45 Correct 43 ms 15992 KB Output is correct
46 Correct 204 ms 21288 KB Output is correct
47 Correct 58 ms 16364 KB Output is correct
48 Correct 195 ms 21228 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 28784 KB Output is correct
2 Correct 516 ms 29540 KB Output is correct
3 Correct 338 ms 27112 KB Output is correct
4 Correct 511 ms 29540 KB Output is correct
5 Correct 204 ms 22120 KB Output is correct
6 Correct 610 ms 29632 KB Output is correct
7 Correct 423 ms 28516 KB Output is correct
8 Correct 568 ms 29552 KB Output is correct
9 Correct 74 ms 17260 KB Output is correct
10 Correct 497 ms 29668 KB Output is correct
11 Correct 311 ms 23552 KB Output is correct
12 Correct 494 ms 29540 KB Output is correct
13 Correct 386 ms 29792 KB Output is correct
14 Correct 361 ms 29488 KB Output is correct
15 Correct 348 ms 28600 KB Output is correct
16 Correct 362 ms 28876 KB Output is correct
17 Correct 470 ms 30364 KB Output is correct
18 Correct 484 ms 29292 KB Output is correct
19 Correct 392 ms 29412 KB Output is correct
20 Correct 378 ms 29148 KB Output is correct
21 Correct 359 ms 29468 KB Output is correct
22 Correct 374 ms 29308 KB Output is correct
23 Correct 418 ms 29668 KB Output is correct
24 Correct 329 ms 27972 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 11 ms 14572 KB Output is correct
3 Correct 12 ms 14572 KB Output is correct
4 Correct 11 ms 14572 KB Output is correct
5 Correct 10 ms 14572 KB Output is correct
6 Correct 12 ms 14572 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 12 ms 14564 KB Output is correct
9 Correct 11 ms 14572 KB Output is correct
10 Correct 13 ms 14572 KB Output is correct
11 Correct 12 ms 14476 KB Output is correct
12 Correct 11 ms 14572 KB Output is correct
13 Correct 10 ms 14572 KB Output is correct
14 Correct 11 ms 14572 KB Output is correct
15 Correct 11 ms 14572 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14572 KB Output is correct
18 Correct 11 ms 14572 KB Output is correct
19 Correct 10 ms 14572 KB Output is correct
20 Correct 11 ms 14572 KB Output is correct
21 Correct 10 ms 14572 KB Output is correct
22 Correct 11 ms 14572 KB Output is correct
23 Correct 12 ms 14572 KB Output is correct
24 Correct 12 ms 14572 KB Output is correct
25 Correct 144 ms 19948 KB Output is correct
26 Correct 32 ms 15360 KB Output is correct
27 Correct 211 ms 22380 KB Output is correct
28 Correct 210 ms 22252 KB Output is correct
29 Correct 142 ms 20076 KB Output is correct
30 Correct 145 ms 19820 KB Output is correct
31 Correct 156 ms 21484 KB Output is correct
32 Correct 211 ms 22124 KB Output is correct
33 Correct 178 ms 21868 KB Output is correct
34 Correct 108 ms 18548 KB Output is correct
35 Correct 210 ms 22404 KB Output is correct
36 Correct 206 ms 22124 KB Output is correct
37 Correct 122 ms 18540 KB Output is correct
38 Correct 207 ms 21228 KB Output is correct
39 Correct 46 ms 15724 KB Output is correct
40 Correct 194 ms 21356 KB Output is correct
41 Correct 153 ms 19564 KB Output is correct
42 Correct 221 ms 21228 KB Output is correct
43 Correct 78 ms 16876 KB Output is correct
44 Correct 215 ms 21356 KB Output is correct
45 Correct 43 ms 15992 KB Output is correct
46 Correct 204 ms 21288 KB Output is correct
47 Correct 58 ms 16364 KB Output is correct
48 Correct 195 ms 21228 KB Output is correct
49 Correct 472 ms 28784 KB Output is correct
50 Correct 516 ms 29540 KB Output is correct
51 Correct 338 ms 27112 KB Output is correct
52 Correct 511 ms 29540 KB Output is correct
53 Correct 204 ms 22120 KB Output is correct
54 Correct 610 ms 29632 KB Output is correct
55 Correct 423 ms 28516 KB Output is correct
56 Correct 568 ms 29552 KB Output is correct
57 Correct 74 ms 17260 KB Output is correct
58 Correct 497 ms 29668 KB Output is correct
59 Correct 311 ms 23552 KB Output is correct
60 Correct 494 ms 29540 KB Output is correct
61 Correct 386 ms 29792 KB Output is correct
62 Correct 361 ms 29488 KB Output is correct
63 Correct 348 ms 28600 KB Output is correct
64 Correct 362 ms 28876 KB Output is correct
65 Correct 470 ms 30364 KB Output is correct
66 Correct 484 ms 29292 KB Output is correct
67 Correct 392 ms 29412 KB Output is correct
68 Correct 378 ms 29148 KB Output is correct
69 Correct 359 ms 29468 KB Output is correct
70 Correct 374 ms 29308 KB Output is correct
71 Correct 418 ms 29668 KB Output is correct
72 Correct 329 ms 27972 KB Output is correct
73 Correct 869 ms 41724 KB Output is correct
74 Correct 550 ms 34788 KB Output is correct
75 Correct 783 ms 40424 KB Output is correct
76 Correct 1032 ms 45388 KB Output is correct
77 Correct 487 ms 31080 KB Output is correct
78 Correct 901 ms 42332 KB Output is correct
79 Correct 968 ms 43236 KB Output is correct
80 Correct 1016 ms 45436 KB Output is correct
81 Correct 379 ms 25708 KB Output is correct
82 Correct 742 ms 40164 KB Output is correct
83 Correct 707 ms 36200 KB Output is correct
84 Correct 1028 ms 45540 KB Output is correct
85 Correct 698 ms 40840 KB Output is correct
86 Correct 875 ms 44168 KB Output is correct
87 Correct 408 ms 34400 KB Output is correct
88 Correct 831 ms 43284 KB Output is correct
89 Correct 779 ms 42780 KB Output is correct
90 Correct 932 ms 43748 KB Output is correct
91 Correct 537 ms 37596 KB Output is correct
92 Correct 850 ms 43868 KB Output is correct
93 Correct 463 ms 35924 KB Output is correct
94 Correct 865 ms 43996 KB Output is correct
95 Correct 497 ms 37092 KB Output is correct
96 Correct 802 ms 42824 KB Output is correct