CodeForces 438D The Child and Sequence 数据结构+点更新（赋值）+区间求和

CodeForces 438D The Child and Sequence

Time Limit:4000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 438D

Description

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:

1. Print operation l, r. Picks should write down the value of .
2. Modulo operation l, r, x. Picks should perform assignment a[i] = a[i] mod x for each i (l ≤ i ≤ r).
3. 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 ≤ 10⁵). The second line contains n integers, separated by space: a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 10⁹) — 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 ≤ 10⁹), which correspond the operation 2.
• If type = 3, there will be two integers more in the line: k, x (1 ≤ k ≤ n; 1 ≤ x ≤ 10⁹), 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 Input

Input

5 5
1 2 3 4 5
2 3 5 4
3 3 5
1 2 5
2 1 3 3
1 1 3

Output

8
5

Input

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

Output

49
15
23
1
9

Hint

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.

解题思路：

其实就是线段树的套路

1，首先是点更新（赋值），每次的更新更新到叶子节点复杂度logn

2，维护区间和，区间最大值，取模的时候根据最大值是否大于mod决定是否继续向下更新

3，最后就是求和了，仔细一分析还是水题目一个，比赛的时候为什么总是纠结取模的时候

更新到叶子节点是不是会超时，哎错过了一个拿分的机会。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
const int maxn = 100005;
LL sum[maxn<<2];
LL maxv[maxn<<2];
int n,m;
void PushUP(int rt) {
	sum[rt] = sum[rt<<1] + sum[rt<<1|1];
	maxv[rt] = max(maxv[rt<<1],maxv[rt<<1|1]) ;
}
void build(int l,int r,int rt) {
	if (l == r) {
		scanf("%I64d",&sum[rt]);
		maxv[rt] = sum[rt] ;
		return ;
	}
	int m = (l + r) >> 1;
	build(lson);
	build(rson);
	PushUP(rt);
}
void update(int p,int x,int l,int r,int rt) {
	if (l == r) {
		sum[rt] = x;
		maxv[rt] = x;
		return ;
	}
	int m = (l + r) >> 1;
	if (p <= m) update(p , x , lson);
	else update(p , x , rson);
	PushUP(rt);
}
LL query(int L,int R,int l,int r,int rt) {
	if (L <= l && r <= R) {
		return sum[rt];
	}
	int m = (l + r) >> 1;
	LL ret = 0;
	if (L <= m) ret += query(L , R , lson);
	if (R > m) ret += query(L , R , rson);
	return ret;
}

void update2(int L,int R,int mode,int l,int r,int rt){
    int m = (l + r) >> 1;
    if (L <= l && r <= R) {
		if(maxv[rt]>=mode&&l==r){
            maxv[rt] %= mode ;
            sum[rt] = maxv[rt] ;
		}else if(maxv[rt]>=mode){
            update2(L,R,mode,lson);
            update2(L,R,mode,rson);
            PushUP(rt);
		}
		return ;
	}
	if (L <= m) update2(L,R,mode,lson);
	if (R > m) update2(L,R,mode,rson);
	PushUP(rt);
}


int main() {
    //freopen("in.txt","r",stdin) ;
	while(~scanf("%d%d",&n,&m)){
        memset(sum,0,sizeof(sum)) ;
        memset(maxv,0,sizeof(maxv)) ;
        build(1,n,1);
        for(int i=0;i<m;i++){
            int type ;
            scanf("%d",&type);
            if(type==1){
                int a,b;
                scanf("%d%d",&a,&b);
                printf("%I64d\n",query(a,b,1,n,1));
            }
            if(type==2){
                int l,r,x ;
                scanf("%d%d%d",&l,&r,&x);
                update2(l,r,x,1,n,1) ;
            }
            if(type==3){
                int k,x;
                scanf("%d%d",&k,&x);
                update(k,x,1,n,1);
            }
        }
	}
	return 0;
}