「hdu4578」Transformation【线段树好题】

最新推荐文章于 2019-11-14 14:35:13 发布

wzw1105

最新推荐文章于 2019-11-14 14:35:13 发布

阅读量184

点赞数

分类专栏：线段树文章标签： hdu4578 线段树

本文链接：https://blog.csdn.net/qq_40791842/article/details/101040114

版权

线段树专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Transformation

Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others) Total Submission(s): 11475 Accepted Submission(s): 2986

Problem Description

$Y u a n f a n g$ is puzzled with the question below:
There are $n$ integers, $a_1, a_2, …, a_n.$ The initial values of them are $0 .$ There are four kinds of operations.
Operation $1 :$ Add $c$ to each number between $a_x$ and $a_y$ inclusive. In other words, do transformation $a_k\leftarrow a_k+c, k = x,x+1,…,y.$
Operation $2 :$ Multiply $c$ to each number between $a_x$ and $a_y$ inclusive. In other words, do transformation $a_k\leftarrow a_k\times c, k = x,x+1,…,y.$
Operation $3 :$ Change the numbers between $a_x$ and $a_y$ to $c$ , inclusive. In other words, do transformation $a_k\leftarrow c, k = x,x+1,…,y.$
Operation $4 :$ Get the sum of $p$ power among the numbers between $a_x$ and $a_y$ inclusive. In other words, get the result of $a_x^p+a_{x+1}^p+…+a_y^p$ .
$Y u a n f a n g$ has no idea of how to do it. So he wants to ask you to help him.

Input

There are no more than $10$ test cases.
For each case, the first line contains two numbers $n$ and $m,$ meaning that there are $n$ integers and m operations. $\leq n, m \leq 100,000.$
Each the following $m$ lines contains an operation. Operation $1$ to $3$ is in this format: “ $1\ x\ y\ c$ ” or “ $2\ x\ y\ c$ ” or “ $3\ x\ y\ c$ ”. Operation $4$ is in this format: “ $4\ x\ y\ p$ ”. $\leq x \leq y \leq n, 1 \leq c \leq 10,000, 1 \leq p \leq 3)$
The input ends with $0\ 0$ .

Output

For each operation $4$ , output a single integer in one line representing the result. The answer may be quite large. You just need to calculate the remainder of the answer when divided by $10007 .$

Sample Input

Sample Output

307
7489

Source

2013ACM-ICPC杭州赛区全国邀请赛

题意

一个长度为 $n$ ，初始化所有元素值为 $0$ 的数组，实现以下操作

区间加一个给定值
区间乘一个给定值
区间赋值为同一个给定值
给定 $x\ y\ p$ ，查询 $a_x^p+a_{x+1}^p+…+a_y^p$ $\ \ \ \ 1\leq p\leq3$

题解

这是一道对于理解多种 $lazy\ mark$ 并存的时候的处理方式的好题
当下放一个节点的标记的时候，下放的顺序不同，影响是不同的，下放顺序不对就会错误
首先需要明确的是第三个操作一定是最先下放，因为其他两个的 $lazy\ mark$ 一定是后于第三个操作的 $lazy\ mark$ 出现，因为第三个操作的 $lazy\ mark$ 会清空掉其他两个操作的 $lazy\ mark$
然后另外两个操作怎么办呢？考虑优先下放乘的 $lazy\ mark$ ，如果儿子有加 $lazy\ mark$ ，那么这个加的 $lazy\ mark$ 要乘上下放的 $lazy\ mark$ 就好了
还有就是一个比较好的写法就是写一个函数然后去更新某一个点的信息并且加上 $m a r k$

代码

#include<bits/stdc++.h>

using namespace std;
const int maxn=1e5+10;
const long long mod=10007;

namespace segment_tree{
    int add[maxn<<2],mult[maxn<<2],same[maxn<<2];
    long long ans[4][maxn<<2];

    inline void build(int id,int L,int R) {
        add[id]=mult[id]=same[id]=0;
        for(int i=1;i<=3;i++) ans[i][id]=0;
        if(L==R) return;
        int mid=(L+R)>>1;
        build(id<<1,L,mid);build(id<<1|1,mid+1,R);
    }
    inline void mark_same(int id,int val,int L,int R) {  //用val去更新id这个节点信息并打上标记
        same[id]=val;mult[id]=add[id]=0;
        for(int i=1,j=same[id]*(R-L+1)%mod;i<=3;i++,j=j*same[id]%mod) ans[i][id]=j;
    }
    inline void mark_mult(int id,int val,int L,int R) {
        if(!mult[id]) mult[id]=val;
        else mult[id]=mult[id]*val%mod;
        add[id]=(add[id]*val)%mod;
        for(int i=1,j=val;i<=3;i++,j=j*val%mod) ans[i][id]=ans[i][id]*j%mod;
    }
    inline void mark_add(int id,int val,int L,int R) {
        add[id]=(add[id]+val)%mod;
        ans[3][id]=(ans[3][id]+3*val*ans[2][id]%mod+(3*val*val%mod)*ans[1][id]%mod+((1LL*val*val*val)%mod)*(R-L+1)%mod)%mod;
        ans[2][id]=(ans[2][id]+2*val*ans[1][id]%mod+(val*val%mod)*(R-L+1)%mod)%mod;
        ans[1][id]=(ans[1][id]+(R-L+1)*val%mod)%mod;
    }
    inline void push_down(int id,int L,int R) { /*same 操作一定是最最先出现的，因为same操作会给其他操作清空*/
        int mid=(L+R)>>1;
        if(same[id]) {
            mark_same(id<<1,same[id],L,mid);
            mark_same(id<<1|1,same[id],mid+1,R);
            same[id]=0;
        } 
        if(mult[id]) {
            mark_mult(id<<1,mult[id],L,mid);
            mark_mult(id<<1|1,mult[id],mid+1,R);
            mult[id]=0;
        }
        if(add[id]) {
            mark_add(id<<1,add[id],L,mid);
            mark_add(id<<1|1,add[id],mid+1,R);
            add[id]=0;
        }
    }
    inline void push_up(int id) {
        for(int i=1;i<=3;i++) ans[i][id]=(ans[i][id<<1]+ans[i][id<<1|1])%mod;
    }
    inline void update(int id,int L,int R,int l,int r,int x,int type) {
        if(L>=l&&R<=r) {
            if(type==1) mark_add(id,x,L,R);
            else if(type==2) mark_mult(id,x,L,R);
            else mark_same(id,x,L,R);
            return;
        }
        int mid=(L+R)>>1;push_down(id,L,R);
        if(l<=mid) update(id<<1,L,mid,l,r,x,type);
        if(r>mid) update(id<<1|1,mid+1,R,l,r,x,type);
        push_up(id);
    }
    inline int query(int id,int L,int R,int l,int r,int type) {
        int sum=0;
        if(L>=l&&R<=r) return ans[type][id];
        int mid=(L+R)>>1;push_down(id,L,R);
        if(l<=mid) sum=(sum+query(id<<1,L,mid,l,r,type))%mod;
        if(r>mid) sum=(sum+query(id<<1|1,mid+1,R,l,r,type))%mod;
        push_up(id);
        return sum;
    }
};
using namespace segment_tree;

int n,m,opt,l,r,x;
int main()
{
    while(~scanf("%d %d",&n,&m)&&(n+m)) {
        build(1,1,n);
        for(int i=1;i<=m;i++) {
            scanf("%d %d %d %d",&opt,&l,&r,&x);
            if(opt<=3) update(1,1,n,l,r,x,opt);
            else printf("%d\n",query(1,1,n,l,r,x));
        }
    }
}