RT。看了 114514min 了还看不出来哪里有错 /kk

#include <bits/stdc++.h>

using namespace std;

namespace liuzimingc {
const int N = 2.5e5 + 5, MOD = 1e9 + 7;
#define int long long
#define endl '\n'

int n, m;

inline void get_mod(int &a) {
	if (a >= MOD) a -= MOD;
}

struct matrix {
	int a[4][4];
	
	matrix() { memset(a, 0, sizeof(a)); }
	
	inline void clear() { memset(a, 0, sizeof(a)); }
	
	inline void init() { a[0][0] = a[1][1] = a[2][2] = a[3][3] = 1; }
	
	inline matrix operator +(const matrix &b) {
		matrix c;
		c.a[0][0] = a[0][0] + b.a[0][0];
		c.a[0][1] = a[0][1] + b.a[0][1];
		c.a[0][2] = a[0][2] + b.a[0][2];
		c.a[0][3] = a[0][3] + b.a[0][3];
		return c;
	}
	
	inline matrix operator *(const matrix &b) {
		matrix c;
		for (int i = 0; i < 4; i++)
			for (int j = 0; j < 4; j++) {
				c.a[i][j] += 1ll * a[i][0] * b.a[0][j] % MOD;
				get_mod(c.a[i][j]);
				c.a[i][j] += 1ll * a[i][1] * b.a[1][j] % MOD;
				get_mod(c.a[i][j]);
				c.a[i][j] += 1ll * a[i][2] * b.a[2][j] % MOD;
				get_mod(c.a[i][j]);
				c.a[i][j] += 1ll * a[i][3] * b.a[3][j] % MOD;
				get_mod(c.a[i][j]);
			}
		return c;
	}
	
	inline void print() {
		for (int i = 0; i < 4; i++)
			for (int j = 0; j < 4; j++)
				cout << a[i][j] << " \n"[j == 3];
	}
} a[N], k;
struct tree {
	int l, r;
	matrix sum, tag;
} t[N << 2];

inline void push_up(int p) {
	t[p].sum = t[p << 1].sum + t[p << 1 | 1].sum;
}

inline void push_down(int p) {
	t[p << 1].sum = t[p << 1].sum * t[p].tag;
	t[p << 1].tag = t[p << 1].tag * t[p].tag;
	t[p << 1 | 1].sum = t[p << 1 | 1].sum * t[p].tag;
	t[p << 1 | 1].tag = t[p << 1 | 1].tag * t[p].tag;
	t[p].tag.clear();
	t[p].tag.init();
}

void build(int p, int l, int r) {
	t[p].l = l, t[p].r = r;
	t[p].tag.init();
	if (l == r) {
		t[p].sum = a[l];
		return;
	}
	int mid = l + r >> 1;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	push_up(p);
}

void update(int p, int l, int r, matrix k) {
	if (l <= t[p].l && t[p].r <= r) {
		t[p].sum = t[p].sum * k;
		t[p].tag = t[p].tag * k;
		return;
	}
	push_down(p);
	int mid = t[p].l + t[p].r >> 1;
	if (l <= mid) update(p << 1, l, r, k);
	if (r > mid) update(p << 1 | 1, l, r, k);
	push_up(p);
}

matrix ask(int p, int l, int r) {
	if (l <= t[p].l && t[p].r <= r) return t[p].sum;
	push_down(p);
	int mid = t[p].l + t[p].r >> 1;
	matrix ans;
	if (l <= mid) ans = ans + ask(p << 1, l, r);
	if (r > mid) ans = ans + ask(p << 1 | 1, l, r);
	return ans;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i].a[0][0] >> a[i].a[0][1] >> a[i].a[0][2], a[i].a[0][3] = 1;
	cin >> m;
	build(1, 1, n);
	while (m--) {
		int op, l, r, v;
		cin >> op >> l >> r;
		if (op == 7) {
			matrix ans = ask(1, l, r);
			cout << ans.a[0][0] << " " << ans.a[0][1] << " " << ans.a[0][2] << endl;
		}
		else {
			k.init();
			if (op == 1) k.a[1][0] = 1;
			else if (op == 2) k.a[2][1] = 1;
			else if (op == 3) k.a[0][2] = 1;
			else {
				cin >> v;
				if (op == 4) k.a[3][0] = v;
				if (op == 5) k.a[1][1] = v;
				if (op == 6) {
					k.a[2][2] = 0;
					k.a[2][3] = v;
				}
			}
//			k.print();
			update(1, l, r, k);
		}
	}
	return 0;
}
#undef int
} // namespace liuzimingc

int main() {
	liuzimingc::main();
	return 0;
}