oj.uz

Submission #254966

# Submission time Handle Problem Language Result Execution time Memory
254966 2020-07-30T22:31:59 Z imeimi2000 Fire (JOI20_ho_t5) C++17
100 / 100
 643 ms 47176 KB 
#include <bits/stdc++.h>
#define fs first
#define se second

using namespace std;
typedef long long llong;
typedef pair<int, int> pii;

struct fenwick {
    static const int N = 200005;
    llong fen[N + N + 5];
    void init() {
        memset(fen, 0, sizeof(fen));
    }
    void update(int i, llong x) {
        i += N;
        while (i <= N + N) {
            fen[i] += x;
            i += i & -i;
        }
    }
    llong query(int i) const {
        i += N;
        llong ret = 0;
        while (i) {
            ret += fen[i];
            i -= i & -i;
        }
        return ret;
    }
} fen1, fen2;

int n, q;
int S[200001];
pii seg[1 << 19];

void init(int i, int s, int e) {
    if (s == e) {
        seg[i] = pii(S[s], s);
        return;
    }
    int m = (s + e) / 2;
    init(i + i, s, m);
    init(i + i + 1, m + 1, e);
    seg[i] = max(seg[i + i], seg[i + i + 1]);
}

pii query(int i, int s, int e, int x, int y) {
    if (e < x || y < s) return pii(0, 0);
    if (x <= s && e <= y) return seg[i];
    int m = (s + e) / 2;
    return max(query(i + i, s, m, x, y), query(i + i + 1, m + 1, e, x, y));
}

vector<pair<pii, int>> U;
void solve(int s, int e) {
    if (s > e) return;
    int m = query(1, 1, n, s, e).se;
    if (s > 1) {
        U.emplace_back(pii(m, m - s + 1), -S[m]);
        U.emplace_back(pii(e + 1, e - s + 2), S[m]);
    }
    {
        U.emplace_back(pii(m, 0), S[m]);
        U.emplace_back(pii(e + 1, e - m + 1), -S[m]);
    }
    solve(s, m - 1);
    solve(m + 1, e);
}

llong ans[200001];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) cin >> S[i];
    init(1, 1, n);
    solve(1, n);
    vector<pair<pii, int>> Q;
    for (int i = 1; i <= q; ++i) {
        int t, l, r;
        cin >> t >> l >> r;
        Q.emplace_back(pii(r, t), i);
        Q.emplace_back(pii(l - 1, t), -i);
    }
    for (int it = 0; it < 2; ++it) {
        sort(U.begin(), U.end());
        sort(Q.begin(), Q.end());
        fen1.init();
        fen2.init();
        for (int i = 0, j = 0; i < int(Q.size()); ++i) {
            while (j < int(U.size()) && U[j].fs.fs <= Q[i].fs.fs) {
                int jx = U[j].fs.se - U[j].fs.fs;
                fen1.update(jx, U[j].se);
                fen2.update(jx, U[j].se * (1ll - U[j].fs.fs));
                ++j;
            }
            int ix = Q[i].fs.se - Q[i].fs.fs - it;
            llong val = fen1.query(ix) * Q[i].fs.fs + fen2.query(ix);
            if (Q[i].se < 0) ans[-Q[i].se] -= val;
            else ans[Q[i].se] += val;
        }
        for (auto &i : U) swap(i.fs.fs, i.fs.se);
        for (auto &i : Q) swap(i.fs.fs, i.fs.se);
    }
    for (int i = 1; i <= q; ++i) printf("%lld\n", ans[i]);
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6656 KB Output is correct
2 Correct 5 ms 6656 KB Output is correct
3 Correct 5 ms 6656 KB Output is correct
4 Correct 4 ms 6656 KB Output is correct
5 Correct 5 ms 6656 KB Output is correct
6 Correct 5 ms 6656 KB Output is correct
7 Correct 5 ms 6656 KB Output is correct
8 Correct 5 ms 6656 KB Output is correct
9 Correct 5 ms 6656 KB Output is correct
10 Correct 5 ms 6656 KB Output is correct
11 Correct 4 ms 6656 KB Output is correct
12 Correct 5 ms 6656 KB Output is correct
13 Correct 5 ms 6656 KB Output is correct
14 Correct 5 ms 6656 KB Output is correct
15 Correct 5 ms 6656 KB Output is correct
16 Correct 5 ms 6656 KB Output is correct
17 Correct 6 ms 6656 KB Output is correct
18 Correct 6 ms 6656 KB Output is correct
19 Correct 6 ms 6656 KB Output is correct
20 Correct 5 ms 6656 KB Output is correct
21 Correct 5 ms 6656 KB Output is correct
22 Correct 5 ms 6656 KB Output is correct
23 Correct 4 ms 6656 KB Output is correct
24 Correct 7 ms 6656 KB Output is correct
25 Correct 5 ms 6656 KB Output is correct
26 Correct 5 ms 6656 KB Output is correct
27 Correct 5 ms 6656 KB Output is correct
28 Correct 5 ms 6656 KB Output is correct
29 Correct 5 ms 6656 KB Output is correct
30 Correct 5 ms 6656 KB Output is correct
31 Correct 6 ms 6656 KB Output is correct
32 Correct 5 ms 6656 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6656 KB Output is correct
2 Correct 521 ms 41464 KB Output is correct
3 Correct 490 ms 41492 KB Output is correct
4 Correct 515 ms 41544 KB Output is correct
5 Correct 483 ms 41692 KB Output is correct
6 Correct 504 ms 41288 KB Output is correct
7 Correct 539 ms 41756 KB Output is correct
8 Correct 518 ms 41672 KB Output is correct
9 Correct 494 ms 41964 KB Output is correct
10 Correct 589 ms 41524 KB Output is correct
11 Correct 519 ms 41928 KB Output is correct
12 Correct 498 ms 41160 KB Output is correct
13 Correct 541 ms 41416 KB Output is correct
14 Correct 499 ms 41288 KB Output is correct
15 Correct 483 ms 41420 KB Output is correct
16 Correct 478 ms 41288 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6656 KB Output is correct
2 Correct 638 ms 40844 KB Output is correct
3 Correct 512 ms 40136 KB Output is correct
4 Correct 586 ms 40904 KB Output is correct
5 Correct 544 ms 40388 KB Output is correct
6 Correct 548 ms 40392 KB Output is correct
7 Correct 583 ms 40524 KB Output is correct
8 Correct 544 ms 40648 KB Output is correct
9 Correct 577 ms 40392 KB Output is correct
10 Correct 552 ms 40168 KB Output is correct
11 Correct 530 ms 40904 KB Output is correct
12 Correct 517 ms 40520 KB Output is correct
13 Correct 561 ms 40780 KB Output is correct
14 Correct 587 ms 40544 KB Output is correct
15 Correct 547 ms 40776 KB Output is correct
16 Correct 583 ms 40448 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 46420 KB Output is correct
2 Correct 494 ms 46644 KB Output is correct
3 Correct 498 ms 47176 KB Output is correct
4 Correct 477 ms 46408 KB Output is correct
5 Correct 491 ms 46536 KB Output is correct
6 Correct 485 ms 46536 KB Output is correct
7 Correct 470 ms 46792 KB Output is correct
8 Correct 477 ms 46792 KB Output is correct
9 Correct 472 ms 46412 KB Output is correct
10 Correct 509 ms 46632 KB Output is correct
11 Correct 487 ms 46792 KB Output is correct
12 Correct 477 ms 46920 KB Output is correct
13 Correct 493 ms 46664 KB Output is correct
14 Correct 494 ms 46792 KB Output is correct

Subtask #5
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6656 KB Output is correct
2 Correct 5 ms 6656 KB Output is correct
3 Correct 5 ms 6656 KB Output is correct
4 Correct 4 ms 6656 KB Output is correct
5 Correct 5 ms 6656 KB Output is correct
6 Correct 5 ms 6656 KB Output is correct
7 Correct 5 ms 6656 KB Output is correct
8 Correct 5 ms 6656 KB Output is correct
9 Correct 5 ms 6656 KB Output is correct
10 Correct 5 ms 6656 KB Output is correct
11 Correct 4 ms 6656 KB Output is correct
12 Correct 5 ms 6656 KB Output is correct
13 Correct 5 ms 6656 KB Output is correct
14 Correct 5 ms 6656 KB Output is correct
15 Correct 5 ms 6656 KB Output is correct
16 Correct 5 ms 6656 KB Output is correct
17 Correct 6 ms 6656 KB Output is correct
18 Correct 6 ms 6656 KB Output is correct
19 Correct 6 ms 6656 KB Output is correct
20 Correct 5 ms 6656 KB Output is correct
21 Correct 5 ms 6656 KB Output is correct
22 Correct 5 ms 6656 KB Output is correct
23 Correct 4 ms 6656 KB Output is correct
24 Correct 7 ms 6656 KB Output is correct
25 Correct 5 ms 6656 KB Output is correct
26 Correct 5 ms 6656 KB Output is correct
27 Correct 5 ms 6656 KB Output is correct
28 Correct 5 ms 6656 KB Output is correct
29 Correct 5 ms 6656 KB Output is correct
30 Correct 5 ms 6656 KB Output is correct
31 Correct 6 ms 6656 KB Output is correct
32 Correct 5 ms 6656 KB Output is correct
33 Correct 600 ms 41480 KB Output is correct
34 Correct 553 ms 41928 KB Output is correct
35 Correct 606 ms 41712 KB Output is correct
36 Correct 591 ms 41544 KB Output is correct
37 Correct 563 ms 41292 KB Output is correct
38 Correct 599 ms 41544 KB Output is correct
39 Correct 643 ms 41416 KB Output is correct
40 Correct 576 ms 41544 KB Output is correct
41 Correct 568 ms 41416 KB Output is correct
42 Correct 539 ms 41544 KB Output is correct
43 Correct 580 ms 42056 KB Output is correct
44 Correct 592 ms 41676 KB Output is correct
45 Correct 608 ms 41288 KB Output is correct
46 Correct 613 ms 41664 KB Output is correct
47 Correct 532 ms 41396 KB Output is correct
48 Correct 571 ms 41164 KB Output is correct
49 Correct 626 ms 41388 KB Output is correct
50 Correct 615 ms 42056 KB Output is correct
51 Correct 596 ms 42052 KB Output is correct
52 Correct 548 ms 41544 KB Output is correct
53 Correct 524 ms 41804 KB Output is correct
54 Correct 596 ms 41032 KB Output is correct
55 Correct 566 ms 41160 KB Output is correct
56 Correct 524 ms 41392 KB Output is correct
57 Correct 590 ms 41096 KB Output is correct
58 Correct 583 ms 41672 KB Output is correct
59 Correct 521 ms 41464 KB Output is correct
60 Correct 490 ms 41492 KB Output is correct
61 Correct 515 ms 41544 KB Output is correct
62 Correct 483 ms 41692 KB Output is correct
63 Correct 504 ms 41288 KB Output is correct
64 Correct 539 ms 41756 KB Output is correct
65 Correct 518 ms 41672 KB Output is correct
66 Correct 494 ms 41964 KB Output is correct
67 Correct 589 ms 41524 KB Output is correct
68 Correct 519 ms 41928 KB Output is correct
69 Correct 498 ms 41160 KB Output is correct
70 Correct 541 ms 41416 KB Output is correct
71 Correct 499 ms 41288 KB Output is correct
72 Correct 483 ms 41420 KB Output is correct
73 Correct 478 ms 41288 KB Output is correct
74 Correct 638 ms 40844 KB Output is correct
75 Correct 512 ms 40136 KB Output is correct
76 Correct 586 ms 40904 KB Output is correct
77 Correct 544 ms 40388 KB Output is correct
78 Correct 548 ms 40392 KB Output is correct
79 Correct 583 ms 40524 KB Output is correct
80 Correct 544 ms 40648 KB Output is correct
81 Correct 577 ms 40392 KB Output is correct
82 Correct 552 ms 40168 KB Output is correct
83 Correct 530 ms 40904 KB Output is correct
84 Correct 517 ms 40520 KB Output is correct
85 Correct 561 ms 40780 KB Output is correct
86 Correct 587 ms 40544 KB Output is correct
87 Correct 547 ms 40776 KB Output is correct
88 Correct 583 ms 40448 KB Output is correct
89 Correct 486 ms 46420 KB Output is correct
90 Correct 494 ms 46644 KB Output is correct
91 Correct 498 ms 47176 KB Output is correct
92 Correct 477 ms 46408 KB Output is correct
93 Correct 491 ms 46536 KB Output is correct
94 Correct 485 ms 46536 KB Output is correct
95 Correct 470 ms 46792 KB Output is correct
96 Correct 477 ms 46792 KB Output is correct
97 Correct 472 ms 46412 KB Output is correct
98 Correct 509 ms 46632 KB Output is correct
99 Correct 487 ms 46792 KB Output is correct
100 Correct 477 ms 46920 KB Output is correct
101 Correct 493 ms 46664 KB Output is correct
102 Correct 494 ms 46792 KB Output is correct