-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAtCoder2.java
More file actions
100 lines (70 loc) · 1.88 KB
/
AtCoder2.java
File metadata and controls
100 lines (70 loc) · 1.88 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
package test;
import java.io.*;
import java.util.*;
public class AtCoder2 {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static int nextInt() throws IOException {
return Integer.parseInt(br.readLine());
}
public static long nextLong() throws IOException {
return Long.parseLong(br.readLine());
}
public static String next() throws IOException {
return br.readLine();
}
public static int[] sortArr(int arr[]) throws IOException {
ArrayList<Integer> a = new ArrayList<Integer>();
for (int i : arr)
a.add(i);
Collections.sort(a);
for (int i = 0; i < a.size(); i++)
arr[i] = a.get(i);
return arr;
}
public static int[] desortArr(int arr[]) throws IOException {
ArrayList<Integer> a = new ArrayList<Integer>();
for (int i : arr)
a.add(i);
Collections.sort(a, Collections.reverseOrder());
for (int i = 0; i < a.size(); i++)
arr[i] = a.get(i);
return arr;
}
public static int[] nextArr() throws IOException {
String elements[] = br.readLine().split(" ");
int arr[] = new int[elements.length];
for (int j = 0; j < elements.length; j++)
arr[j] = Integer.parseInt(elements[j]);
return arr;
}
public static void printArr(int arr[]) {
for (int i = 0; i < arr.length; i++)
System.out.print(arr[i] + " ");
}
public static void main(String[] args) throws IOException {
int T = 1;
T = nextInt();
while (T-- > 0) {
int n = nextInt();
int arr[] = nextArr();
int aux[] = new int[100003];
long sum = 0;
for (int i = 0; i < arr.length; i++) {
sum += arr[i];
aux[arr[i]]++;
}
int q = nextInt();
for (int i = 0; i < q; i++) {
int input[] = nextArr();
int c = input[0];
int d = input[1];
long m = (long) d * aux[c];
long o = (long) c * aux[c];
sum += m - o;
aux[d] += aux[c];
aux[c] = 0;
System.out.println(sum);
}
}
}
}