Kaaleppi's run

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N=1<<18;
ll sst[2*N];
ll mst[2*N];

void run(int i, int stl, int str, int l, int r, ll k){
	if (stl>r||str<l) return;
	if (mst[i]<k) return;
	if (stl==str){
		sst[i]%=k;
		mst[i]%=k;
	}
	else{
		int m=(stl+str)/2;
		run(i*2, stl, m, l, r, k);
		run(i*2+1, m+1, str, l, r, k);
		mst[i]=max(mst[i*2], mst[i*2+1]);
		sst[i]=sst[i*2]+sst[i*2+1];
	}
}

ll sum(int a, int b){
	a+=N;
	b+=N;
	ll su=0;
	while (a<=b){
		if (a%2) su+=sst[a++];
		if (!(b%2)) su+=sst[b--];
		a/=2;
		b/=2;
	}
	return su;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,q;
	cin>>n>>q;
	assert(1<=n&&n<=200000);
	assert(1<=q&&q<=200000);
	for (int i=1;i<=n;i++){
		int a;
		cin>>a;
		assert(1<=a&&a<=1e9);
		mst[N+i]=a;
		sst[N+i]=a;
	}
	for (int i=N-1;i>=1;i--){
		mst[i]=max(mst[i*2], mst[i*2+1]);
		sst[i]=sst[i*2]+sst[i*2+1];
	}
	for (int qq=0;qq<q;qq++){
		int t,l,r;
		cin>>t>>l>>r;
		assert(t==1||t==2);
		assert(1<=l&&l<=r&&r<=n);
		if (t==2){
			cout<<sum(l, r)<<'\n';
		}
		else{
			int k;
			cin>>k;
			assert(1<=k&&k<=1e9);
			run(1, 0, N-1, l, r, k);
		}
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED