P3373 【模板】线段树 2（区间加法+区间乘法+区间求和取模）

#include <bits/stdc++.h>
#define lson l,m,rt << 1
#define rson m+1,r,rt << 1|1
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
int mod = 1000;
ll sum[maxn << 2];
ll add[maxn << 2];
ll mul[maxn << 2];
struct Node {
    ll l,r;
    ll mid() {
        return (l + r) >> 1;
    }
} tree[maxn << 2];
void PushUp(ll rt) {
    sum[rt] = (sum[rt << 1] + sum[rt << 1|1]) % mod;
}

void PushDown(ll rt,ll len) {
    sum[rt << 1]=(sum[rt << 1]*mul[rt]+add[rt]*(len - len/2)) % mod;
    sum[rt << 1|1]=(sum[rt << 1|1]*mul[rt]+add[rt]*(len/2)) % mod;
    mul[rt << 1]=(mul[rt << 1]*mul[rt]) % mod;
    mul[rt << 1|1]=(mul[rt << 1|1]*mul[rt]) % mod;
    add[rt << 1]=(add[rt << 1]*mul[rt]+add[rt]) % mod;
    add[rt << 1|1]=(add[rt << 1|1]*mul[rt