Kaaleppi's run

#include <stdio.h> // include before iostream for faster scanf
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <set>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <sstream>
#include <tuple>
#include <utility>
#include <iomanip>
#include <iterator>

using namespace std;
typedef long long LL;

#define printv(printVec) for (auto printVecIter : (printVec)) cout << printVecIter << " "; cout << endl;

// g++-4.8 -Wall -Wshadow -std=c++11 a.cpp && ./a.out

int SZ = 3;

int main() {
	std::ios::sync_with_stdio(false);cin.tie(0);
	int n, q;
	cin >> n>>q;
	typedef pair<int,int> pii;
	typedef priority_queue<pii, vector<pii>> pq;

	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	//vector<vector<pair<int,int>>> sq(n/SZ + 2);
	vector<pq> sq(n/SZ + 2);
	vector<LL> sums(n/SZ + 2);
	for (int i = 0; i < n; i++) {
		sq[i/SZ].emplace(v[i],i);
		sums[i/SZ] += v[i];
	}

	while (q--) {
		int type; cin >> type;
		if (type == 2) {
//cout<<endl;
//printv(v);
			int l,r; cin>>l>>r; l--; r--;
			LL ans = 0;
			for (int i = l; i <= r; i++) {
				if (i + SZ < r && (i % SZ) == 0) {
					int block = i / SZ;
					ans += sums[block];
					i += SZ - 1;
				} else {
					ans += v[i];
				}
			}
			cout << ans <<"\n";
			continue;
		}

		int l,r,k; cin>>l>>r>>k; l--;r--;
		for (int i = l; i <= r; i++) {
			if (i + SZ < r && (i % SZ) == 0) {
				int block = i / SZ;
				while (sq[block].top().first >= k || v[sq[block].top().second] >= k) {
//cout <<q<<" "<<i << " " << sq[block].top().first << " MODIFyING " << sq[block].top().second <<endl; 
					int val, idx;
					tie(val, idx) = sq[block].top();
					sq[block].pop();
					sums[block] -= v[idx];
					v[idx] = v[idx] % k;
					sums[block] += v[idx];
					sq[block].emplace(v[idx], idx);
//cout <<sq[block].size() << " "<<sq[block].top().first << " NEWTOP " << sq[block].top().second <<endl; 
				}
				i += SZ - 1;
			} else {
				sums[i/SZ] -= v[i];
				v[i] = v[i] % k;
				sums[i/SZ] += v[i];
			}
		}
		
	}
	
}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: TIME LIMIT EXCEEDED

Test 21

Verdict: TIME LIMIT EXCEEDED

Test 22

Verdict: TIME LIMIT EXCEEDED

Test 23

Verdict: TIME LIMIT EXCEEDED

Test 24

Verdict: TIME LIMIT EXCEEDED

Test 25

Verdict: TIME LIMIT EXCEEDED

Test 26

Verdict: TIME LIMIT EXCEEDED

Test 27

Verdict: TIME LIMIT EXCEEDED

Test 28

Verdict: TIME LIMIT EXCEEDED

Test 29

Verdict: TIME LIMIT EXCEEDED

Test 30

Verdict: TIME LIMIT EXCEEDED