Algorithmic-Problems/sterilising.cpp at main · pi34/Algorithmic-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
// https://oj.uz/problem/view/JOI15_sterilizing

#include <iostream>

using namespace std;

typedef long long ll;

const ll N = 100005;
ll arr[N];
ll segTree[N*4];
ll mxTill[N*4];

#define mid ((l + r) >> 1)

void construct (ll l, ll r, ll pos)
{
    if (l == r) {
        segTree[pos] = mxTill[pos] = arr[l];
        return;
    }

    construct(l, mid, pos<<1);
    construct(mid+1, r, pos<<1|1);
    segTree[pos] = segTree[pos<<1] + segTree[pos<<1|1];
    mxTill[pos] = max(mxTill[pos<<1], mxTill[pos<<1|1]);
}


ll Sum (ll l, ll r, ll pos, ll q1, ll q2)
{
    if (q2 < l || q1 > r || l > r) {
        return 0;
    }
    if (q1 <= l && q2 >= r) {
        return segTree[pos];
    }

    return Sum (l, mid, pos<<1, q1, q2) + Sum (mid+1, r, pos<<1|1, q1, q2);
}

void regUp (ll l, ll r, ll pos, ll newVal, ll newPos)
{
    if (l > r || l > newPos || r < newPos) return;
    if (l == r) {
        segTree[pos] = mxTill[pos] = newVal;
        return;
    }
    regUp (l, mid, pos<<1, newVal, newPos);
    regUp (mid+1, r, pos<<1 | 1, newVal, newPos);

    segTree[pos] = segTree[pos<<1] + segTree[pos<<1|1];
    mxTill[pos] = max(mxTill[pos<<1], mxTill[pos<<1|1]);
}

void Update (ll l, ll r, ll pos, ll strength, ll q1, ll q2)
{
    if (q2 < l || q1 > r || mxTill[pos] == 0 || l > r) {
        return;
    }

    if (l == r) {
        segTree[pos] /= strength;
        mxTill[pos] /= strength;
        return;
    }

    Update(l, mid, pos<<1, strength, q1, q2);
    Update(mid+1, r, pos<<1|1, strength, q1, q2);
    segTree[pos] = segTree[pos<<1] + segTree[pos<<1|1];
    mxTill[pos] = max(mxTill[pos<<1], mxTill[pos<<1|1]);
}

int main ()
{
    ll n, q, k;
    cin >> n >> q >> k;
    for (ll i = 1; i <= n; i++) cin >> arr[i];

    construct(1, n, 1);

    for (ll i = 0; i < q; i++) {
        ll x, y, z;
        cin >> x >> y >> z;

        if (x == 1) {
            regUp(1, n, 1, z, y);
        } else if (x == 3) {
            cout << Sum(1, n, 1, y, z);
        } else {
            Update(1, n, 1, k, y, z);
        }

    }
}