oj.uz

Submission #943069

# Submission time Handle Problem Language Result Execution time Memory
943069 2024-03-11T08:00:33 Z LOLOLO Two Antennas (JOI19_antennas) C++17
100 / 100
 623 ms 43484 KB 
#include <bits/stdc++.h>
typedef long long ll;

#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int32_t)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)

using namespace std;
const int N = 2e5 + 10;
int h[N], a[N], b[N], ans[N];
vector <pair <int, int>> ask[N], event[N];
const int lim = 1e9 + 100;

struct node{
    int mx = -1, val = lim, lz = -1;
} seg[N * 4];

void add(node &C, node A, node B) {
    C.mx = max({A.mx, B.mx, C.mx});
    C.val = min(A.val, B.val);
}

void push(int id) {
    int t = seg[id].lz;
    seg[id * 2].lz = max(seg[id * 2].lz, t);
    seg[id * 2 + 1].lz = max(seg[id * 2 + 1].lz, t);
    seg[id * 2].mx = max(seg[id * 2].mx, t - seg[id * 2].val);
    seg[id * 2 + 1].mx = max(seg[id * 2 + 1].mx, t - seg[id * 2 + 1].val);
    seg[id].lz = -1;
}

void point(int id, int l, int r, int p, int i) {
    if (l > p || r < p)
        return;

    if (l == r) {
        if (i) {
            seg[id].val = h[p];
        } else {
            seg[id].val = lim;
        }
        return;
    }

    push(id);
    int m = (l + r) / 2;
    point(id * 2, l, m, p, i);
    point(id * 2 + 1, m + 1, r, p, i);
    add(seg[id], seg[id * 2], seg[id * 2 + 1]);
}

void upd(int id, int l, int r, int u, int v, int val) {
    if (l > v || r < u || u > v)
        return;

    if (l >= u && r <= v) {
        seg[id].mx = max(seg[id].mx, val - seg[id].val);
        seg[id].lz = max(seg[id].lz, val);
        return;
    }

    int m = (l + r) / 2;
    push(id);
    upd(id * 2, l, m, u, v, val);
    upd(id * 2 + 1, m + 1, r, u, v, val);
    add(seg[id], seg[id * 2], seg[id * 2 + 1]);
}

int get(int id, int l, int r, int u, int v) {
    if (l > v || r < u || u > v)
        return -1;


    if (l >= u && r <= v)
        return seg[id].mx;

    push(id);
    int m = (l + r) / 2;
    return max(get(id * 2, l, m, u, v), get(id * 2 + 1, m + 1, r, u, v));
}

int n, q, l[N], r[N];
void solve() {
    for (int i = 1; i <= n; i++) {
        if (i + a[i] <= n)
            event[i + a[i]].pb({i, 1});
        if (b[i] + i <= n)
            event[i + b[i] + 1].pb({i, 0});
    }

    for (int i = 1; i <= q; i++) {
        ask[r[i]].pb({l[i], i});
    }

    for (int i = 1; i <= n; i++) {
        for (auto x : event[i]) {
            point(1, 1, n, x.f, x.s);
        }

        int x = max(i - b[i], 1), y = max(0, i - a[i]);
        upd(1, 1, n, x, y, h[i]);
        for (auto x : ask[i]) {
            ans[x.s] = max(ans[x.s], get(1, 1, n, x.f, i));
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    mem(ans, -1);
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> h[i] >> a[i] >> b[i];
    }

    cin >> q;
    for (int i = 1; i <= q; i++) {
        cin >> l[i] >> r[i];
    }

    solve();
    for (int i = 1; i <= n; i++) {
        event[i].clear();
        ask[i].clear();
    }

    for (int i = 1; i <= n * 4; i++) {
        seg[i].lz = -1;
        seg[i].mx = -1;
        seg[i].val = lim;
    }

    reverse(h + 1, h + n + 1);
    reverse(a + 1, a + n + 1);
    reverse(b + 1, b + n + 1);

    for (int i = 1; i <= q; i++) {
        l[i] = n - l[i] + 1;
        r[i] = n - r[i] + 1;
        swap(l[i], r[i]);
    }

    solve();

    for (int i = 1; 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 12632 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12736 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12632 KB Output is correct
9 Correct 3 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12632 KB Output is correct
14 Correct 3 ms 12632 KB Output is correct
15 Correct 3 ms 12632 KB Output is correct
16 Correct 3 ms 12632 KB Output is correct
17 Correct 3 ms 12636 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 4 ms 12632 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12736 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12632 KB Output is correct
9 Correct 3 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12632 KB Output is correct
14 Correct 3 ms 12632 KB Output is correct
15 Correct 3 ms 12632 KB Output is correct
16 Correct 3 ms 12632 KB Output is correct
17 Correct 3 ms 12636 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 4 ms 12632 KB Output is correct
25 Correct 83 ms 17236 KB Output is correct
26 Correct 14 ms 13404 KB Output is correct
27 Correct 120 ms 18772 KB Output is correct
28 Correct 122 ms 18708 KB Output is correct
29 Correct 82 ms 17472 KB Output is correct
30 Correct 84 ms 17072 KB Output is correct
31 Correct 92 ms 18384 KB Output is correct
32 Correct 121 ms 18768 KB Output is correct
33 Correct 110 ms 18820 KB Output is correct
34 Correct 61 ms 15692 KB Output is correct
35 Correct 133 ms 19324 KB Output is correct
36 Correct 122 ms 18832 KB Output is correct
37 Correct 71 ms 15952 KB Output is correct
38 Correct 129 ms 17916 KB Output is correct
39 Correct 26 ms 13676 KB Output is correct
40 Correct 121 ms 17828 KB Output is correct
41 Correct 97 ms 16856 KB Output is correct
42 Correct 119 ms 17652 KB Output is correct
43 Correct 43 ms 14672 KB Output is correct
44 Correct 120 ms 17648 KB Output is correct
45 Correct 25 ms 13800 KB Output is correct
46 Correct 122 ms 17792 KB Output is correct
47 Correct 34 ms 14160 KB Output is correct
48 Correct 122 ms 17676 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 25940 KB Output is correct
2 Correct 284 ms 27476 KB Output is correct
3 Correct 181 ms 22960 KB Output is correct
4 Correct 291 ms 27472 KB Output is correct
5 Correct 112 ms 19540 KB Output is correct
6 Correct 274 ms 27472 KB Output is correct
7 Correct 242 ms 25740 KB Output is correct
8 Correct 354 ms 27352 KB Output is correct
9 Correct 37 ms 15188 KB Output is correct
10 Correct 287 ms 27436 KB Output is correct
11 Correct 158 ms 21904 KB Output is correct
12 Correct 279 ms 27472 KB Output is correct
13 Correct 274 ms 27908 KB Output is correct
14 Correct 266 ms 27832 KB Output is correct
15 Correct 226 ms 26656 KB Output is correct
16 Correct 208 ms 26896 KB Output is correct
17 Correct 262 ms 28584 KB Output is correct
18 Correct 235 ms 27220 KB Output is correct
19 Correct 242 ms 27348 KB Output is correct
20 Correct 236 ms 27464 KB Output is correct
21 Correct 216 ms 27700 KB Output is correct
22 Correct 245 ms 27532 KB Output is correct
23 Correct 245 ms 27596 KB Output is correct
24 Correct 205 ms 26212 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 3 ms 12736 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 3 ms 12632 KB Output is correct
9 Correct 3 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12632 KB Output is correct
14 Correct 3 ms 12632 KB Output is correct
15 Correct 3 ms 12632 KB Output is correct
16 Correct 3 ms 12632 KB Output is correct
17 Correct 3 ms 12636 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 4 ms 12632 KB Output is correct
25 Correct 83 ms 17236 KB Output is correct
26 Correct 14 ms 13404 KB Output is correct
27 Correct 120 ms 18772 KB Output is correct
28 Correct 122 ms 18708 KB Output is correct
29 Correct 82 ms 17472 KB Output is correct
30 Correct 84 ms 17072 KB Output is correct
31 Correct 92 ms 18384 KB Output is correct
32 Correct 121 ms 18768 KB Output is correct
33 Correct 110 ms 18820 KB Output is correct
34 Correct 61 ms 15692 KB Output is correct
35 Correct 133 ms 19324 KB Output is correct
36 Correct 122 ms 18832 KB Output is correct
37 Correct 71 ms 15952 KB Output is correct
38 Correct 129 ms 17916 KB Output is correct
39 Correct 26 ms 13676 KB Output is correct
40 Correct 121 ms 17828 KB Output is correct
41 Correct 97 ms 16856 KB Output is correct
42 Correct 119 ms 17652 KB Output is correct
43 Correct 43 ms 14672 KB Output is correct
44 Correct 120 ms 17648 KB Output is correct
45 Correct 25 ms 13800 KB Output is correct
46 Correct 122 ms 17792 KB Output is correct
47 Correct 34 ms 14160 KB Output is correct
48 Correct 122 ms 17676 KB Output is correct
49 Correct 248 ms 25940 KB Output is correct
50 Correct 284 ms 27476 KB Output is correct
51 Correct 181 ms 22960 KB Output is correct
52 Correct 291 ms 27472 KB Output is correct
53 Correct 112 ms 19540 KB Output is correct
54 Correct 274 ms 27472 KB Output is correct
55 Correct 242 ms 25740 KB Output is correct
56 Correct 354 ms 27352 KB Output is correct
57 Correct 37 ms 15188 KB Output is correct
58 Correct 287 ms 27436 KB Output is correct
59 Correct 158 ms 21904 KB Output is correct
60 Correct 279 ms 27472 KB Output is correct
61 Correct 274 ms 27908 KB Output is correct
62 Correct 266 ms 27832 KB Output is correct
63 Correct 226 ms 26656 KB Output is correct
64 Correct 208 ms 26896 KB Output is correct
65 Correct 262 ms 28584 KB Output is correct
66 Correct 235 ms 27220 KB Output is correct
67 Correct 242 ms 27348 KB Output is correct
68 Correct 236 ms 27464 KB Output is correct
69 Correct 216 ms 27700 KB Output is correct
70 Correct 245 ms 27532 KB Output is correct
71 Correct 245 ms 27596 KB Output is correct
72 Correct 205 ms 26212 KB Output is correct
73 Correct 445 ms 32908 KB Output is correct
74 Correct 310 ms 33128 KB Output is correct
75 Correct 433 ms 36752 KB Output is correct
76 Correct 551 ms 43408 KB Output is correct
77 Correct 276 ms 29264 KB Output is correct
78 Correct 440 ms 40392 KB Output is correct
79 Correct 505 ms 40448 KB Output is correct
80 Correct 549 ms 43344 KB Output is correct
81 Correct 203 ms 24400 KB Output is correct
82 Correct 409 ms 39056 KB Output is correct
83 Correct 378 ms 35056 KB Output is correct
84 Correct 623 ms 43484 KB Output is correct
85 Correct 415 ms 39220 KB Output is correct
86 Correct 471 ms 42416 KB Output is correct
87 Correct 276 ms 33200 KB Output is correct
88 Correct 517 ms 42008 KB Output is correct
89 Correct 446 ms 40904 KB Output is correct
90 Correct 482 ms 42292 KB Output is correct
91 Correct 327 ms 36320 KB Output is correct
92 Correct 513 ms 42440 KB Output is correct
93 Correct 271 ms 34712 KB Output is correct
94 Correct 476 ms 42304 KB Output is correct
95 Correct 329 ms 35712 KB Output is correct
96 Correct 460 ms 41168 KB Output is correct