编译结果 \

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n, m, c, a[N], b[N], tr[N];
struct Query {
    int op, l, r, x, y, v;
}q[N];
int find(int x) {
    int l = 1, r = n;
    while (l < r) {
        int mid = l + r >> 1;
        if (mid >= x) r = mid;
        else l = mid + 1;
    }
    return l;
}
void add(int x, int c) {
    for (int i = x; i <= n; i += i & -i) tr[i] += c;
}
int sum(int x) {
    int res = 0;
    for (int i = x; i; i -= i & -i) res += tr[i];
    return res;
}
int main() {
    cin >> n >> m >> c;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        add(i, a[i]);
    }
    for (int i = 1; i <= m; i++) {
        cin >> q[i].op;
        if (q[i].op == 1) cin >> q[i].l >> q[i].r >> q[i].x >> q[i].y;
        else if (q[i].op == 2) cin >> q[i].l >> q[i].r >> q[i].x >> q[i].v;
        else cin >> q[i].l >> q[i].r;
    }
    for (int i = 1; i <= m; i++) {
        if (q[i].op == 1) {
            int l = find(q[i].l), r = find(q[i].r);
            for (int j = l; j <= r; j++) {
                if (b[j] == q[i].x) add(j, -a[j]);
                a[j] = 0;
                b[j] = q[i].y;
            }
        } else if (q[i].op == 2) {
            int l = find(q[i].l), r =find(q[i].r);
            for (int j = l; j <= r; j++) {
                if (b[j] == q[i].x) add(j, -a[j]);
                a[j] += (j - q[i].l + 1) * q[i].v;
            }
            for (int j = l; j <= r; j++) {
                add(j, a[j]);
                a[j] += (j - q[i].l + 1) * q[i].v;
                add(j, -a[j]);
            }
        } else {
            int l = find(q[i].l), r = find(q[i].r);
            cout << sum(r) - sum(l - 1) << endl;
        }
    }
    return 0;
}