瞎整了一个三分线段树，样例过了，10pts，不知道啥原因

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100005;
#define isdig(x) ((x) >= '0' && (x) <= '9')

ll read() {
	ll x = 0;
	int f = 1;
	char ch = getchar();
	while (!isdig(ch)) {
		if (ch == '-') {
			f = -1;
		}
		ch = getchar();
	}
	while (isdig(ch)) {
		x = (x << 3) + (x << 1) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}

ll n, m, a[maxn], laz[3 * maxn], sum[3 * maxn];

#define lson (id * 3 - 1)
#define mson (lson + 1)
#define rson (mson + 1)
#define lmid ((l * 2 + r) / 3)
#define rmid ((l + r * 2) / 3)

void build(ll l, ll r, ll id) {
	if (l > r) return;
	if (l == r) {
		sum[id] = a[l];
		return;
	}
	build(l, lmid, lson);
	build(lmid + 1, rmid, mson);
	build(rmid + 1, r, rson);
	sum[id] = sum[lson] + sum[mson] + sum[rson];
	return;
}

void pushup(ll l, ll r, ll id) {
	if (!laz[id]) {
		return;
	}
	sum[lson] += laz[id] * (lmid - l + 1);
	sum[mson] += laz[id] * (rmid - lmid);
	sum[rson] += laz[id] * (r - rmid);
	laz[lson] += laz[id], laz[mson] += laz[id], laz[rson] += laz[id];
	return;
}

void change(ll l, ll r, ll l1, ll r1, ll id, ll val) {
	if (l >= l1 && r <= r1) {
		sum[id] += val * (r - l + 1);
		laz[id] += val;
		return;
	}
	pushup(l, r, id);
	if (l1 <= lmid) {
		change(l, lmid, l1, r1, lson, val);
	}
	if (!(r1 <= lmid || l1 > rmid)) {
		change(lmid + 1, rmid, l1, r1, mson, val);
	}
	if (r1 > rmid) {
		change(rmid + 1, r, l1, r1, rson, val);
	}
	sum[id] = sum[lson] + sum[mson] + sum[rson];
	return;
}

ll query(ll l, ll r, ll l1, ll r1, ll id) {
	ll ans = 0;
	if (l >= l1 && r <= r1) {
		return sum[id];
	}
	pushup(l, r, id);
	if (l1 <= lmid) {
		ans += query(l, lmid, l1, r1, lson);
	}
	if (!(r1 <= lmid || l1 > rmid)) {
		ans += query(lmid + 1, rmid, l1, r1, mson);
	}
	if (r1 > rmid) {
		ans += query(rmid + 1, r, l1, r1, rson);
	}
	return ans;
}

int main() {
	n = read(), m = read();
	for (ll i = 1; i <= n; i++) {
		a[i] = read();
	}
	build(1, n, 1);
	ll opt, a, b, c;
	while (m--) {
		opt = read(), a = read(), b = read();
		if (opt == 1) {
			c = read();
			change(1, n, a, b, 1, c);
		}
		else {
			cout << query(1, n, a, b, 1) << endl;
		}
	}
	return 0;
}