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
#include <bits/stdc++.h>
using namespace std;

struct Tree {
	vector<long long> a;
	Tree(int n) {
		a.resize(n);
	}
	long long sum(int i) {
		long long sum = 0;
		while (i >= 0) {
			sum += a[i];
			i = (i & (i + 1)) - 1;
		}
		return sum;
	}
	void increase(int i, long long x) {
		while (i < (int) a.size()) {
			a[i] += x;
			i = i | (i + 1);
		}
    }
};

int n;
vector<int> types;
struct Query {
	int type, p, value, i;
	void read() {
		scanf("%d%d%d", &type, &p, &value);
		p--; // [0,n-1]
		if (isQuery()) {
			static int nxt = 0;
			i = nxt++;
		}
	}
	bool isMod() const {
		return type == 1;
	}
	bool isQuery() const {
		return type == 2;
	}
};

vector<int> a;
vector<long long> answer;
vector<long long> seenPoints;
vector<pair<int,int>> daysSorted;

void sweepLine(const vector<long long>& pointValue, const vector<Query>& queries) {
	struct Event {
		int dist; // 10^6
		int type; // -1 or query id
		int day; // [0,n-1]
		long long value;
		bool operator <(const Event& he) const {
			return make_pair(dist, -type) > make_pair(he.dist, -he.type);
		}
	};
	vector<Event> events1(n);
	int nxt = n-1;
	for (auto [aDay, day] : daysSorted) {
		events1[nxt--] = Event{aDay, -1, day, pointValue[day]};
	}
	vector<Event> events2;
	for (const Query& query : queries) {
		if (query.isQuery()) {
			events2.push_back(Event{query.value, query.i, query.p, -1LL});
		}
	}
	sort(events2.begin(), events2.end());
	
	vector<Event> events(events1.size() + events2.size());
	merge(events1.begin(), events1.end(), events2.begin(), events2.end(), events.begin()); // two pointers
	Tree tree(n);
	for (const Event& event : events) {
		if (event.type == -1) { // point
			tree.increase(event.day, event.value);
		}
		else {
			answer[event.type] += tree.sum(event.day);
		}
	}
}

vector<vector<int>> grid;
void divide_conquer(const vector<Query>& queries) {
	int m = 0, z = 0;
	for (const Query& q : queries) {
		q.isMod() ? m++ : z++;
	}
	// D&C split is O(M + (N + Z) * log)
	// quadratic stop is O(N + (M + Z) * log + M * Z) with O(M*Z) memory
	if ((long long) m * z < min(100'000'000LL, 10LL * (m + 5 * n + 10 * z))) {
		// compress N points to M*Z grid, then run 2D prefix sums
		vector<int> xs{-1, 1'000'001}; // <= 10^6
		vector<int> ys{-1, n + 1}; // < n
		for (const Query& q : queries) {
			if (q.isMod()) {
				ys.push_back(q.p);
			}
			else {
				xs.push_back(q.value);
			}
		}
		sort(xs.begin(), xs.end());
		sort(ys.begin(), ys.end());
		xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
		ys.resize(unique(ys.begin(), ys.end()) - ys.begin());
		const int X = (int) xs.size();
		const int Y = (int) ys.size();
		grid = vector<vector<int>>(X, vector<int>(Y));
		int _y = 0;
		int _x = 0;
		vector<int> hisX(n);
		for (auto [aDay, day] : daysSorted) {
			while (xs[_x] <= aDay) {
				++_x;
			}
			hisX[day] = _x - 1;
		}
		for (int day = 0; day < n; day++) {
			int x = hisX[day]; // upper_bound(xs.begin(), xs.end(), a[day]) - xs.begin() - 1;
			while (ys[_y] < day) ++_y;
			int y = _y;
			// int y = lower_bound(ys.begin(), ys.end(), day) - ys.begin();
			assert(0 <= x && x < X);
			assert(0 <= y && y < Y);
			++grid[x][y];
		}
		for (int x = X - 2; x >= 0; --x) {
			for (int y = 0; y < Y; y++) {
				grid[x][y] += grid[x+1][y];
			}
		}
		for (int x = 0; x < X; x++) {
			for (int y = 1; y < Y; y++) {
				grid[x][y] += grid[x][y-1];
			}
		}
		
		vector<Query> mods;
		for (Query query : queries) {
			if (query.isMod()) {
				query.i = lower_bound(ys.begin(), ys.end(), query.p) - ys.begin(); // < n
				mods.push_back(query);
				continue;
			}
			int x = lower_bound(xs.begin(), xs.end(), query.value) - xs.begin(); // <= 10^6
			for (const Query& mod : mods) {
				if (query.p <= mod.p) {
					answer[query.i] += (long long) mod.value * seenPoints[query.i];
					continue;
				}
				int y = mod.i; // < n
				answer[query.i] += (long long) grid[x][y] * mod.value;
			}
		}
		return;
	}
	
	auto it_mid = queries.begin() + queries.size() / 2;
	vector<Query> left(queries.begin(), it_mid);
	vector<Query> right(it_mid, queries.end());
	if (left.empty() || right.empty()) {
		return;
	}
	vector<long long> pref(n);
	for (const Query& mod : left) {
		if (mod.isMod()) {
			pref[mod.p] += mod.value;
		}
	}
	for (int i = (int) pref.size() - 2; i >= 0; --i) {
		pref[i] += pref[i+1];
	}
	
	sweepLine(pref, right);
	divide_conquer(left);
	divide_conquer(right);
}

int main() {
	int m, z; // n, modifications, queries
	scanf("%d%d%d", &n, &m, &z);
	
	a.resize(n);
	answer.resize(z);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
	daysSorted.resize(n);
	for (int i = 0; i < n; i++){ 
		daysSorted[i] = {a[i], i};
	}
	sort(daysSorted.begin(), daysSorted.end());
	const int q = m + z;
	vector<Query> queries(q);
	for (Query& query : queries) {
		query.read();
	}
	sweepLine(vector<long long>(n, 1), queries); // precompute points in quadrants
	seenPoints = answer;
	answer = vector<long long>(z, 0);
	
	divide_conquer(queries);
	
	for (int i = 0; i < z; i++) {
		printf("%lld\n", answer[i]);
	}
}