#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100010;
int n, p, m;
int w[N];
struct Node
{
int l, r;
int sum, add, mul;//总和 加法,,乘法懒标记
}tr[N * 4];
void pushup(int u)
{
tr[u].sum = (tr[u << 1].sum + tr[u << 1 | 1].sum) % p;
}
void eval(Node &t, int add, int mul)
{ //此节点的SUM 先乘 后 加
t.sum = ((LL)t.sum * mul + (LL)(t.r - t.l + 1) * add) % p;
//此节点的 乘法懒标记
t.mul = (LL)t.mul * mul % p;
//此节点的 加法懒标记
t.add = ((LL)t.add * mul + add) % p;
}
void pushdown(int u)
{
eval(tr[u << 1], tr[u].add, tr[u].mul);
eval(tr[u << 1 | 1], tr[u].add, tr[u].mul);
tr[u].add = 0, tr[u].mul = 1;//更新
}
void build(int u, int l, int r)//建树
{
if (l == r) tr[u] = {l, r, w[r], 0, 1};
else
{
tr[u] = {l, r, 0, 0, 1};
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
void modify(int u, int l, int r, int add, int mul)
{ //修改此节点是 加 或者 乘
if (tr[u].l >= l && tr[u].r <= r) eval(tr[u], add, mul);
else
{
pushdown(u); //修改
int mid = tr[u].l + tr[u].r >> 1;
if (l <= mid) modify(u << 1, l, r, add, mul);
if (r > mid) modify(u << 1 | 1, l, r, add, mul);
pushup(u);
}
}
int query(int u, int l, int r)
{
if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
int sum = 0;
if (l <= mid) sum = query(u << 1, l, r);
if (r > mid) sum = (sum + query(u << 1 | 1, l, r)) % p;
return sum;
}
int main()
{
cin>>n>>p;
for (int i = 1; i <= n; i ++ ) cin>>w[i];
build(1, 1, n);
cin>>m;
while (m -- )
{
int t, l, r, d;
cin>>t>>l>>r;
if (t == 1)
{
cin>>d;//区间乘*d
modify(1, l, r, 0, d);
}
else if (t == 2)
{
cin>>d;//区间+d
modify(1, l, r, d, 1);
}
else //区间和
cout<<query(1,l,r)<<endl;
}
return 0;
}
线段树区间乘,加
最新推荐文章于 2024-05-21 19:48:43 发布