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
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1<<20;
int K;
int tab[N];
pair<int, int> que[10'007];

vector<int> drz[2 * N];
vector<int> l[2 * N], r[2 * N];
vector<ll> sum[2 * N];

ll dod[N];

int GetK(ll n, ll q1, ll q2)
{
    pair<ll, ll> ans = make_pair(I, -1);
    for(ll k = 1; k <= 10'000LL; ++k)
    {
        ll cur = (q2 * k) + (q1 / k) * n;
        ans = min(make_pair(cur, k), ans);
    }
    return ans.nd;
}

void Construct(int v)
{
    int s1 = v * 2, s2 = v * 2 + 1;
    int j = -1;
    for(int i = 0; i < (int)drz[s1].size(); ++i)
    {
        while(j < (int)drz[s2].size() - 1 && drz[s2][j + 1] >= drz[s1][i])
        {
            ++j;
            drz[v].pb(drz[s2][j]);
            l[v].pb(i - 1); r[v].pb(j);
        }
        drz[v].pb(drz[s1][i]);
        l[v].pb(i); r[v].pb(j);
    }
    for(j = j + 1; j < (int)drz[s2].size(); ++j)
    {
        drz[v].pb(drz[s2][j]);
        l[v].pb((int)drz[s1].size() - 1); r[v].pb(j);
    }
    for(int i = 0; i < (int)drz[v].size(); ++i)
        sum[v].pb(0LL);
}

int GetP(int x)
{
    int p = -1, s, k = (int)drz[1].size() - 1;
    while(p < k)
    {
        s = (p + k + 1) / 2;
        if(drz[1][s] >= x)
            p = s;
        else
            k = s - 1;
    }
    return p;
}

int QueI(int v, int p, int k, int pz, int kz, int pos)
{
    if(pos == -1) return 0;
    if(k < pz || p > kz) return 0;
    if(p >= pz && k <= kz)
        return pos + 1;
    int a;
    a = QueI(v * 2, p, (p + k) / 2, pz, kz, l[v][pos]);
    a += QueI(v * 2 + 1, (p + k) / 2 + 1, k, pz, kz, r[v][pos]);
    return a;
}

ll QueS(int v, int p, int k, int pz, int kz, int pos)
{
    if(pos == -1) return 0;
    if(k < pz || p > kz) return 0;
    if(p >= pz && k <= kz)
        return sum[v][pos];
    ll a;
    a = QueS(v * 2, p, (p + k) / 2, pz, kz, l[v][pos]);
    a += QueS(v * 2 + 1, (p + k) / 2 + 1, k, pz, kz, r[v][pos]);
    return a;
}

void CalcS(int v)
{
    for(int i = 0; i < (int)sum[v].size(); ++i)
    {
        sum[v][i] = 0LL;
        if(l[v][i] >= 0)
            sum[v][i] += sum[v * 2][l[v][i]];
        if(r[v][i] >= 0)
            sum[v][i] += sum[v * 2 + 1][r[v][i]];
    }
}

ll DoAns(int n, int m, int da, int tr)
{
    int pos = GetP(tr);
    ll ans = 0LL;
    ans = QueS(1, 0, N - 1, 0, da, pos);
    for(int i = 1; i <= m; ++i)
    {
        int x = min(da, que[i].st);
        ll s = QueI(1, 0, N - 1, 0, x, pos);
        ans += s * (ll)que[i].nd;
    }
    return ans;
}

void Solve()
{
    int n, q1, q2, m = 0;
    cin >> n >> q1 >> q2;
    for(int i = 1; i <= n; ++i)
    {
        cin >> tab[i];
        sum[i + N].pb(0LL);
        drz[i + N].pb(tab[i]);
    }
    for(int i = N - 1; i >= 1; --i)
        Construct(i);
    K = GetK(n, q1, q2);
    K = max(3, K);
    int r, a, b;
    for(int i = 1; i <= q1 + q2; ++i)
    {
        cin >> r >> a >> b;
        if(r == 2)
        {
            cout << DoAns(n, m, a, b) << "\n";
            continue;
        }
        ++m;
        que[m] = make_pair(a, b);
        dod[a] += (ll)b;
        if(m >= K)
        {
            for(int i = n; i >= 1; --i)
            {
                dod[i] += dod[i + 1];
                sum[i + N][0] += dod[i];
                dod[i + 1] = 0LL;
            }
            dod[1] = 0LL;
            for(int i = N - 1; i >= 1; --i)
                CalcS(i);
            m = 0;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}