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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
#include <bits/stdc++.h>
#include <sys/time.h>

using namespace std;

using ll = int64_t;

double get_time() {timeval tv; gettimeofday(&tv, NULL); return tv.tv_sec + tv.tv_usec * 1e-6;}
double start_time = get_time();
double elapsed() {return get_time() - start_time;}

template<typename T> struct FT {
	vector<T> s;
	FT(int n) : s(n) {}
	void update(int pos, T dif) { // a[pos] += dif
		for (; pos < (int)s.size(); pos |= pos + 1) s[pos] += dif;
	}
	T query(int pos) { // sum of values in [0, pos)
		T res = 0;
		for (; pos > 0; pos &= pos - 1) res += s[pos-1];
		return res;
	}
};


const int MAXN = int(1e6);

template<int B> void solve(vector<int> X, vector<tuple<int, int, int> > queries, bool pr = true){
	auto t_start = get_time();
	// recompute every B queries
	int N = (int)X.size();
	int Q = (int)queries.size();

	vector<int> X_ord(N);
	for(int i = 0; i < N; i++){
		X_ord[i] = i;
	}
	sort(X_ord.begin(), X_ord.end(), [&](int x, int y){
		return X[x] < X[y];
	});


	vector<ll> tot_wgt(N);

	int prv = 0;
	vector<ll> answers(Q);
	vector<int> X_mapped(N);
	while(true){
		int nxt = prv + B;
		nxt = min(nxt, Q);

		vector<vector<int> > qwhere(N+1);

		vector<vector<pair<int,ll> > > qwhere_wgt(N+1);

		// only query fenwick tree at b
		vector<int> ord;
		for(int idx = prv; idx < nxt; idx++){
			auto [type, day, b] = queries[idx];
			if(type == 2){
				ord.push_back(idx);
			}
		}
		sort(ord.begin(), ord.end(), [&](int x, int y){
			return get<2>(queries[x]) < get<2>(queries[y]);
		});
		int K = (int)ord.size();
		vector<int> amts(K);
		vector<int> mapped(nxt-prv, -1);
		for(int i = 0; i < (int)ord.size(); i++){
			amts[i] = get<2>(queries[ord[i]]);
			mapped[ord[i]-prv] = i;
		}

		{
			int i = 0;
			for(int j = 0; j < K; j++){
				while(i < N && X[X_ord[i]] < amts[j]){
					X_mapped[X_ord[i]] = j;
					i++;
				}
			}
			while(i < N){
				X_mapped[X_ord[i]] = K;
				i++;
			}
		}

		vector<int> updates;
		for(int idx = prv; idx < nxt; idx++){
			auto [type, day, b] = queries[idx];
			if(type == 1){
				updates.push_back(idx);
			} else if(type == 2){
				qwhere[day].push_back(idx);
				ll at_wgt = 0;
				for(int u_idx : updates){
					auto [u_type, u_day, u_wgt] = queries[u_idx];
					if(day <= u_day){
						at_wgt += u_wgt;						
					} else {
						qwhere_wgt[u_day].push_back({idx, u_wgt});
					}
				}
				if(at_wgt){
					qwhere_wgt[day].push_back({idx, at_wgt});
				}
			}
		}
		{
			FT<ll> ft_sum(K+1);
			for(int day = 0; day <= N; day++){
				for(auto idx : qwhere[day]){
					answers[idx] += ft_sum.query(mapped[idx-prv] + 1);
				}
				if(day < N){
					ft_sum.update(X_mapped[day], tot_wgt[day]);
				}
			}
		}
		{
			FT<int> ft_cnt(K+1);
			for(int day = 0; day <= N; day++){
				for(auto [idx, u_wgt] : qwhere_wgt[day]){
					answers[idx] += ft_cnt.query(mapped[idx-prv] + 1) * u_wgt;
				}
				if(day < N){
					ft_cnt.update(X_mapped[day], 1);
				}
			}
		}
		for(int idx = prv; idx < nxt; idx++){
			auto [type, day, b] = queries[idx];
			if(type == 2){
				if(pr) cout << answers[idx] << '\n';
			}
		}

		vector<ll> add_wgt(N+1);
		for(int u_idx : updates){
			auto [u_type, u_day, u_wgt] = queries[u_idx];
			add_wgt[u_day] += u_wgt;
		}
		ll cur = 0;
		for(int i = N; i >= 0; i--){
			if(i < N) tot_wgt[i] += cur;
			cur += add_wgt[i];
		}

		if(nxt == Q) break;
		prv = nxt;
	}
	auto t_end = get_time();
	// cerr << B << ": " << "time: " << (t_end - t_start) << '\n';
}

// void naive(vector<int> X, vector<tuple<int, int, int> > queries){
// 	// recompute every B queries
// 	int N = (int)X.size();
// 	int Q = (int)queries.size();
// 	vector<ll> answers(Q);
// 	vector<ll> day_weight(N);
// 	for(int idx = 0; idx < Q; idx++){
// 		auto [type, day, b] = queries[idx];
// 		if(type == 1){
// 			for(int i = 0; i < day; i++) day_weight[i] += b;
// 		} else {
// 			ll ans = 0;
// 			for(int i = 0; i < day; i++){
// 				if(X[i] < b) ans += day_weight[i];
// 			}
// 			answers[idx] = ans;
// 		}
// 	}
// 	for(int idx = 0; idx < Q; idx++){
// 		auto [type, day, b] = queries[idx];
// 		if(type == 2){
// 			cout << answers[idx] << '\n';
// 		}
// 	}
// }

int main(){
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int N, M, Z;
	cin >> N >> M >> Z;
	vector<int> X(N);
	for(int i = 0; i < N; i++){
		cin >> X[i];
		X[i] = MAXN - X[i];
	}
	int Q = M + Z;
	vector<tuple<int,int,int> > queries(Q);
	for(int q = 0; q < Q; q++){
		int a, b, c;
		cin >> a >> b >> c;
		if(a == 2) c = MAXN - c + 1;
		queries[q] = {a, b, c};
	}
	int WANT_B = sqrt((double)(N) * (double)max(M, Z) / (double)max(1, min(M, Z)));
	// cerr << N << ' ' << M << ' ' << Z << ' ' << WANT_B << '\n';
	if(WANT_B <= 128){
		solve<128>(X, queries, true);
	} else if(WANT_B <= 256){
		solve<256>(X, queries, true);
	} else if(WANT_B <= 512){
		solve<512>(X, queries, true);
	} else if(WANT_B <= 1024){
		solve<1024>(X, queries, true);
	} else if(WANT_B <= 2048){
		solve<2048>(X, queries, true);
	} else if(WANT_B <= 4096){
		solve<4096>(X, queries, true);
	} else if(WANT_B <= 8192){
		solve<8192>(X, queries, true);
	} else {
		solve<16384>(X, queries, true);
	}
}