oj.uz

Submission #751037

# Submission time Handle Problem Language Result Execution time Memory
751037 2023-05-30T21:24:37 Z stevancv Two Antennas (JOI19_antennas) C++14
100 / 100
 465 ms 38388 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e5 + 2;
const int inf = 2e9;
int mn[4 * N], mx[4 * N], st[4 * N], lzymn[4 * N], lzymx[4 * N], h[N];
void Propagate(int node, int l, int r) {
    if (lzymn[node] == inf) return;
    smax(st[node], lzymx[node] - mn[node]);
    smax(st[node], mx[node] - lzymn[node]);
    if (l < r) {
        smin(lzymn[2 * node], lzymn[node]);
        smin(lzymn[2 * node + 1], lzymn[node]);
        smax(lzymx[2 * node], lzymx[node]);
        smax(lzymx[2 * node + 1], lzymx[node]);
    }
    lzymn[node] = inf; lzymx[node] = -1;
}
void Update(int node, int l, int r, int x, int y) {
    Propagate(node, l, r);
    if (l == r) {
        if (y == 0) {mn[node] = mx[node] = h[l];}
        else {mn[node] = inf; mx[node] = -1;}
        return;
    }
    int mid = l + r >> 1;
    if (x <= mid) Update(2 * node, l, mid, x, y);
    else Update(2 * node + 1, mid + 1, r, x, y);
    mn[node] = min(mn[2 * node], mn[2 * node + 1]);
    mx[node] = max(mx[2 * node], mx[2 * node + 1]);
    smax(st[node], max(st[2 * node], st[2 * node + 1]));
}
void Add(int node, int l, int r, int ql, int qr, int v) {
    Propagate(node, l, r);
    if (r < ql || qr < l) return;
    if (ql <= l && r <= qr) {
        lzymn[node] = lzymx[node] = v;
        Propagate(node, l, r);
        return;
    }
    int mid = l + r >> 1;
    Add(2 * node, l, mid, ql, qr, v);
    Add(2 * node + 1, mid + 1, r, ql, qr, v);
    smax(st[node], max(st[2 * node], st[2 * node + 1]));
}
int Get(int node, int l, int r, int ql, int qr) {
    Propagate(node, l, r);
    if (r < ql || qr < l) return -1;
    if (ql <= l && r <= qr) return st[node];
    int mid = l + r >> 1;
    return max(Get(2 * node, l, mid, ql, qr), Get(2 * node + 1, mid + 1, r, ql, qr));
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    vector<int> a(n), b(n);
    vector<vector<array<int, 2>>> op(n);
    for (int i = 0; i < n; i++) {
        cin >> h[i] >> a[i] >> b[i];
        if (i + a[i] < n) op[i + a[i]].push_back({i, 0});
        if (i + b[i] + 1 < n) op[i + b[i] + 1].push_back({i, 1});
    }
    int q; cin >> q;
    vector<int> l(q), r(q), ans(q);
    vector<vector<int>> qq(n);
    for (int i = 0; i < q; i++) {
        cin >> l[i] >> r[i];
        l[i] -= 1; r[i] -= 1;
        qq[r[i]].push_back(i);
    }
    for (int i = 1; i <= 4 * n; i++) {mn[i] = lzymn[i] = inf; mx[i] = lzymx[i] = st[i] = -1;}
    for (int i = 0; i < n; i++) {
        for (auto u : op[i]) Update(1, 0, n - 1, u[0], u[1]);
        if (i >= a[i]) Add(1, 0, n - 1, max(0, i - b[i]), i - a[i], h[i]);
        for (int j : qq[i]) ans[j] = Get(1, 0, n - 1, l[j], i);
    }
    for (int i = 0; i < q; i++) cout << ans[i] << en;
    return 0;
}

Compilation message

antennas.cpp: In function 'void Update(int, int, int, int, int)':
antennas.cpp:31:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'void Add(int, int, int, int, int, int)':
antennas.cpp:46:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |     int mid = l + r >> 1;
      |               ~~^~~
antennas.cpp: In function 'int Get(int, int, int, int, int)':
antennas.cpp:55:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 63 ms 4332 KB Output is correct
26 Correct 10 ms 1000 KB Output is correct
27 Correct 98 ms 5928 KB Output is correct
28 Correct 110 ms 6032 KB Output is correct
29 Correct 80 ms 4348 KB Output is correct
30 Correct 65 ms 4308 KB Output is correct
31 Correct 74 ms 5396 KB Output is correct
32 Correct 96 ms 5968 KB Output is correct
33 Correct 117 ms 5580 KB Output is correct
34 Correct 49 ms 3208 KB Output is correct
35 Correct 112 ms 5864 KB Output is correct
36 Correct 108 ms 5964 KB Output is correct
37 Correct 56 ms 3076 KB Output is correct
38 Correct 93 ms 4992 KB Output is correct
39 Correct 14 ms 1236 KB Output is correct
40 Correct 99 ms 4988 KB Output is correct
41 Correct 74 ms 3812 KB Output is correct
42 Correct 126 ms 4948 KB Output is correct
43 Correct 33 ms 2000 KB Output is correct
44 Correct 91 ms 4960 KB Output is correct
45 Correct 17 ms 1320 KB Output is correct
46 Correct 90 ms 5076 KB Output is correct
47 Correct 28 ms 1804 KB Output is correct
48 Correct 94 ms 5040 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 27776 KB Output is correct
2 Correct 234 ms 30864 KB Output is correct
3 Correct 141 ms 21708 KB Output is correct
4 Correct 231 ms 30880 KB Output is correct
5 Correct 86 ms 14496 KB Output is correct
6 Correct 254 ms 30860 KB Output is correct
7 Correct 186 ms 26848 KB Output is correct
8 Correct 225 ms 30868 KB Output is correct
9 Correct 26 ms 5204 KB Output is correct
10 Correct 285 ms 30880 KB Output is correct
11 Correct 122 ms 19476 KB Output is correct
12 Correct 224 ms 30840 KB Output is correct
13 Correct 159 ms 29452 KB Output is correct
14 Correct 136 ms 29448 KB Output is correct
15 Correct 144 ms 29584 KB Output is correct
16 Correct 128 ms 30108 KB Output is correct
17 Correct 160 ms 29852 KB Output is correct
18 Correct 143 ms 30156 KB Output is correct
19 Correct 149 ms 29512 KB Output is correct
20 Correct 130 ms 29632 KB Output is correct
21 Correct 132 ms 29036 KB Output is correct
22 Correct 135 ms 29456 KB Output is correct
23 Correct 138 ms 29568 KB Output is correct
24 Correct 123 ms 29636 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 63 ms 4332 KB Output is correct
26 Correct 10 ms 1000 KB Output is correct
27 Correct 98 ms 5928 KB Output is correct
28 Correct 110 ms 6032 KB Output is correct
29 Correct 80 ms 4348 KB Output is correct
30 Correct 65 ms 4308 KB Output is correct
31 Correct 74 ms 5396 KB Output is correct
32 Correct 96 ms 5968 KB Output is correct
33 Correct 117 ms 5580 KB Output is correct
34 Correct 49 ms 3208 KB Output is correct
35 Correct 112 ms 5864 KB Output is correct
36 Correct 108 ms 5964 KB Output is correct
37 Correct 56 ms 3076 KB Output is correct
38 Correct 93 ms 4992 KB Output is correct
39 Correct 14 ms 1236 KB Output is correct
40 Correct 99 ms 4988 KB Output is correct
41 Correct 74 ms 3812 KB Output is correct
42 Correct 126 ms 4948 KB Output is correct
43 Correct 33 ms 2000 KB Output is correct
44 Correct 91 ms 4960 KB Output is correct
45 Correct 17 ms 1320 KB Output is correct
46 Correct 90 ms 5076 KB Output is correct
47 Correct 28 ms 1804 KB Output is correct
48 Correct 94 ms 5040 KB Output is correct
49 Correct 201 ms 27776 KB Output is correct
50 Correct 234 ms 30864 KB Output is correct
51 Correct 141 ms 21708 KB Output is correct
52 Correct 231 ms 30880 KB Output is correct
53 Correct 86 ms 14496 KB Output is correct
54 Correct 254 ms 30860 KB Output is correct
55 Correct 186 ms 26848 KB Output is correct
56 Correct 225 ms 30868 KB Output is correct
57 Correct 26 ms 5204 KB Output is correct
58 Correct 285 ms 30880 KB Output is correct
59 Correct 122 ms 19476 KB Output is correct
60 Correct 224 ms 30840 KB Output is correct
61 Correct 159 ms 29452 KB Output is correct
62 Correct 136 ms 29448 KB Output is correct
63 Correct 144 ms 29584 KB Output is correct
64 Correct 128 ms 30108 KB Output is correct
65 Correct 160 ms 29852 KB Output is correct
66 Correct 143 ms 30156 KB Output is correct
67 Correct 149 ms 29512 KB Output is correct
68 Correct 130 ms 29632 KB Output is correct
69 Correct 132 ms 29036 KB Output is correct
70 Correct 135 ms 29456 KB Output is correct
71 Correct 138 ms 29568 KB Output is correct
72 Correct 123 ms 29636 KB Output is correct
73 Correct 364 ms 33668 KB Output is correct
74 Correct 289 ms 31544 KB Output is correct
75 Correct 364 ms 28876 KB Output is correct
76 Correct 461 ms 38388 KB Output is correct
77 Correct 216 ms 19572 KB Output is correct
78 Correct 369 ms 36144 KB Output is correct
79 Correct 409 ms 34164 KB Output is correct
80 Correct 465 ms 38380 KB Output is correct
81 Correct 175 ms 10920 KB Output is correct
82 Correct 340 ms 34928 KB Output is correct
83 Correct 311 ms 26436 KB Output is correct
84 Correct 433 ms 38332 KB Output is correct
85 Correct 250 ms 33568 KB Output is correct
86 Correct 309 ms 35896 KB Output is correct
87 Correct 158 ms 30852 KB Output is correct
88 Correct 311 ms 36560 KB Output is correct
89 Correct 307 ms 34708 KB Output is correct
90 Correct 325 ms 36464 KB Output is correct
91 Correct 215 ms 32212 KB Output is correct
92 Correct 326 ms 35884 KB Output is correct
93 Correct 163 ms 30428 KB Output is correct
94 Correct 318 ms 35860 KB Output is correct
95 Correct 187 ms 31556 KB Output is correct
96 Correct 296 ms 36012 KB Output is correct