oj.uz

Submission #751036

# Submission time Handle Problem Language Result Execution time Memory
751036 2023-05-30T21:23:47 Z stevancv Two Antennas (JOI19_antennas) C++14
100 / 100
 468 ms 45580 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;
    int aa = Get(2 * node, l, mid, ql, qr);
    int bb = Get(2 * node + 1, mid + 1, r, ql, qr);
    smax(st[node], max(st[2 * node], st[2 * node + 1]));
    return max(aa, bb);
}
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 1 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 332 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 352 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 340 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 1 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 332 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 352 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 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 72 ms 5516 KB Output is correct
26 Correct 13 ms 1236 KB Output is correct
27 Correct 106 ms 7716 KB Output is correct
28 Correct 104 ms 7824 KB Output is correct
29 Correct 83 ms 5512 KB Output is correct
30 Correct 69 ms 5444 KB Output is correct
31 Correct 85 ms 6828 KB Output is correct
32 Correct 111 ms 7904 KB Output is correct
33 Correct 99 ms 7220 KB Output is correct
34 Correct 60 ms 4104 KB Output is correct
35 Correct 109 ms 7628 KB Output is correct
36 Correct 101 ms 7848 KB Output is correct
37 Correct 58 ms 4244 KB Output is correct
38 Correct 103 ms 6872 KB Output is correct
39 Correct 15 ms 1532 KB Output is correct
40 Correct 97 ms 6860 KB Output is correct
41 Correct 71 ms 5136 KB Output is correct
42 Correct 107 ms 6800 KB Output is correct
43 Correct 36 ms 2628 KB Output is correct
44 Correct 96 ms 6840 KB Output is correct
45 Correct 19 ms 1660 KB Output is correct
46 Correct 123 ms 6896 KB Output is correct
47 Correct 31 ms 2288 KB Output is correct
48 Correct 99 ms 6884 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 31984 KB Output is correct
2 Correct 264 ms 35408 KB Output is correct
3 Correct 180 ms 24888 KB Output is correct
4 Correct 252 ms 35380 KB Output is correct
5 Correct 90 ms 16448 KB Output is correct
6 Correct 278 ms 35440 KB Output is correct
7 Correct 191 ms 30760 KB Output is correct
8 Correct 256 ms 35492 KB Output is correct
9 Correct 28 ms 5844 KB Output is correct
10 Correct 230 ms 35408 KB Output is correct
11 Correct 130 ms 22152 KB Output is correct
12 Correct 258 ms 35400 KB Output is correct
13 Correct 148 ms 33976 KB Output is correct
14 Correct 143 ms 33976 KB Output is correct
15 Correct 138 ms 33956 KB Output is correct
16 Correct 146 ms 34636 KB Output is correct
17 Correct 148 ms 34100 KB Output is correct
18 Correct 134 ms 34508 KB Output is correct
19 Correct 146 ms 33844 KB Output is correct
20 Correct 136 ms 33972 KB Output is correct
21 Correct 139 ms 33340 KB Output is correct
22 Correct 144 ms 33872 KB Output is correct
23 Correct 152 ms 33848 KB Output is correct
24 Correct 122 ms 34016 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 332 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 352 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 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 72 ms 5516 KB Output is correct
26 Correct 13 ms 1236 KB Output is correct
27 Correct 106 ms 7716 KB Output is correct
28 Correct 104 ms 7824 KB Output is correct
29 Correct 83 ms 5512 KB Output is correct
30 Correct 69 ms 5444 KB Output is correct
31 Correct 85 ms 6828 KB Output is correct
32 Correct 111 ms 7904 KB Output is correct
33 Correct 99 ms 7220 KB Output is correct
34 Correct 60 ms 4104 KB Output is correct
35 Correct 109 ms 7628 KB Output is correct
36 Correct 101 ms 7848 KB Output is correct
37 Correct 58 ms 4244 KB Output is correct
38 Correct 103 ms 6872 KB Output is correct
39 Correct 15 ms 1532 KB Output is correct
40 Correct 97 ms 6860 KB Output is correct
41 Correct 71 ms 5136 KB Output is correct
42 Correct 107 ms 6800 KB Output is correct
43 Correct 36 ms 2628 KB Output is correct
44 Correct 96 ms 6840 KB Output is correct
45 Correct 19 ms 1660 KB Output is correct
46 Correct 123 ms 6896 KB Output is correct
47 Correct 31 ms 2288 KB Output is correct
48 Correct 99 ms 6884 KB Output is correct
49 Correct 230 ms 31984 KB Output is correct
50 Correct 264 ms 35408 KB Output is correct
51 Correct 180 ms 24888 KB Output is correct
52 Correct 252 ms 35380 KB Output is correct
53 Correct 90 ms 16448 KB Output is correct
54 Correct 278 ms 35440 KB Output is correct
55 Correct 191 ms 30760 KB Output is correct
56 Correct 256 ms 35492 KB Output is correct
57 Correct 28 ms 5844 KB Output is correct
58 Correct 230 ms 35408 KB Output is correct
59 Correct 130 ms 22152 KB Output is correct
60 Correct 258 ms 35400 KB Output is correct
61 Correct 148 ms 33976 KB Output is correct
62 Correct 143 ms 33976 KB Output is correct
63 Correct 138 ms 33956 KB Output is correct
64 Correct 146 ms 34636 KB Output is correct
65 Correct 148 ms 34100 KB Output is correct
66 Correct 134 ms 34508 KB Output is correct
67 Correct 146 ms 33844 KB Output is correct
68 Correct 136 ms 33972 KB Output is correct
69 Correct 139 ms 33340 KB Output is correct
70 Correct 144 ms 33872 KB Output is correct
71 Correct 152 ms 33848 KB Output is correct
72 Correct 122 ms 34016 KB Output is correct
73 Correct 392 ms 39628 KB Output is correct
74 Correct 291 ms 36272 KB Output is correct
75 Correct 350 ms 34504 KB Output is correct
76 Correct 468 ms 45516 KB Output is correct
77 Correct 232 ms 23268 KB Output is correct
78 Correct 395 ms 42480 KB Output is correct
79 Correct 447 ms 40676 KB Output is correct
80 Correct 461 ms 45580 KB Output is correct
81 Correct 178 ms 13852 KB Output is correct
82 Correct 346 ms 40716 KB Output is correct
83 Correct 375 ms 31676 KB Output is correct
84 Correct 461 ms 45512 KB Output is correct
85 Correct 259 ms 39480 KB Output is correct
86 Correct 334 ms 42896 KB Output is correct
87 Correct 161 ms 35472 KB Output is correct
88 Correct 353 ms 43604 KB Output is correct
89 Correct 316 ms 40960 KB Output is correct
90 Correct 339 ms 43468 KB Output is correct
91 Correct 211 ms 37340 KB Output is correct
92 Correct 337 ms 42868 KB Output is correct
93 Correct 175 ms 35456 KB Output is correct
94 Correct 354 ms 42772 KB Output is correct
95 Correct 198 ms 36548 KB Output is correct
96 Correct 314 ms 43060 KB Output is correct