#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+7;
template<typename T>void read(T &x){
x=0;char ch=getchar();ll f=1;
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}x*=f;
}
ll n,m,arr[N],mod,flag,cn,cm,cw;
struct node{
ll l,r,sum,mul,add;
}tree[N];
inline void build(ll i,ll l,ll r){
tree[i].l=l;
tree[i].r=r;
tree[i].mul=1;
if(l==r){
tree[i].sum=arr[l];
return;
}
ll mid=(l+r)>>1;
build(i*2,l,mid);
build(i*2+1,mid+1,r);
tree[i].sum=(tree[i*2].sum+tree[i*2+1].sum);
}
inline void push_down(ll i){
tree[i*2].sum=(ll)tree[i].mul*tree[i*2].sum+((tree[i*2].r-tree[i*2].l+1)*tree[i].add);
tree[i*2+1].sum=(ll)tree[i].mul*tree[i*2+1].sum+((tree[i*2+1].r-tree[i*2+1].l+1)*tree[i].add);
tree[i*2].mul=(ll)tree[i*2].mul*tree[i].mul;
tree[i*2+1].mul=(ll)tree[i*2+1].mul*tree[i].mul;
tree[i*2].add=(ll)tree[i*2].add*tree[i].mul+tree[i].add;
tree[i*2+1].add=(ll)tree[i*2+1].add*tree[i].mul+tree[i].add;
tree[i].mul=1;tree[i].add=0;
}
inline void add(ll i,ll l,ll r,ll k){
if(tree[i].l>=l&&tree[i].r<=r){
tree[i].add=(ll)tree[i].add+k;
tree[i].sum=(ll)tree[i].sum+k*(tree[i].r-tree[i].l+1);
return;
}
push_down(i);
if(tree[i*2].r>=l) add(i*2,l,r,k);
if(tree[i*2+1].l<=r) add(i*2+1,l,r,k);
tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
inline void mult(ll i,ll l,ll r,ll k){
if(tree[i].l>=l&&tree[i].r<=r){
tree[i].mul=tree[i].mul*k;
tree[i].add=tree[i].add*k;
tree[i].sum=tree[i].sum*k;
return;
}
push_down(i);
if(tree[i*2].r>=l) mult(i*2,l,r,k);
if(tree[i*2+1].l<=r) mult(i*2+1,l,r,k);
tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
inline ll query(ll i,ll l,ll r){
if(tree[i].l>=l&&tree[i].r<=r) return tree[i].sum;
push_down(i);
ll num=0;
if(tree[i*2].r>=l) num=num+query(i*2,l,r);
if(tree[i*2+1].l<=r) num=num+query(i*2+1,l,r);
return num;
}
int main(){
scanf("%d%d",&n,&m);
//read(n),read(m);
memset(arr,0,sizeof(arr));
build(1,1,n);
for(int i=1;i<=m;i++){
scanf("%d",&flag);
//read(flag);
if(flag==0){
scanf("%d%d",&cn,&cm);
mult(1,cn,cm,-1);
add(1,cn,cm,1);
}
else{
scanf("%d%d",&cn,&cm);
//read(cn),read(cm);
cout<<query(1,cn,cm)<<endl;
}
}
}
线段树(加乘)
最新推荐文章于 2024-09-28 22:05:59 发布