oj.uz

Submission #798475

# Submission time Handle Problem Language Result Execution time Memory
798475 2023-07-30T18:17:20 Z PurpleCrayon Two Antennas (JOI19_antennas) C++17
13 / 100
 3000 ms 15824 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];

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});
    }

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

        if (L <= R)
            upd(L, R, h[i]);

        for (auto [r, id] : ql[i]) {
            ans[id] = max(ans[id], qry(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 3 ms 6740 KB Output is correct
2 Correct 5 ms 6828 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 4 ms 6740 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 3 ms 6824 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6696 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 4 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6828 KB Output is correct
16 Correct 3 ms 6828 KB Output is correct
17 Correct 3 ms 6740 KB Output is correct
18 Correct 3 ms 6828 KB Output is correct
19 Correct 3 ms 6740 KB Output is correct
20 Correct 3 ms 6740 KB Output is correct
21 Correct 3 ms 6740 KB Output is correct
22 Correct 3 ms 6740 KB Output is correct
23 Correct 3 ms 6740 KB Output is correct
24 Correct 3 ms 6828 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 5 ms 6828 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 4 ms 6740 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 3 ms 6824 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6696 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 4 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6828 KB Output is correct
16 Correct 3 ms 6828 KB Output is correct
17 Correct 3 ms 6740 KB Output is correct
18 Correct 3 ms 6828 KB Output is correct
19 Correct 3 ms 6740 KB Output is correct
20 Correct 3 ms 6740 KB Output is correct
21 Correct 3 ms 6740 KB Output is correct
22 Correct 3 ms 6740 KB Output is correct
23 Correct 3 ms 6740 KB Output is correct
24 Correct 3 ms 6828 KB Output is correct
25 Correct 95 ms 13152 KB Output is correct
26 Correct 21 ms 7600 KB Output is correct
27 Correct 241 ms 15544 KB Output is correct
28 Correct 231 ms 15508 KB Output is correct
29 Correct 96 ms 13236 KB Output is correct
30 Correct 162 ms 12748 KB Output is correct
31 Correct 67 ms 14656 KB Output is correct
32 Correct 235 ms 15496 KB Output is correct
33 Correct 149 ms 15268 KB Output is correct
34 Correct 111 ms 10996 KB Output is correct
35 Correct 190 ms 15824 KB Output is correct
36 Correct 231 ms 15512 KB Output is correct
37 Correct 128 ms 11264 KB Output is correct
38 Correct 226 ms 14496 KB Output is correct
39 Correct 54 ms 7972 KB Output is correct
40 Correct 238 ms 14516 KB Output is correct
41 Correct 173 ms 12744 KB Output is correct
42 Correct 234 ms 14492 KB Output is correct
43 Correct 78 ms 9500 KB Output is correct
44 Correct 229 ms 14412 KB Output is correct
45 Correct 41 ms 8240 KB Output is correct
46 Correct 222 ms 14444 KB Output is correct
47 Correct 59 ms 8780 KB Output is correct
48 Correct 226 ms 14540 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3068 ms 15820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6740 KB Output is correct
2 Correct 5 ms 6828 KB Output is correct
3 Correct 3 ms 6740 KB Output is correct
4 Correct 3 ms 6740 KB Output is correct
5 Correct 4 ms 6740 KB Output is correct
6 Correct 3 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 3 ms 6824 KB Output is correct
9 Correct 3 ms 6740 KB Output is correct
10 Correct 3 ms 6740 KB Output is correct
11 Correct 3 ms 6696 KB Output is correct
12 Correct 3 ms 6740 KB Output is correct
13 Correct 4 ms 6740 KB Output is correct
14 Correct 3 ms 6740 KB Output is correct
15 Correct 3 ms 6828 KB Output is correct
16 Correct 3 ms 6828 KB Output is correct
17 Correct 3 ms 6740 KB Output is correct
18 Correct 3 ms 6828 KB Output is correct
19 Correct 3 ms 6740 KB Output is correct
20 Correct 3 ms 6740 KB Output is correct
21 Correct 3 ms 6740 KB Output is correct
22 Correct 3 ms 6740 KB Output is correct
23 Correct 3 ms 6740 KB Output is correct
24 Correct 3 ms 6828 KB Output is correct
25 Correct 95 ms 13152 KB Output is correct
26 Correct 21 ms 7600 KB Output is correct
27 Correct 241 ms 15544 KB Output is correct
28 Correct 231 ms 15508 KB Output is correct
29 Correct 96 ms 13236 KB Output is correct
30 Correct 162 ms 12748 KB Output is correct
31 Correct 67 ms 14656 KB Output is correct
32 Correct 235 ms 15496 KB Output is correct
33 Correct 149 ms 15268 KB Output is correct
34 Correct 111 ms 10996 KB Output is correct
35 Correct 190 ms 15824 KB Output is correct
36 Correct 231 ms 15512 KB Output is correct
37 Correct 128 ms 11264 KB Output is correct
38 Correct 226 ms 14496 KB Output is correct
39 Correct 54 ms 7972 KB Output is correct
40 Correct 238 ms 14516 KB Output is correct
41 Correct 173 ms 12744 KB Output is correct
42 Correct 234 ms 14492 KB Output is correct
43 Correct 78 ms 9500 KB Output is correct
44 Correct 229 ms 14412 KB Output is correct
45 Correct 41 ms 8240 KB Output is correct
46 Correct 222 ms 14444 KB Output is correct
47 Correct 59 ms 8780 KB Output is correct
48 Correct 226 ms 14540 KB Output is correct
49 Execution timed out 3068 ms 15820 KB Time limit exceeded
50 Halted 0 ms 0 KB -