Algorithm_templates/Lazyseg.cpp at main · seo-bo/Algorithm_templates · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
class Lazyseg //https://github.com/seo-bo/Algorithm_templates/blob/main/Lazyseg.cpp
{
private:
	int n;
	long long MOD;
	vector<long long>tree, lazy;
	void build(vector<long long>& v, int start, int end, int node)
	{
		if (start == end)
		{
			tree[node] = v[start];
			return;
		}
		int mid = (start + end) / 2;
		build(v, start, mid, node * 2);
		build(v, mid + 1, end, node * 2 + 1);
		tree[node] = (tree[node * 2] + tree[node * 2 + 1]) % MOD;
	}
	void lazy_update(int start, int end, int node)
	{
		if (lazy[node])
		{
			tree[node] = (tree[node] + (end - start + 1) * lazy[node]) % MOD;
			if (start != end)
			{
				lazy[node * 2] = (lazy[node * 2] + lazy[node]) % MOD;
				lazy[node * 2 + 1] = (lazy[node * 2 + 1] + lazy[node]) % MOD;
			}
			lazy[node] = 0;
		}
	}
	void update_tree(int start, int end, int node, int left, int right, long long value)
	{
		lazy_update(start, end, node);
		if (start > right || end < left)
		{
			return;
		}
		if (left <= start && end <= right)
		{
			tree[node] = (tree[node] + (end - start + 1) * value) % MOD;;
			if (start != end)
			{
				lazy[node * 2] = (lazy[node * 2] + value) % MOD;
				lazy[node * 2 + 1] = (lazy[node * 2 + 1] + value) % MOD;
			}
			return;
		}
		int mid = (start + end) / 2;
		update_tree(start, mid, node * 2, left, right, value);
		update_tree(mid + 1, end, node * 2 + 1, left, right, value);
		tree[node] = (tree[node * 2] + tree[node * 2 + 1]) % MOD;
	}
	long long get_sum(int start, int end, int node, int left, int right)
	{
		lazy_update(start, end, node);
		if (start > right || end < left)
		{
			return 0LL;
		}
		if (left <= start && end <= right)
		{
			return tree[node];
		}
		int mid = (start + end) / 2;
		return (get_sum(start, mid, node * 2, left, right) + get_sum(mid + 1, end, node * 2 + 1, left, right)) % MOD;
	}
public:
	Lazyseg(vector<long long>& v, long long mod = LLONG_MAX)
	{
		n = v.size();
		MOD = mod;
		tree.resize(4 * n + 3, 0);
		lazy.resize(4 * n + 3, 0);
		build(v, 0, n - 1, 1);
	}
	void update(int left, int right, long long value)
	{
		if (left > right)
		{
			swap(left, right);
		}
		update_tree(0, n - 1, 1, left, right, value);
	}
	long long query(int left, int right)
	{
		if (left > right)
		{
			swap(left, right);
		}
		return get_sum(0, n - 1, 1, left, right);
	}
};