-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathJ.java
More file actions
181 lines (156 loc) · 5.18 KB
/
Copy pathJ.java
File metadata and controls
181 lines (156 loc) · 5.18 KB
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
package atcoder.practice;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public final class J {
private static class Node {
int[] freq = new int[3];
int[] prefixSum = new int[3];
long count;
}
private static class SegTree {
int leftMost, rightMost;
SegTree left, right;
Node node = new Node();
SegTree(int leftMost, int rightMost, int[] arr) {
this.leftMost = leftMost;
this.rightMost = rightMost;
if (leftMost == rightMost) {
node.freq[arr[leftMost]]++;
for (int i = arr[leftMost]; i <= 2; i++) {
node.prefixSum[i]++;
}
} else {
final int mid = leftMost + rightMost >>> 1;
left = new SegTree(leftMost, mid, arr);
right = new SegTree(mid + 1, rightMost, arr);
node = merge(left.node, right.node);
}
}
private static Node merge(Node l, Node r) {
final Node res = new Node();
for (int i = 1; i <= 2; i++) {
res.freq[i] = l.freq[i] + r.freq[i];
res.prefixSum[i] = res.freq[i] + res.prefixSum[i - 1];
res.count += (long) l.freq[i] * r.prefixSum[i - 1];
}
res.count += l.count + r.count;
return res;
}
private Node query(int l, int r) {
if (r < leftMost || l > rightMost) {
return new Node();
}
if (l <= leftMost && rightMost <= r) {
return node;
}
return merge(left.query(l, r), right.query(l, r));
}
private void update(int idx, int newVal) {
if (leftMost == rightMost) {
node = new Node();
node.freq[newVal]++;
for (int i = newVal; i <= 2; i++) {
node.prefixSum[i]++;
}
} else {
final int mid = leftMost + rightMost >>> 1;
if (idx <= mid) {
left.update(idx, newVal);
} else {
right.update(idx, newVal);
}
node = merge(left.node, right.node);
}
}
}
public static void main(String[] args) {
final FastScanner fs = new FastScanner();
final PrintWriter pw = new PrintWriter(System.out);
final int n = fs.nextInt();
final int q = fs.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = fs.nextInt() + 1;
}
SegTree st = new SegTree(0, n - 1, arr);
for (int i = 0; i < q; i++) {
int type = fs.nextInt();
if (type == 1) {
} else {
System.out.println(st.query(fs.nextInt() - 1, fs.nextInt() - 1).count);
}
}
System.out.println(n);
}
static final class Util {
public static void shuffleSort(int[] x) {
shuffle(x);
Arrays.sort(x);
}
public static void shuffleSort(long[] x) {
shuffle(x);
Arrays.sort(x);
}
public static void shuffle(int[] x) {
final Random r = new Random();
for (int i = 0; i <= x.length - 2; i++) {
final int j = i + r.nextInt(x.length - i);
swap(x, i, j);
}
}
public static void shuffle(long[] x) {
final Random r = new Random();
for (int i = 0; i <= x.length - 2; i++) {
final int j = i + r.nextInt(x.length - i);
swap(x, i, j);
}
}
public static void swap(int[] x, int i, int j) {
final int t = x[i];
x[i] = x[j];
x[j] = t;
}
public static void swap(long[] x, int i, int j) {
final long t = x[i];
x[i] = x[j];
x[j] = t;
}
private Util() {}
}
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
private String next() {
while (!st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
//noinspection CallToPrintStackTrace
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
int[] nextIntArray(int n) {
final int[] a = new int[n];
for (int i = 0; i < n; i++) { a[i] = nextInt(); }
return a;
}
long[] nextLongArray(int n) {
final long[] a = new long[n];
for (int i = 0; i < n; i++) { a[i] = nextLong(); }
return a;
}
}
}