-
Notifications
You must be signed in to change notification settings - Fork 0
/
MULTQ3.cs
196 lines (165 loc) · 6.11 KB
/
MULTQ3.cs
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
185
186
187
188
189
190
191
192
193
194
195
196
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace MMT_Elitmus
{
struct Node
{
public int z;
public int o;
public int t;
}
class MULTQ3
{
static Node[] SegmentTree;
static int[] lazy;
static void Main1(string[] args)
{
string[] f = Console.ReadLine().Split(' ');
int N = Convert.ToInt32(f[0]);
int Q = Convert.ToInt32(f[1]);
int x = (int)Math.Ceiling(Math.Log(N, 2));
int max_size = 2 * (int)Math.Pow(2, x) - 1;
// 262140
SegmentTree = new Node[max_size];
lazy = new int[max_size];
BuildSegmentTree(0, 0, N - 1);
while (Q-- > 0)
{
string hj = "";
hj = Console.ReadLine();
string[] q = hj.Split(' ');
if (q[0] == "1")
{
int start = Convert.ToInt32(q[1]);
int end = Convert.ToInt32(q[2]);
int answer = query(0, 0, N - 1, start, end).z;
Console.Write(answer);
Console.Write('\n');
}
else
{
int start = Convert.ToInt32(q[1]);
int end = Convert.ToInt32(q[2]);
update(0, 0, N - 1, start, end, 1);
}
}
}
static void BuildSegmentTree(int node, int start, int end)
{
if (start == end)
{
SegmentTree[node] = new Node() { z = 1 };
}
else
{
int mid = (start + end) / 2;
BuildSegmentTree(node * 2 + 1, start, mid);
BuildSegmentTree(node * 2 + 2, mid + 1, end);
int Z = SegmentTree[node * 2 + 1].z + SegmentTree[node * 2 + 2].z;
int O = SegmentTree[node * 2 + 1].o + SegmentTree[node * 2 + 2].o;
int T = SegmentTree[node * 2 + 1].t + SegmentTree[node * 2 + 2].t;
SegmentTree[node] = new Node() { z = Z, o = O, t = T };
}
}
static void update(int node, int start, int end, int l, int r, int val)
{
if (lazy[node] != 0)
{
int increments = lazy[node];
int rem = increments % 3;
if (rem == 1)
{
int Z = SegmentTree[node].t;
int O = SegmentTree[node].z;
int T = SegmentTree[node].o;
SegmentTree[node] = new Node() { z = Z, o = O, t = T };
}
if (rem == 2)
{
int Z = SegmentTree[node].o;
int O = SegmentTree[node].t;
int T = SegmentTree[node].z;
SegmentTree[node] = new Node() { z = Z, o = O, t = T };
}
if (start != end)
{
lazy[2 * node + 1] += increments;
lazy[2 * node + 2] += increments;
}
lazy[node] = 0;
}
if (start > end || start > r || end < l)
return;
if (l <= start && r >= end)
{
int Z = SegmentTree[node].t;
int O = SegmentTree[node].z;
int T = SegmentTree[node].o;
SegmentTree[node] = new Node() { z = Z, o = O, t = T };
if (start != end)
{
// how many nodes are getting hit...
lazy[node * 2 + 1] += val;
lazy[node * 2 + 2] += val;
}
return;
}
int mid = (start + end) / 2;
update(node * 2 + 1, start, mid, l, r, val);
update(node * 2 + 2, mid + 1, end, l, r, val);
int ZZ = SegmentTree[node * 2 + 1].z + SegmentTree[node * 2 + 2].z;
int OO = SegmentTree[node * 2 + 1].o + SegmentTree[node * 2 + 2].o;
int TT = SegmentTree[node * 2 + 1].t + SegmentTree[node * 2 + 2].t;
SegmentTree[node].z = ZZ;
SegmentTree[node].o = OO;
SegmentTree[node].t = TT;
}
static Node query(int node, int start, int end, int l, int r)
{
if (lazy[node] != 0)
{
int increments = lazy[node];
int rem = increments % 3;
if (rem == 1)
{
int Z = SegmentTree[node].t;
int O = SegmentTree[node].z;
int T = SegmentTree[node].o;
SegmentTree[node] = new Node() { z = Z, o = O, t = T };
}
if (rem == 2)
{
int Z = SegmentTree[node].o;
int O = SegmentTree[node].t;
int T = SegmentTree[node].z;
SegmentTree[node] = new Node() { z = Z, o = O, t = T };
}
if (start != end)
{
lazy[2 * node + 1] += lazy[node];
lazy[2 * node + 2] += lazy[node];
}
lazy[node] = 0;
}
if (start > end || start > r || end < l)
return new Node();
if (l <= start && end <= r)
{
return SegmentTree[node];
}
else
{
int mid = (start + end) / 2;
Node p1 = query(node * 2 + 1, start, mid, l, r);
Node p2 = query(node * 2 + 2, mid + 1, end, l, r);
int Z = p1.z + p2.z;
int O = p1.o + p2.o;
int T = p1.t + p2.t;
return new Node() { z = Z, t = T, o = O };
}
}
}
}