At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite sequence of Picks.
Fortunately, Picks remembers how to repair the sequence. Initially he should create an integer array a[1], a[2], ..., a[n]. Then he should perform a sequence of m operations. An operation can be one of the following:
- Print operation l, r. Picks should write down the value of
. - Modulo operation l, r, x. Picks should perform assignment a[i] = a[i] mod x for each i (l ≤ i ≤ r).
- Set operation k, x. Picks should set the value of a[k] to x (in other words perform an assignment a[k] = x).
Can you help Picks to perform the whole sequence of operations?
Input
The first line of input contains two integer: n, m (1 ≤ n, m ≤ 105). The second line contains n integers, separated by space: a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 109) — initial value of array elements.
Each of the next m lines begins with a number type
.
- If type = 1, there will be two integers more in the line: l, r (1 ≤ l ≤ r ≤ n), which correspond the operation 1.
- If type = 2, there will be three integers more in the line: l, r, x (1 ≤ l ≤ r ≤ n; 1 ≤ x ≤ 109), which correspond the operation 2.
- If type = 3, there will be two integers more in the line: k, x (1 ≤ k ≤ n; 1 ≤ x ≤ 109), which correspond the operation 3.
Output
For each operation 1, please print a line containing the answer. Notice that the answer may exceed the 32-bit integer.
Sample 1
Inputcopy | Outputcopy |
---|---|
5 5 1 2 3 4 5 2 3 5 4 3 3 5 1 2 5 2 1 3 3 1 1 3 | 8 5 |
Sample 2
Inputcopy | Outputcopy |
---|---|
10 10 6 9 6 7 6 1 10 10 9 5 1 3 9 2 7 10 9 2 5 10 8 1 4 7 3 3 7 2 7 9 9 1 2 4 1 6 6 1 5 9 3 1 10 | 49 15 23 1 9 |
Note
Consider the first testcase:
- At first, a = {1, 2, 3, 4, 5}.
- After operation 1, a = {1, 2, 3, 0, 1}.
- After operation 2, a = {1, 2, 5, 0, 1}.
- At operation 3, 2 + 5 + 0 + 1 = 8.
- After operation 4, a = {1, 2, 2, 0, 1}.
- At operation 5, 1 + 2 + 2 = 5.
思路:
树形结构。
按模板,细节方面比如数据类型/数组大小之类的注意一下。
#include<iostream>
using namespace std;
typedef long long ll;
const int N=1e5;
int n,m,type,l,L,R;
ll x,a[N+5],r;
struct tree
{
ll sum,max;
}t[N*4+5];
void pushup(int k)
{
t[k].sum =t[k*2].sum +t[k*2+1].sum ;
t[k].max =max(t[k*2].max ,t[k*2+1].max );
}
void build(int k,int L,int R)
{
//printf("build");
if(L==R)
{
t[k].max =t[k].sum =a[L];
return ;
}
int mid=(L+R)/2;
build(k*2,L,mid);
build(k*2+1,mid+1,R);
pushup(k);
}
void mod(int k,int L,int R,int l,ll r,ll x)
{
//printf("mod");
if(t[k].max <x)
return;
if(L==R)
{
t[k].max %=x;
t[k].sum =t[k].max ;
return;
}
int mid=(L+R)/2;
if(l<=mid)
mod(k*2,L,mid,l,r,x);
if(r>mid)
mod(k*2+1,mid+1,R,l,r,x);
pushup(k);
}
void change(int k,int L,int R,int l,ll x)
{
//printf("change");
if(L==R&&L==l)
{
t[k].sum =t[k].max =r;
return ;
}
int mid=(L+R)/2;
if(l<=mid)
change(k*2,L,mid,l,x);
else
change(k*2+1,mid+1,R,l,x);
pushup(k);
}
ll query(int k,int L,int R,int l,ll r)
{
//printf("query");
ll s=0;
if(l<=L&&r>=R)
return t[k].sum ;
int mid=(L+R)/2;
if(l<=mid)
s+=query(k*2,L,mid,l,r);
if(r>mid)
s+=query(k*2+1,mid+1,R,l,r);
return s;
}
int main()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
build(1,1,n);
//for(int i=1;i<=4*n;i++)
// printf("shu:%lld %lld\n",t[i].max ,t[i].sum );
while(m--)
{
scanf("%d %d %lld",&type,&l,&r);
if(type==1)
{
printf("%lld\n",query(1,1,n,l,r));
}
else if(type==2)
{
scanf("%lld",&x);
mod(1,1,n,l,r,x);
}
else if(type==3)
{
change(1,1,n,l,r);
}
//for(int i=1;i<=4*n;i++)
// printf("%lld %lld\n",t[i].max ,t[i].sum );
}
return 0;
}