标签：ll HDOJ.4578 val int 线段 seg && Transformation rson

• 题意 : 四种操作,1. 区间加,2. 区间乘,3. 区间更新为固定值,
  4.求区间\(p\)次方和,\(p\)取值\(1~3\)
• 思路 : 待续

#include<bits/stdc++.h>
#define ll long long 
#define FOR(i,l,r) for(int i = l ; i <= r ;++i ) 
#define inf 0x3f3f3f3f
#define EPS (1e-9)
#define ALL(T)  T.begin(),T.end()
#define lson(i)     i<<1
#define rson(i)     (i<<1|1)
#define sum(i,j)    seg[i].sum[j]
using namespace std; 
const int modp = 10007;
const int maxn = 1e6+50;

ll a[maxn];
ll ans = 0;
struct node{
    int l,r;
    ll val,add,mul;
    ll sum[3];
}seg[maxn*4];

inline void madd(ll &a,ll b){
    a = (a+b)%modp;
} 
inline void mmul(ll &a,ll b){
    a = (a*b)%modp;
}


inline void push_up(int p){
    sum(p,0) = (sum(lson(p),0) + sum(rson(p),0))%modp;
    sum(p,1) = (sum(lson(p),1) + sum(rson(p),1))%modp;
    sum(p,2) = (sum(lson(p),2) + sum(rson(p),2))%modp;
}

inline void push_down(int p){
    if(seg[p].val){
        seg[lson(p)].val = seg[p].val;
        seg[lson(p)].add = 0;
        seg[lson(p)].mul = 1;
        
        seg[rson(p)].val = seg[p].val;
        seg[rson(p)].add = 0;
        seg[rson(p)].mul = 1;
        
        ll len = seg[p].r - seg[p].l + 1 ;
        ll lsize = len - len/2 , rsize = len/2;
        
        sum(lson(p),0) = (seg[p].val * lsize)%modp;
        sum(rson(p),0) = (seg[p].val * rsize)%modp;
    
        ll qp = (seg[p].val*seg[p].val)%modp;
        sum(lson(p),1) = (qp * lsize)%modp;
        sum(rson(p),1) = (qp * rsize)%modp;
        qp = (qp*seg[p].val)%modp;
        sum(lson(p),2) = (qp * lsize)%modp;
        sum(rson(p),2) = (qp * rsize)%modp;
        
        seg[p].val = 0;
    }
    if(seg[p].mul!=1){
        mmul(seg[lson(p)].mul,seg[p].mul);
        mmul(seg[rson(p)].mul,seg[p].mul);
    
        mmul(seg[lson(p)].add,seg[p].mul);
        mmul(seg[rson(p)].add,seg[p].mul);
        
        mmul(sum(lson(p),0),seg[p].mul);
        mmul(sum(rson(p),0),seg[p].mul);
        
        ll q = (seg[p].mul*seg[p].mul)%modp;
        mmul(sum(lson(p),1),q);
        mmul(sum(rson(p),1),q);
        
        mmul(q,seg[p].mul);
        mmul(sum(lson(p),2),q);
        mmul(sum(rson(p),2),q);
        
        seg[p].mul = 1;
    }
    if(seg[p].add){
        madd(seg[lson(p)].add,seg[p].add);
        madd(seg[rson(p)].add,seg[p].add);
        ll val = seg[p].add;
        ll len = seg[p].r - seg[p].l + 1 ;
        ll lsize = len - len/2 , rsize = len/2;
        ll q2 =(val*val)%modp,q3 = (q2*val)%modp;
        madd(sum(lson(p),2),
            (lsize*q3)%modp +   3 * val * ((sum(lson(p),1) + sum(lson(p),0)*val)%modp));
        madd(sum(rson(p),2),
            (rsize*q3)%modp +   3 * val * ((sum(rson(p),1) + sum(rson(p),0)*val)%modp));
        
        madd(sum(lson(p),1),(lsize*q2)%modp+2*(sum(lson(p),0)*val)%modp);
        madd(sum(rson(p),1),(rsize*q2)%modp+2*(sum(rson(p),0)*val)%modp);
    
        madd(sum(lson(p),0),(lsize*val));
        madd(sum(rson(p),0),(rsize*val));
        seg[p].add = 0;
    }
}

void build(int p,int l,int r){
    seg[p].l = l;
    seg[p].r = r;
    seg[p].add = 0;
    seg[p].mul = 1;
    seg[p].val = 0;
    seg[p].sum[0] = seg[p].sum[1] = seg[p].sum[2] = 0;
    if(l==r)    return;
    int mid = (l+r)>>1;
    build(lson(p),l,mid);
    build(rson(p),mid+1,r);
    push_up(p);
}

void mul(int i,int l,int r,ll val){
    if(seg[i].l >=l && seg[i].r <=r){
        mmul(seg[i].add,val);
        mmul(seg[i].mul,val);
        
        mmul(sum(i,0),val);
        mmul(sum(i,1),(val*val)%modp);
        mmul(sum(i,2),(((val*val)%modp)*val)%modp);
        return ;
    }
    push_down(i);
    int mid = (seg[i].l + seg[i].r)>>1;
    if(l<=mid)  mul(lson(i),l,r,val);
    if(r>mid)   mul(rson(i),l,r,val);
    push_up(i);
}

void add(int i,int l,int r,ll val){
    if(seg[i].l >=l && seg[i].r <=r){
        madd(seg[i].add,val);
        
        ll len = seg[i].r-seg[i].l+1;
        ll q2 = (val*val)%modp, q3 = (q2*val)%modp;
        
        madd(sum(i,2),q3*len+3*val*(sum(i,1)+sum(i,0)*val));
        madd(sum(i,1),(q2*len+2*(sum(i,0)*val)%modp)%modp);
        madd(sum(i,0),(len*val)%modp);
        return ;
    }
    push_down(i);
    int mid = (seg[i].l + seg[i].r)>>1;
    if(l<=mid)  add(lson(i),l,r,val);
    if(r>mid)   add(rson(i),l,r,val);
    push_up(i);
}

void cha(int i,int l,int r,ll val){
    if(seg[i].l >=l && seg[i].r <=r){
        ll len = seg[i].r - seg[i].l + 1 ; 
        seg[i].val = val;
        
        sum(i,0) = seg[i].val;
        mmul(sum(i,0),len);
        
        sum(i,1) = seg[i].val;
        mmul(sum(i,1),sum(i,1));
        mmul(sum(i,1),len);
        
        sum(i,2) = sum(i,1);
        mmul(sum(i,2),val);
        
        seg[i].add = 0;
        seg[i].mul = 1;
        return ;
    }
    push_down(i);
    int mid = (seg[i].l + seg[i].r)>>1;
    if(l<=mid)  cha(lson(i),l,r,val);
    if(r>mid)   cha(rson(i),l,r,val);
    push_up(i);
}

ll query(int i,int l,int r,ll val){
    ll res = 0;
    if(seg[i].l >= l &&  seg[i].r <= r){
        return sum(i,val-1);
    }   
    push_down(i);
    int mid = (seg[i].l+seg[i].r)>>1;
    if(l<=mid) madd(res,query(lson(i),l,r,val)) ;
    if(r>mid)  madd(res,query(rson(i),l,r,val));
    
    return res;
}
int n,m;
void solve(){
    build(1,1,n);
    ll op,x,y,z;
    FOR(i,1,m){
        scanf("%lld%lld%lld%lld",&op,&x,&y,&z); 
        switch(op){
            case 1: add(1,x,y,z);   break;
            case 2: mul(1,x,y,z);   break;
            case 3: cha(1,x,y,z);   break;
            case 4: printf("%lld\n",query(1,x,y,z)); 
        }
    }
    
}
int main(){
    while(cin >> n >> m){
        if(n==0 && m == 0)  break;
        solve();
    }
    return 0;
}

/*
6 9
3 2 6 10
1 1 2 6
1 2 2 1
2 6 6 7
4 1 2 3

10000 100
2 56 59 100
1 564 1254 10000
2 7 800 2
3 1 600 9999
4 5 10000 3
2 102 5645 9999
4 568 789 3
4 1 2 1
4 500 1000 1
4 500 1000 2
4 500 1000 3

附带数据^_^
*/

标签：ll,HDOJ.4578,val,int,线段,seg,&&,Transformation,rson
来源： https://www.cnblogs.com/xxrlz/p/11252195.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。