1735.cpp

#include <bits/stdc++.h>

using namespace std;

#define print_op(...) ostream& operator<<(ostream& out, const __VA_ARGS__& u)
template<typename A, typename B> print_op(pair<A, B>) { return out << "(" << u.first << ", " << u.second << ")"; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> print_op(T_container) { out << "{"; string sep; for (const T &x : u) out << sep << x, sep = ", "; return out << "}"; }
template<typename T> void dbg_out(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void dbg_out(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; dbg_out(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}
#ifdef LOCAL
#define dbg(...) dbg_out(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif

#define ar array
#define ll long long
#define ld long double
#define sz(x) ((int)x.size())
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++) 
#define all(a) (a).begin(), (a).end()

const int MAX_N = 1e5 + 5;
const int MAX_L = 20;
const int MAX_C = 26;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

struct Node {
    ll sum, addval, setval;
    Node(): sum(0), addval(0), setval(LLONG_MAX) {}
    Node(ll x): sum(x), addval(0), setval(LLONG_MAX) {}
    Node(const Node &l, const Node &r) {
        sum = l.sum + r.sum;
        addval = 0;
        setval = LLONG_MAX;
    }
};
 
struct SegmentTree { 
    int ln(int node) { return 2 * node; }
    int rn(int node) { return 2 * node + 1; }
 
    int n; vector<Node> st;
 
    void init(int _n) { n = _n; st.resize(4 * _n); }
    void init(const vector<int> &a) { init(sz(a)); build(a, 1, 0, n - 1); }
 
    void apply_add(int node, int start, int end, ll x) {
        if (x == 0) return;
        st[node].sum += x * (end - start + 1);
        st[node].addval += x;
    }
    void apply_set(int node, int start, int end, ll x) {
        if (x == LLONG_MAX) return;
        st[node].sum = x * (end - start + 1);
        st[node].setval = x;
        st[node].addval = 0;
    }
 
    void push_down(int node, int start, int end) {
        if (start == end) return;
        int mid = (start + end) / 2;
        apply_set(ln(node), start, mid, st[node].setval);
        apply_set(rn(node), mid + 1, end, st[node].setval);
        apply_add(ln(node), start, mid, st[node].addval);
        apply_add(rn(node), mid + 1, end, st[node].addval);
        st[node].addval = 0;
        st[node].setval = LLONG_MAX;
    }
 
    void build(const vector<int> &a, int node, int start, int end) {
        if (start == end) {
            st[node] = Node(a[start]);
            return;
        }
        int mid = (start + end) / 2;
        build(a, ln(node), start, mid);
        build(a, rn(node), mid + 1, end);
        st[node] = Node(st[ln(node)], st[rn(node)]);
    }
 
    void update_add(int node, int start, int end, int l, int r, ll x) {
        push_down(node, start, end);
        if (r < start || end < l) return;
        if (l <= start && end <= r) {
            apply_add(node, start, end, x);
            return;
        }
        int mid = (start + end) / 2;
        update_add(ln(node), start, mid, l, r, x);
        update_add(rn(node), mid + 1, end, l, r, x);
        st[node] = Node(st[ln(node)], st[rn(node)]);
    }
    void update_set(int node, int start, int end, int l, int r, ll x) {
        push_down(node, start, end);
        if (r < start || end < l) return;
        if (l <= start && end <= r) {
            apply_set(node, start, end, x);
            return;
        }
        int mid = (start + end) / 2;
        update_set(ln(node), start, mid, l, r, x);
        update_set(rn(node), mid + 1, end, l, r, x);
        st[node] = Node(st[ln(node)], st[rn(node)]);
    }
 
    Node query(int node, int start, int end, int l, int r) {
        push_down(node, start, end);
        if (r < start || end < l) return Node();
        if (l <= start && end <= r) return st[node];
        int mid = (start + end) / 2;
        return Node(query(ln(node), start, mid, l, r), query(rn(node), mid + 1, end, l, r));
    }
    
    void update_add(int l, int r, ll x) {update_add(1, 0, n - 1, l, r, x);}
    void update_set(int l, int r, ll x) {update_set(1, 0, n - 1, l, r, x);}
    Node query(int l, int r) {return query(1, 0, n - 1, l, r);}
};
 
void solve(int tc = 0) {
    int n, q; cin >> n >> q;
    vector<int> a(n);
    for (int &x : a) cin >> x;
    SegmentTree st; st.init(a);
    while (q--) {
        int t, l, r; cin >> t >> l >> r; l--; r--;
        if (t == 1) {
            int x; cin >> x;
            st.update_add(l, r, x);
        } else if (t == 2) {
            int x; cin >> x;
            st.update_set(l, r, x);
        } else{
            cout << st.query(l, r).sum << "\n";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve(t);
    }
}