Transformation

题目链接

http://acm.hdu.edu.cn/showproblem.php?pid=4578

Problem Description

Yuanfang is puzzled with the question below:

There are n integers, a1, a2, …, an. The initial values of them are 0. There are four kinds of operations.

Operation 1: Add c to each number between ax and ay inclusive. In other words, do transformation ak<---ak+c, k = x,x+1,…,y.

Operation 2: Multiply c to each number between ax and ay inclusive. In other words, do transformation ak<---ak×c, k = x,x+1,…,y.

Operation 3: Change the numbers between ax and ay to c, inclusive. In other words, do transformation ak<---c, k = x,x+1,…,y.

Operation 4: Get the sum of p power among the numbers between ax and ay inclusive. In other words, get the result of axp+ax+1p+…+ay p.

Yuanfang 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. 1 <= n, m <= 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". (1 <= x <= y <= n, 1 <= c <= 10,000, 1 <= p <= 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

    5 5
3 3 5 7
1 2 4 4
4 1 5 2
2 2 5 8
4 3 5 3
0 0

Sample Output

    307
7489

题意

给你一个序列,支持四种操作

1.区间加法

2.区间乘法

3.区间减法

4.求和,平方和,立方和 即\(\large \sum_{i=l}^{r}{a_i^p}(1\le p\le 3)\)

题解

一开始看到这道题,觉得可以用数学公式搞搞,搞了半天确实搞出了个公式,用sum1,sum2,sum3分别存和,平方和,立方和,然后合并的时候再搞

搞。但是感觉很麻烦,于是先上网查了查正解是不是有什么巧妙的方法。但是看完网上题解,我才发现都是用的玄学复杂度。

于是我就愉快地也跟着各位大佬一样玄学操作啦。

具体操作:还是用线段树,遇到一段连续相同的区间就可以马上得到答案,其余部分直接暴力就行,我寻思着只要先把每个数都变得不一样然后求所有数的立方和,直接就暴了(别想那么多,这题纯属娱乐)。

代码

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 0x7f7f7f7f
#define N 100050
#define mo 10007
ll n,m;
struct Node{ll l,r,lazy;};
struct segmentTree
{
Node tr[N<<2];
void push_up(ll x);
void push_down(ll x);
void bt(ll x,ll l,ll r);
void add(ll x,ll l,ll r,ll tt);
void multiply(ll x,ll l,ll r,ll tt);
void cover(ll x,ll l,ll r,ll tt);
ll query(ll x,ll l,ll r,ll tt);
}seg;
template<typename T>void read(T&x)
{
ll k=0; char c=getchar();
x=0;
while(!isdigit(c)&&c!=EOF)k^=c=='-',c=getchar();
if (c==EOF)exit(0);
while(isdigit(c))x=x*10+c-'0',c=getchar();
x=k?-x:x;
}
void read_char(char &c)
{while(!isalpha(c=getchar())&&c!=EOF);}
void segmentTree::push_up(ll x)
{
if(tr[x].l==tr[x].r)return;
Node &a=tr[x<<1],&b=tr[x<<1|1];
if (a.lazy==b.lazy&&tr[x].lazy==-1)tr[x].lazy=a.lazy;
}
void segmentTree::push_down(ll x)
{
if (tr[x].lazy==-1)return;
tr[x<<1].lazy=tr[x].lazy;
tr[x<<1|1].lazy=tr[x].lazy;
tr[x].lazy=-1;
}
void segmentTree::bt(ll x,ll l,ll r)
{
tr[x]=Node{l,r,0};
if (l==r)return;
ll mid=(l+r)>>1;
bt(x<<1,l,mid);
bt(x<<1|1,mid+1,r);
}
void segmentTree::add(ll x,ll l,ll r,ll tt)
{
if (l<=tr[x].l&&tr[x].r<=r&&tr[x].lazy!=-1)
{
tr[x].lazy+=tt;
tr[x].lazy%=mo;
return;
}
ll mid=(tr[x].l+tr[x].r)>>1;
push_down(x);
if (l<=mid)add(x<<1,l,r,tt);
if (mid<r)add(x<<1|1,l,r,tt);
push_up(x);
}
void segmentTree::multiply(ll x,ll l,ll r,ll tt)
{
if (l<=tr[x].l&&tr[x].r<=r&&tr[x].lazy!=-1)
{
tr[x].lazy*=tt;
tr[x].lazy%=mo;
return;
}
ll mid=(tr[x].l+tr[x].r)>>1;
push_down(x);
if (l<=mid)multiply(x<<1,l,r,tt);
if (mid<r)multiply(x<<1|1,l,r,tt);
push_up(x);
}
void segmentTree::cover(ll x,ll l,ll r,ll tt)
{
if (l<=tr[x].l&&tr[x].r<=r&&tr[x].lazy!=-1)
{
tr[x].lazy=tt%mo;
return;
}
ll mid=(tr[x].l+tr[x].r)>>1;
push_down(x);
if (l<=mid)cover(x<<1,l,r,tt);
if (mid<r)cover(x<<1|1,l,r,tt);
push_up(x);
}
ll segmentTree::query(ll x,ll l,ll r,ll tt)
{
if (l<=tr[x].l&&tr[x].r<=r&&tr[x].lazy!=-1)
{
ll ans=1;
for(ll i=1;i<=tt;i++)ans*=tr[x].lazy;
ans*=(tr[x].r-tr[x].l+1);
return ans%mo;
}
ll mid=(tr[x].l+tr[x].r)>>1,ans=0;
push_down(x);
if(l<=mid)ans+=query(x<<1,l,r,tt);
if(mid<r)ans+=query(x<<1|1,l,r,tt);
push_up(x);
return ans%mo;
}
void work()
{
read(n); read(m);
if (n+m==0)exit(0);
seg.bt(1,1,n);
for(ll i=1;i<=m;i++)
{
ll id,x,y,tt;
read(id); read(x); read(y); read(tt);
if (id==1)seg.add(1,x,y,tt);
if (id==2)seg.multiply(1,x,y,tt);
if (id==3)seg.cover(1,x,y,tt);
if (id==4)printf("%lld\n",seg.query(1,x,y,tt));
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("aa.in","r",stdin);
#endif
while(1)work();
}

HDU 4578 线段树玄学算法?的更多相关文章

  1. hdu 4578 线段树(标记处理)

    Transformation Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 65535/65536 K (Java/Others) ...

  2. HDU - 4578 线段树+三重操作

    这道题自己写了很久,还是没写出来,也看了很多题解,感觉多数还是看的迷迷糊糊,最后面看到一篇大佬的才感觉恍然大悟. 先上一篇大佬的题解:https://blog.csdn.net/aqa20372995 ...

  3. hdu 4578 线段树 ****

    链接:点我  1

  4. K - Transformation HDU - 4578 线段树经典题(好题)

    题意:区间  加   变成定值 乘  区间查询:和 平方和 立方和 思路:超级超级超级麻烦的一道题  设3个Lazy 标记分别为  change 改变mul乘 add加  优先度change>m ...

  5. HDU 4578 线段树复杂题

    题目大意: 题意:有一个序列,有四种操作: 1:区间[l,r]内的数全部加c. 2:区间[l,r]内的数全部乘c. 3:区间[l,r]内的数全部初始为c. 4:询问区间[l,r]内所有数的P次方之和. ...

  6. hdu 5877 线段树(2016 ACM/ICPC Asia Regional Dalian Online)

    Weak Pair Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total ...

  7. hdu 3974 线段树 将树弄到区间上

    Assign the task Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

  8. hdu 3436 线段树 一顿操作

    Queue-jumpers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To ...

  9. hdu 3397 线段树双标记

    Sequence operation Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Othe ...

随机推荐

  1. rxjs入门指南

    使用场景 在复杂的,频繁的异步请求场景,使用rxjs. 在依赖的多个异步数据,决定渲染的情景,使用rxjs. 总之:在前台频繁的.大量的.和后台数据交互的复杂项目里面,使用rxjs(web端,iOS, ...

  2. 【线性代数】6-7:SVD分解(Singular Value Decomposition-SVD)

    title: [线性代数]6-7:SVD分解(Singular Value Decomposition-SVD) categories: Mathematic Linear Algebra keywo ...

  3. 【零基础】风格迁移之deep-painterly-harmonization的安装和使用

    注:原项目名叫deep-painterly-harmonization,这里我缩写下称呼其为“DPH” 注:原项目GIT链接:https://github.com/luanfujun/deep-pai ...

  4. Linux rpm 安装MySQL

    1 检查是否存在旧版本mysql (1) mysql 执行命令:rpm -qa|grep mysql,若存在旧mysql,删除查询到的旧mysql,执行: rpm -e --nodeps XXXX  ...

  5. busybox中memdev的使用方法

    busybox中已经集成了devmem工具,你可以配置busybox即可. 在busybox的杂项中找到: CONFIG_USER_BUSYBOX_DEVMEM: devmem is a small ...

  6. 模糊C均值聚类-FCM算法

    FCM(fuzzy c-means) 模糊c均值聚类融合了模糊理论的精髓.相较于k-means的硬聚类,模糊c提供了更加灵活的聚类结果.因为大部分情况下,数据集中的对象不能划分成为明显分离的簇,指派一 ...

  7. 详解python中@的用法

    python中@的用法 @是一个装饰器,针对函数,起调用传参的作用. 有修饰和被修饰的区别,‘@function'作为一个装饰器,用来修饰紧跟着的函数(可以是另一个装饰器,也可以是函数定义). 代码1 ...

  8. C++ list 查找

    #include <iostream>#include <list>#include <algorithm> using namespace std; int ma ...

  9. Qt编写数据可视化大屏界面电子看板8-调整间距

    一.前言 在数据可视化大屏界面电子看板系统中,前期为了使用目标客户机,调整间距是必不可少的工作,QMainWindow中的QDockWidget,会默认生成布局和QSplitter调整宽高大小,鼠标移 ...

  10. [转]Android 应用自动更新及6.0,7.0,8.0适配安装

    原贴:https://www.jianshu.com/p/ea42040c7ace 原贴:https://www.jianshu.com/p/ea42040c7ace 原贴:https://www.j ...