oj.uz

Submission #798534

# Submission time Handle Problem Language Result Execution time Memory
798534 2023-07-30T19:59:42 Z PurpleCrayon Two Antennas (JOI19_antennas) C++17
100 / 100
 613 ms 37132 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 2e5+10, MOD = 1e9+7;

// activate i, deactivate i
// setmax range of active things
// query max{value - h[i]}
//
// support this with lazy segtree?

int n, q, h[N], a[N], b[N], ans[N];
ar<int, 2> qs[N];
vector<pair<int, int>> ql[N];

struct T {
    int mn_on, ans;
    int lzy;

    T() {
        mn_on = MOD;
        ans = lzy = -1;
    }

    T(int x, bool on) {
        mn_on = (on ? x : MOD);
        ans = lzy = -1;
    }

    friend T operator + (const T& one, const T& two) {
        T res; res.lzy = -1;
        res.ans = max(one.ans, two.ans);
        res.mn_on = min(one.mn_on, two.mn_on);
        return res;
    }
} t[4 * N];

bool on[N];

void build(int v, int tl, int tr) {
    if (tl == tr) t[v] = T(), on[tl] = 0;
    else {
        int tm = (tl + tr) / 2;
        build(2*v, tl, tm), build(2*v+1, tm+1, tr);
        t[v] = t[2*v] + t[2*v+1];
    }
}

void push(int v, int tl, int tr, int x) {
    if (x == -1) return;

    t[v].ans = max(t[v].ans, x - t[v].mn_on);
    if (tl != tr) {
        t[2*v].lzy = max(t[2*v].lzy, x);
        t[2*v+1].lzy = max(t[2*v+1].lzy, x);
    }
}

void app(int v, int tl, int tr) {
    push(v, tl, tr, t[v].lzy), t[v].lzy = -1;
}

void toggle(int v, int tl, int tr, int pos) {
    app(v, tl, tr);
    if (pos < tl || pos > tr) return;
    if (tl == tr) {
        int old_ans = t[v].ans;

        on[pos] ^= 1;
        t[v] = T(h[pos], on[pos]);
        t[v].ans = old_ans;
        return;
    }

    int tm = (tl + tr) / 2;
    toggle(2*v, tl, tm, pos), toggle(2*v+1, tm+1, tr, pos);
    t[v] = t[2*v] + t[2*v+1];
}

void upd(int v, int tl, int tr, int l, int r, int x) {
    app(v, tl, tr);
    if (r < tl || l > tr) return;
    if (l <= tl && tr <= r) {
        push(v, tl, tr, x);
        return;
    }
    
    int tm = (tl + tr) / 2;
    upd(2*v, tl, tm, l, r, x), upd(2*v+1, tm+1, tr, l, r, x);
    t[v] = t[2*v] + t[2*v+1];
}

int qry(int v, int tl, int tr, int l, int r) {
    app(v, tl, tr);
    if (r < tl || l > tr) return -1;
    if (l <= tl && tr <= r) return t[v].ans;
    int tm = (tl + tr) / 2;
    return max(qry(2*v, tl, tm, l, r), qry(2*v+1, tm+1, tr, l, r));
}

/*
bool on[N];
int t[N];

void toggle(int x) {
    on[x] ^= 1;
}

void upd(int l, int r, int x) {
    for (int i = l; i <= r; i++) if (on[i])
        t[i] = max(t[i], x);
}

int qry(int l, int r) {
    int cur = -1;
    for (int i = l; i <= r; i++)
        cur = max(cur, t[i] - h[i]);
    return cur;
}
*/

void calc() {
    for (int i = 0; i < n; i++) ql[i].clear();

    vector<vector<int>> ev(n);
    for (int i = 0; i < n; i++) {
        int L = i - b[i], R = i - a[i];
        L = max(L, 0);
        if (L <= R) {
            ev[R].push_back(i);
            if (L) ev[L-1].push_back(i);
        }
    }

    for (int i = 0; i < q; i++) {
        auto [l, r] = qs[i];
        ql[l].push_back({r, i});
    }

    build(1, 0, n-1);
    /*
    memset(t, -1, sizeof(t));
    memset(on, 0, sizeof(on));
    */
    for (int i = n-1; i >= 0; i--) {
        for (int x : ev[i]) {
            toggle(1, 0, n-1, x);
        }
        int L = i + a[i], R = i + b[i];
        R = min(R, n-1);

        if (L <= R)
            upd(1, 0, n-1, L, R, h[i]);

        for (auto [r, id] : ql[i]) {
            ans[id] = max(ans[id], qry(1, 0, n-1, i, r));
        }
    }
}

void solve() {
    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++) {
        int l, r; cin >> l >> r, --l, --r;
        qs[i] = {l, r};
    }

    memset(ans, -1, sizeof(ans));
    for (int rep = 0; rep < 2; rep++) {
        calc();

        reverse(h, h + n);
        reverse(a, a + n);
        reverse(b, b + n);
        for (int i = 0; i < q; i++) {
            auto [l, r] = qs[i];
            qs[i] = {n - 1 - r, n - 1 - l};
        }
    }

    for (int i = 0; i < q; i++) {
        cout << ans[i] << '\n';
    }
}
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15188 KB Output is correct
2 Correct 7 ms 15212 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 7 ms 15196 KB Output is correct
6 Correct 7 ms 15232 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 7 ms 15152 KB Output is correct
10 Correct 7 ms 15188 KB Output is correct
11 Correct 7 ms 15188 KB Output is correct
12 Correct 7 ms 15188 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 7 ms 15192 KB Output is correct
15 Correct 7 ms 15188 KB Output is correct
16 Correct 7 ms 15188 KB Output is correct
17 Correct 7 ms 15188 KB Output is correct
18 Correct 7 ms 15188 KB Output is correct
19 Correct 7 ms 15188 KB Output is correct
20 Correct 7 ms 15144 KB Output is correct
21 Correct 7 ms 15192 KB Output is correct
22 Correct 8 ms 15192 KB Output is correct
23 Correct 7 ms 15188 KB Output is correct
24 Correct 7 ms 15188 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15188 KB Output is correct
2 Correct 7 ms 15212 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 7 ms 15196 KB Output is correct
6 Correct 7 ms 15232 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 7 ms 15152 KB Output is correct
10 Correct 7 ms 15188 KB Output is correct
11 Correct 7 ms 15188 KB Output is correct
12 Correct 7 ms 15188 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 7 ms 15192 KB Output is correct
15 Correct 7 ms 15188 KB Output is correct
16 Correct 7 ms 15188 KB Output is correct
17 Correct 7 ms 15188 KB Output is correct
18 Correct 7 ms 15188 KB Output is correct
19 Correct 7 ms 15188 KB Output is correct
20 Correct 7 ms 15144 KB Output is correct
21 Correct 7 ms 15192 KB Output is correct
22 Correct 8 ms 15192 KB Output is correct
23 Correct 7 ms 15188 KB Output is correct
24 Correct 7 ms 15188 KB Output is correct
25 Correct 91 ms 21072 KB Output is correct
26 Correct 20 ms 15976 KB Output is correct
27 Correct 139 ms 23084 KB Output is correct
28 Correct 136 ms 22988 KB Output is correct
29 Correct 93 ms 21224 KB Output is correct
30 Correct 93 ms 20660 KB Output is correct
31 Correct 100 ms 22360 KB Output is correct
32 Correct 136 ms 23020 KB Output is correct
33 Correct 120 ms 22832 KB Output is correct
34 Correct 71 ms 19280 KB Output is correct
35 Correct 135 ms 23236 KB Output is correct
36 Correct 139 ms 22992 KB Output is correct
37 Correct 79 ms 19396 KB Output is correct
38 Correct 137 ms 22040 KB Output is correct
39 Correct 26 ms 16340 KB Output is correct
40 Correct 130 ms 22056 KB Output is correct
41 Correct 99 ms 20564 KB Output is correct
42 Correct 131 ms 21948 KB Output is correct
43 Correct 52 ms 17872 KB Output is correct
44 Correct 130 ms 21960 KB Output is correct
45 Correct 29 ms 16612 KB Output is correct
46 Correct 130 ms 22096 KB Output is correct
47 Correct 40 ms 17228 KB Output is correct
48 Correct 134 ms 22160 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 25788 KB Output is correct
2 Correct 340 ms 27892 KB Output is correct
3 Correct 216 ms 24768 KB Output is correct
4 Correct 344 ms 27784 KB Output is correct
5 Correct 137 ms 21860 KB Output is correct
6 Correct 324 ms 27772 KB Output is correct
7 Correct 286 ms 26436 KB Output is correct
8 Correct 326 ms 27732 KB Output is correct
9 Correct 47 ms 17484 KB Output is correct
10 Correct 325 ms 27784 KB Output is correct
11 Correct 191 ms 23888 KB Output is correct
12 Correct 326 ms 27768 KB Output is correct
13 Correct 225 ms 27240 KB Output is correct
14 Correct 210 ms 26828 KB Output is correct
15 Correct 206 ms 25992 KB Output is correct
16 Correct 187 ms 26396 KB Output is correct
17 Correct 240 ms 27400 KB Output is correct
18 Correct 214 ms 26468 KB Output is correct
19 Correct 221 ms 26600 KB Output is correct
20 Correct 224 ms 26816 KB Output is correct
21 Correct 196 ms 27260 KB Output is correct
22 Correct 215 ms 26848 KB Output is correct
23 Correct 212 ms 26872 KB Output is correct
24 Correct 187 ms 26192 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15188 KB Output is correct
2 Correct 7 ms 15212 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 7 ms 15196 KB Output is correct
6 Correct 7 ms 15232 KB Output is correct
7 Correct 7 ms 15196 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 7 ms 15152 KB Output is correct
10 Correct 7 ms 15188 KB Output is correct
11 Correct 7 ms 15188 KB Output is correct
12 Correct 7 ms 15188 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 7 ms 15192 KB Output is correct
15 Correct 7 ms 15188 KB Output is correct
16 Correct 7 ms 15188 KB Output is correct
17 Correct 7 ms 15188 KB Output is correct
18 Correct 7 ms 15188 KB Output is correct
19 Correct 7 ms 15188 KB Output is correct
20 Correct 7 ms 15144 KB Output is correct
21 Correct 7 ms 15192 KB Output is correct
22 Correct 8 ms 15192 KB Output is correct
23 Correct 7 ms 15188 KB Output is correct
24 Correct 7 ms 15188 KB Output is correct
25 Correct 91 ms 21072 KB Output is correct
26 Correct 20 ms 15976 KB Output is correct
27 Correct 139 ms 23084 KB Output is correct
28 Correct 136 ms 22988 KB Output is correct
29 Correct 93 ms 21224 KB Output is correct
30 Correct 93 ms 20660 KB Output is correct
31 Correct 100 ms 22360 KB Output is correct
32 Correct 136 ms 23020 KB Output is correct
33 Correct 120 ms 22832 KB Output is correct
34 Correct 71 ms 19280 KB Output is correct
35 Correct 135 ms 23236 KB Output is correct
36 Correct 139 ms 22992 KB Output is correct
37 Correct 79 ms 19396 KB Output is correct
38 Correct 137 ms 22040 KB Output is correct
39 Correct 26 ms 16340 KB Output is correct
40 Correct 130 ms 22056 KB Output is correct
41 Correct 99 ms 20564 KB Output is correct
42 Correct 131 ms 21948 KB Output is correct
43 Correct 52 ms 17872 KB Output is correct
44 Correct 130 ms 21960 KB Output is correct
45 Correct 29 ms 16612 KB Output is correct
46 Correct 130 ms 22096 KB Output is correct
47 Correct 40 ms 17228 KB Output is correct
48 Correct 134 ms 22160 KB Output is correct
49 Correct 291 ms 25788 KB Output is correct
50 Correct 340 ms 27892 KB Output is correct
51 Correct 216 ms 24768 KB Output is correct
52 Correct 344 ms 27784 KB Output is correct
53 Correct 137 ms 21860 KB Output is correct
54 Correct 324 ms 27772 KB Output is correct
55 Correct 286 ms 26436 KB Output is correct
56 Correct 326 ms 27732 KB Output is correct
57 Correct 47 ms 17484 KB Output is correct
58 Correct 325 ms 27784 KB Output is correct
59 Correct 191 ms 23888 KB Output is correct
60 Correct 326 ms 27768 KB Output is correct
61 Correct 225 ms 27240 KB Output is correct
62 Correct 210 ms 26828 KB Output is correct
63 Correct 206 ms 25992 KB Output is correct
64 Correct 187 ms 26396 KB Output is correct
65 Correct 240 ms 27400 KB Output is correct
66 Correct 214 ms 26468 KB Output is correct
67 Correct 221 ms 26600 KB Output is correct
68 Correct 224 ms 26816 KB Output is correct
69 Correct 196 ms 27260 KB Output is correct
70 Correct 215 ms 26848 KB Output is correct
71 Correct 212 ms 26872 KB Output is correct
72 Correct 187 ms 26192 KB Output is correct
73 Correct 501 ms 34124 KB Output is correct
74 Correct 359 ms 28720 KB Output is correct
75 Correct 475 ms 33588 KB Output is correct
76 Correct 602 ms 37132 KB Output is correct
77 Correct 312 ms 28516 KB Output is correct
78 Correct 502 ms 34416 KB Output is correct
79 Correct 556 ms 35428 KB Output is correct
80 Correct 613 ms 37068 KB Output is correct
81 Correct 229 ms 26164 KB Output is correct
82 Correct 482 ms 33012 KB Output is correct
83 Correct 442 ms 32448 KB Output is correct
84 Correct 597 ms 36880 KB Output is correct
85 Correct 376 ms 31184 KB Output is correct
86 Correct 462 ms 34068 KB Output is correct
87 Correct 244 ms 27320 KB Output is correct
88 Correct 424 ms 34512 KB Output is correct
89 Correct 420 ms 32408 KB Output is correct
90 Correct 460 ms 34372 KB Output is correct
91 Correct 301 ms 29160 KB Output is correct
92 Correct 477 ms 34028 KB Output is correct
93 Correct 238 ms 28192 KB Output is correct
94 Correct 455 ms 33768 KB Output is correct
95 Correct 282 ms 28252 KB Output is correct
96 Correct 441 ms 33644 KB Output is correct