BaekJoon_Online_Judge/ArrayandOperations.cpp at master · Chan531/BaekJoon_Online_Judge · 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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
#include <iostream>
#include <cmath>
#include <algorithm>
#define N 101010
#define ll long long

using namespace std;

int n, m;
ll arr[N], tree[N * 4][3], ad[N * 4], sq[N * 4];	// 0 -> sum, 1 -> max, 2 -> min

void input()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> arr[i];
}

void update(int node)
{
	tree[node][0] = tree[node * 2][0] + tree[node * 2 + 1][0];
	tree[node][1] = max(tree[node * 2][1], tree[node * 2 + 1][1]);
	tree[node][2] = min(tree[node * 2][2], tree[node * 2 + 1][2]);
}

void init(int s, int e, int node)
{
	if (s == e)
	{
		tree[node][0] = arr[s];
		tree[node][1] = arr[s];
		tree[node][2] = arr[s];
		return;
	}

	int m = (s + e) / 2;
	init(s, m, node * 2);
	init(m + 1, e, node * 2 + 1);
	update(node);
}

void lazy_add(int s, int e, int node)
{
	tree[node][0] += ad[node] * (e - s + 1);
	tree[node][1] += ad[node];
	tree[node][2] += ad[node];
	if (s != e)
	{
		ad[node * 2] += ad[node];
		ad[node * 2 + 1] += ad[node];
	}
	ad[node] = 0;
}

void lazy_sqr(int s, int e, int node)
{
	tree[node][0] = (sq[node] + ad[node]) * (e - s + 1);
	tree[node][1] = sq[node] + ad[node];
	tree[node][2] = sq[node] + ad[node];
	if (s != e)
	{
		sq[node * 2] = sq[node];
		ad[node * 2] = ad[node];
		sq[node * 2 + 1] = sq[node];
		ad[node * 2 + 1] = ad[node];
	}
	sq[node] = 0;
	ad[node] = 0;
}

void check(int s, int e, int node)
{
	if (!ad[node] && !sq[node]) return;

	/* add만 발생할 시 */
	if (!sq[node]) lazy_add(s, e, node);

	/* sqrt도 해야하는 경우 */
	else lazy_sqr(s, e, node);
}

void add(int s, int e, int node, int l, int r, ll val)
{
	check(s, e, node);
	if (s > r || e < l) return;
	if (s >= l && e <= r)
	{
		if (!sq[node])
		{
			ad[node] += val;
			check(s, e, node);
			return;
		}
	}

	int m = (s + e) / 2;
	add(s, m, node * 2, l, r, val);
	add(m + 1, e, node * 2 + 1, l, r, val);
	update(node);
}

void sqr(int s, int e, int node, int l, int r)
{
	check(s, e, node);
	if (s > r || e < l) return;
	if (s >= l && e <= r)
	{
		int sqx = sqrt(tree[node][1]);
		int sqn = sqrt(tree[node][2]);

		if (sqx == sqn)
		{
			sq[node] = sqx;
			check(s, e, node);
			return;
		}

		if (tree[node][1] == tree[node][2] + 1)
		{
			ad[node] = sqn - tree[node][2];
			check(s, e, node);
			return;
		}
	}

	int m = (s + e) / 2;
	sqr(s, m, node * 2, l, r);
	sqr(m + 1, e, node * 2 + 1, l, r);
	update(node);
}

ll output(int s, int e, int node, int l, int r)
{
	check(s, e, node);
	if (s > r || e < l) return 0;
	if (s >= l && e <= r) return tree[node][0];

	int m = (s + e) / 2;
	return output(s, m, node * 2, l, r) + output(m + 1, e, node * 2 + 1, l, r);
}

void solution()
{
	init(1, n, 1);

	while (m--)
	{
		int a, b, c;
		ll d;
		cin >> a;

		if (a == 1)
		{
			cin >> b >> c >> d;
			add(1, n, 1, b, c, d);
		}

		else if (a == 2)
		{
			cin >> b >> c;
			sqr(1, n, 1, b, c);
		}

		else
		{
			cin >> b >> c;
			cout << output(1, n, 1, b, c) << '\n';
		}
	}
}

void solve()
{
	input();
	solution();
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	solve();
	return 0;
}