input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import defaultdict
n = int(eval(input()))
nums = list(map(int, input().split()))
dic = defaultdict(int)
for num in nums:
dic[num] += 1
answers = []
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
dic[c] += dic[b]
dic[b] = 0
answer = 0
for i, v in list(dic.items()):
answer += i * v
answers.append(answer)
for answer in answers:
print(answer) | from collections import Counter
n = int(eval(input()))
nums = tuple(map(int, input().split()))
count = Counter(nums)
s = sum(nums)
answers = []
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
s = s + (c - b) * count[b]
count[c] += count[b]
count[b] = 0
answers.append(s)
for answer in answers:
print(answer) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BCs = [list(map(int,input().split())) for _ in range(Q)]
max_A = max(A)
# Aの値について数列を作る
A_num = [A.count(i) for i in range(10 ** 5 + 1)]
Si = sum(A)
for BC in BCs:
# BC[0] ... 置換前の値
# BC[1] ... 置換後の値
if A_num[BC[0]] > 0:
Si += A_num[BC[0]] * (BC[1] -BC[0])
A_num[BC[1]] += A_num[BC[0]]
A_num[BC[0]] = 0
print(Si) | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BCs = [list(map(int,input().split())) for _ in range(Q)]
max_A = max(A)
# Aの値について数列を作る
# A_num = [A.count(i) for i in range(10 ** 5 + 1)]
A_num = [0 for i in range(10 ** 5 + 1)]
for a in A:
A_num[a] += 1
Si = sum(A)
for BC in BCs:
# BC[0] ... 置換前の値
# BC[1] ... 置換後の値
if A_num[BC[0]] > 0:
Si += A_num[BC[0]] * (BC[1] -BC[0])
A_num[BC[1]] += A_num[BC[0]]
A_num[BC[0]] = 0
print(Si) | p02630 |
#!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
_ = int(eval(input()))
A = [int(x) for x in input().split()]
Q = int(eval(input()))
lst = [0 for _ in [0] * (10 ** 5 + 1)]
sum_lst = 0
for n in range(10 ** 5 + 1):
lst[n] = A.count(n)
sum_lst += n * lst[n]
for _ in range(Q):
B, C = list(map(int, input().split()))
sum_lst += (C - B) * lst[B]
print(sum_lst)
lst[C] += lst[B]
lst[B] = 0
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
_ = int(eval(input()))
lst = [0 for _ in [0] * (10 ** 5 + 1)]
sum_lst = 0
for a in [int(x) for x in input().split()]:
sum_lst += a
lst[a] += 1
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
sum_lst += (C - B) * lst[B]
print(sum_lst)
lst[C] += lst[B]
lst[B] = 0
if __name__ == '__main__':
main()
| p02630 |
# -*- coding: utf-8 -*-
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(Q)]
x, y = [list(i) for i in zip(*xy)]
def replace_list(num_list):
num_list = [y[index] if j==i else j for j in num_list]
return num_list
for index, i in enumerate(x):
#first_sum = sum(A)
#c = collections.Counter(A)
#first_sum = c[i]*(y[index]-i)+first_sum
while i in A :
A.remove(i) #全てのiを削除します。
A.append(y[index])
first_sum = sum(A)
print(first_sum)
| # -*- coding: utf-8 -*-
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(Q)]
b, c = [list(i) for i in zip(*xy)]
sum_num = sum(A)
counter = collections.Counter(A)
for i in range(Q):
sum_num -= counter[b[i]]*b[i] #counter[x]でxの個数をカウント
sum_num += counter[b[i]]*c[i] #cで上書きされたので、c*counter[b]になる
counter[c[i]] += counter[b[i]]
counter[b[i]] = 0
print(sum_num)
| p02630 |
from collections import Counter
n=int(eval(input()))
a = Counter(list(map(int,input().split())))
q=int(eval(input()))
last = sum([v*a[v] for v in a])
for _ in range(q):
b,c = list(map(int,input().split()))
last = last - b*a.get(b,0) + c*a.get(b,0)
a[b],a[c] = 0, a.get(c,0)+a.get(b,0)
print(last)
| n=int(eval(input()))
A = list(map(int,input().split()))
B = {}
s = 0
for a in A:
B[a] = B.get(a,0)+1
s += a
q=int(eval(input()))
for _ in range(q):
b,c=list(map(int,input().split()))
s = s - b*B.get(b,0) + c*B.get(b,0)
B[c] = B.get(c,0)+B.get(b,0)
B[b] = 0
print(s)
| p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
d = Counter(a)
s = sum([k*v for k, v in list(d.items())])
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
if b not in list(d.keys()):
print(s)
continue
cc = 0
if c in list(d.keys()):
cc = d[c]
d[c] = cc + d[b]
del d[b]
s = sum([k * v for k, v in list(d.items())])
print(s)
| from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
d = Counter(a)
s = sum([k*v for k, v in list(d.items())])
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
if b not in list(d.keys()):
print(s)
continue
cc = 0
s = s + (c-b) * d[b]
print(s)
if c in list(d.keys()):
cc = d[c]
d[c] = cc + d[b]
del d[b]
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(int, input().split()))
num = []
for i in range(100001):
num.append(a.count(i))
sum = sum(a)
for i in range(q):
sum = sum + (c[i] - b[i]) * num[b[i]]
print(sum)
num[c[i]] += num[b[i]]
num[b[i]] = 0 | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
counter = Counter(a)
sum_res = sum(a)
for _ in range(q):
b, c = list(map(int, input().split()))
sum_res += (c - b) * counter[b]
counter[c] += counter[b]
counter[b] =0
print(sum_res) | p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
co = Counter(a)
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
if b in list(co.keys()):
co[c] += co[b]
co[b] = 0
ans = 0
for i in list(co.items()):
ans += i[0] * i[1]
print(ans) | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
co = Counter(a)
q = int(eval(input()))
ans = 0
for i in list(co.items()):
ans += i[0] * i[1]
for _ in range(q):
b, c = list(map(int, input().split()))
if b in list(co.keys()):
ans -= b * co[b]
co[c] += co[b]
ans += c * co[b]
co[b] = 0
print(ans) | p02630 |
from collections import Counter
def get_sum(count):
return sum([key * count[key] for key in list(count.keys())])
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
count = Counter(a)
for i in range(q):
b, c = list(map(int, input().split()))
count[c] += count[b]
count[b] = 0
print((get_sum(count))) | from collections import Counter
def get_sum(count):
return sum([key * count[key] for key in list(count.keys())])
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
count = Counter(a)
s = sum(a)
for i in range(q):
b, c = list(map(int, input().split()))
count[c] += count[b]
s -= count[b] * b
s += count[b] * c
count[b] = 0
print(s) | p02630 |
from collections import Counter
def main():
n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = sum(a)
q = int(eval(input()))
d = dict((x,a.count(x)) for x in set(a))
# Counterを敢えて使わないでやってみる
# d = Counter(a)
for _ in range(q):
b, c = list(map(int, input().split()))
# cの値がない場合の対処
d.setdefault(c, 0)
# bの値がない場合の対処
d[c] = d.get(c) + d.get(b, 0)
# 差分はbの個数 * (c-b)
diff = d.get(b, 0) * (c-b)
d[b] = 0
ans += diff
print(ans)
if __name__ == '__main__':
main() | from collections import Counter
def main():
n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = sum(a)
q = int(eval(input()))
#d = dict((x,a.count(x)) for x in set(a))
d = Counter(a)
for _ in range(q):
b, c = list(map(int, input().split()))
# cの値がない場合の対処
d.setdefault(c, 0)
# bの値がない場合の対処
d[c] = d.get(c) + d.get(b, 0)
# 差分はbの個数 * (c-b)
diff = d.get(b, 0) * (c-b)
d[b] = 0
ans += diff
print(ans)
if __name__ == '__main__':
main() | p02630 |
from collections import*
_,A,_,*Q=[list(map(int,l.split()))for l in open(0)];A=[a for a in A];s=sum(A);C=Counter(A)
for b,c in Q:s+=(c-b)*C[b];C[c]+=C[b];C[b]=0;print(s) | from collections import*
_,A,_,*Q=[list(map(int,l.split()))for l in open(0)];s=sum(A:=[a for a in A]);C=Counter(A)
for b,c in Q:s+=(c-b)*C[b];C[c]+=C[b];C[b]=0;print(s) | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
summ=sum(a)
num=[a.count(i) for i in range(100001)]
for i in range(q):
b,c=list(map(int,input().split()))
b_num=num[b]
num[c] += b_num
num[b]=0
summ +=(c-b)*b_num
print(summ) | n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
summ=sum(a)
num=[0 for i in range(10**5+1)]
for i in range(n):
num[a[i]] += 1
for i in range(q):
b,c=list(map(int,input().split()))
b_num=num[b]
num[c] += b_num
num[b]=0
summ +=(c-b)*b_num
print(summ) | p02630 |
n = eval(input())
a = [int(i) for i in input().split()]
q = int(eval(input()))
bb = []
cc = []
for i in range(q):
btmp, ctmp = [int(j) for j in input().split()]
bb.append(btmp)
cc.append(ctmp)
atol = sum(a)
for b,c in zip(bb,cc):
count = len([ i for i in a if i == b])
a = [ c if b == i else i for i in a ]
atol += (c - b) * count
print(atol)
| n = eval(input())
a = [int(i) for i in input().split()]
q = int(eval(input()))
bb = []
cc = []
for i in range(q):
btmp, ctmp = [int(j) for j in input().split()]
bb.append(btmp)
cc.append(ctmp)
amap = {}
for i in a :
if i not in amap :
amap[i] = 1
else:
amap[i] += 1
atol = sum(a)
for b,c in zip(bb,cc):
if b in amap:
atol += (c - b) * amap[b]
if c in amap :
amap[c] += amap[b]
else:
amap[c] = amap[b]
amap.pop(b)
print(atol)
| p02630 |
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode
INF = float("inf")
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col,reverse_flag):
data.sort(key=lambda x:x[col],reverse=reverse_flag)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def mycount(ls,x):
# lsはソート済みであること
l = bisect_left(ls,x)
r = bisect_right(ls,x)
return (r-l)
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print((" ".join(ls)))
elif type(ls[0])==int:
print((" ".join(map(str,ls))))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print(("".join(ls)))
elif type(ls[0])==int:
print(("".join(map(str,ls))))
else:
print("Output Error")
def I():
return int(eval(input()))
def MI():
return list(map(int,input().split()))
def RI():
return list(map(int,input().split()))
def CI(n):
return [ int(eval(input())) for _ in range(n) ]
def LI(n):
return [ list(map(int,input().split())) for _ in range(n) ]
def S():
return eval(input())
def MS():
return input().split()
def RS():
return list(input().split())
def CS(n):
return [ eval(input()) for _ in range(n) ]
def LS(n):
return [ list(input().split()) for _ in range(n) ]
n = I()
a = RI()
q = I()
bc = LI(q)
for i in range(q):
b = bc[i][0]
c = bc[i][1]
a = [ c if i==b else i for i in a ]
s = sum(a)
print(s) | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode
INF = float("inf")
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col,reverse_flag):
data.sort(key=lambda x:x[col],reverse=reverse_flag)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def mycount(ls,x):
# lsはソート済みであること
l = bisect_left(ls,x)
r = bisect_right(ls,x)
return (r-l)
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print((" ".join(ls)))
elif type(ls[0])==int:
print((" ".join(map(str,ls))))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print(("".join(ls)))
elif type(ls[0])==int:
print(("".join(map(str,ls))))
else:
print("Output Error")
def I():
return int(eval(input()))
def MI():
return list(map(int,input().split()))
def RI():
return list(map(int,input().split()))
def CI(n):
return [ int(eval(input())) for _ in range(n) ]
def LI(n):
return [ list(map(int,input().split())) for _ in range(n) ]
def S():
return eval(input())
def MS():
return input().split()
def RS():
return list(input().split())
def CS(n):
return [ eval(input()) for _ in range(n) ]
def LS(n):
return [ list(input().split()) for _ in range(n) ]
n = I()
a = RI()
q = I()
bc = LI(q)
s = sum(a)
d = defaultdict(int)
for i in range(n):
d[ a[i] ] += 1
# print(d)
for i in range(q):
b = bc[i][0]
c = bc[i][1]
s += (c-b)*d[b]
d[c] += d[b]
d[b] = 0
# print(d)
print(s) | p02630 |
from collections import defaultdict
d = defaultdict(int)
n = int(eval(input()))
a = [int(i) for i in input().split(" ")]
q = int(eval(input()))
operations = []
for i in range(q):
temp = input().split(" ")
operations.append((int(temp[0]), int(temp[1])))
# n = 5
# a = [1, 2, 3, 4, 5]
# q = 3
# operations = [
# (1, 2),
# (2, 3),
# (3, 4)
# ]
for hoge in a:
d[hoge] += 1
for op in operations:
target, goto = op
d[goto] += d[target]
try:
del d[target]
sum = 0
for key, value in list(d.items()):
sum += key * value
print(sum)
except:
sum = 0
for key, value in list(d.items()):
sum += key * value
print(sum)
| from collections import defaultdict
d = defaultdict(int)
n = int(eval(input()))
a = [int(i) for i in input().split(" ")]
q = int(eval(input()))
operations = []
for i in range(q):
temp = input().split(" ")
operations.append((int(temp[0]), int(temp[1])))
for hoge in a:
d[hoge] += 1
initial_sum = 0
for key, value in list(d.items()):
initial_sum += key * value
for op in operations:
target, goto = op
before = goto * d[goto] + target * d[target]
d[goto] += d[target]
d[target] = 0
after = goto * d[goto]
diff = after - before
initial_sum += diff
print(initial_sum)
| p02630 |
from collections import Counter
N = int(eval(input()))
A = Counter(list(map(int, input().split())))
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
if B in list(A.keys()):
if C in list(A.keys()):
A[C] += A[B]
else:
A[C] = A[B]
A[B] = 0
ans = 0
for k, v in list(A.items()):
ans += k*v
print(ans) | from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split()))
A = Counter(a)
Q = int(eval(input()))
ans = sum(a)
for _ in range(Q):
B, C = list(map(int, input().split()))
if B in list(A.keys()):
if C in list(A.keys()):
A[C] += A[B]
else:
A[C] = A[B]
ans += (C-B)*A[B]
A[B] = 0
print(ans) | p02630 |
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
B=[]
for i in range(Q):
B.append(list(map(int,input().split())))
sum=int(0)
AA=[int(0)]
for i in range(100000):
AA.append(int(0))
for i in range(100001):
AA[i]=A.count(int(i))
#for i in range(5):
# print(AA[i])
sum=int(0)
for i in range(N):
sum += A[i]
for i in range(Q):
sum = sum + B[i][1]*AA[(B[i][0])]-B[i][0]*AA[(B[i][0])]
AA[(B[i][1])] = AA[(B[i][1])]+AA[(B[i][0])]
AA[(B[i][0])] = 0
print(sum)
| N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
B=[]
for i in range(Q):
B.append(list(map(int,input().split())))
sum=int(0)
AA=[int(0)]
for i in range(100000):
AA.append(int(0))
for i in A:
AA[i]+=1 #A.count(int(i))
#for i in range(5):
# print(AA[i])
sum=int(0)
for i in range(N):
sum += A[i]
for i in range(Q):
# AA[(B[i][0])]=A.count(int((B[i][0])))
# A.replace(B[i][0],B[i][1])
# AA[(B[i][1])]=A.count(int((B[i][1])))
sum = sum + B[i][1]*AA[(B[i][0])]-B[i][0]*AA[(B[i][0])]
AA[(B[i][1])] = AA[(B[i][1])]+AA[(B[i][0])]
AA[(B[i][0])] = 0
print(sum)
| p02630 |
#import numpy as np
from collections import Counter
from time import time
import sys
readline = sys.stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
#A = np.random.randint(1, 10 ** 5 + 1, 10 ** 5)
S = sum(A)
C = Counter(A)
Q = int(eval(input()))
#Q = 10 ** 5
ans = []
s = time()
for _ in range(Q):
b, c = list(map(int, input().split()))
#b, c = np.random.randint(1, 10 ** 5 + 1, 2)
#b, c = 2, 5
count = C[b]
S = S + (c - b) * count
C[c] += count
C[b] = 0
ans.append(S)
print(('\n'.join(map(str, ans))))
#print('time: ', time() - s) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
S = sum(A)
C = Counter(A)
ans = []
for _ in range(Q):
b, c = list(map(int, input().split()))
count = C[b]
S += (c - b) * count
C[b], C[c] = 0, C[c] + count
ans.append(S)
print(('\n'.join(map(str, ans)))) | p02630 |
def _print_sum(cache):
sum_value = 0
for v, indices in list(cache.items()):
sum_value += v * len(indices)
print(sum_value)
def _main(N, A_list, Q, BC_list):
cache = {}
values = set()
for i, a in enumerate(A_list):
cache.setdefault(a, []).append(i)
values.add(a)
for b, c in BC_list:
indices = cache.get(b, [])
cache[b] = []
cache.setdefault(c, []).extend(indices)
_print_sum(cache)
def _entry():
N = int(eval(input()))
A_list = list(map(int, input().split()))
Q = int(eval(input()))
BC_list = []
for i in range(Q):
B, C = list(map(int, input().split()))
BC_list.append((B, C))
_main(N, A_list, Q, BC_list)
if __name__ == "__main__":
_entry()
| def _calc_sum(cache):
sum_value = 0
for v, indices in list(cache.items()):
sum_value += v * len(indices)
return sum_value
def _main(N, A_list, Q, BC_list):
cache = {}
for i, a in enumerate(A_list):
cache.setdefault(a, []).append(i)
sum_value = _calc_sum(cache)
for b, c in BC_list:
indices = cache.get(b, [])
cache[b] = []
sum_value -= b * len(indices)
cache.setdefault(c, []).extend(indices)
sum_value += c * len(indices)
print(sum_value)
def _entry():
N = int(eval(input()))
A_list = list(map(int, input().split()))
Q = int(eval(input()))
BC_list = []
for i in range(Q):
B, C = list(map(int, input().split()))
BC_list.append((B, C))
_main(N, A_list, Q, BC_list)
if __name__ == "__main__":
_entry()
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
if a.count(b):
l = a.index(b)
r = n - a[::-1].index(b)
for i in range(l, r):
if a[i] == b:
a[i] = c
print((sum(a)))
| n = int(eval(input()))
a = list(map(int,input().split()))
d = dict()
for i in a:
if i in d:
d[i] += 1
else:
d[i] = 1
s = sum(a)
for _ in range(int(eval(input()))):
b, c = list(map(int, input().split()))
if b in d:
s += ((c - b) * d[b])
if c in d:
d[c] += d[b]
else:
d[c] = d[b]
d[b] = 0
print(s) | p02630 |
def main():
N=int(eval(input()))
l=[0]*10**5
A=list(map(int, input().split()))
for a in A:
l[a-1]+=a
Q=int(eval(input()))
BC=[list(map(int,input().split())) for _ in range(Q)]
for bc in BC:
cnt=l[bc[0]-1]//bc[0]
l[bc[0]-1]=0
l[bc[1]-1]+=bc[1]*cnt
print((sum(l)))
return
if __name__=='__main__':
main()
| def main():
N=int(eval(input()))
l=[0]*10**5
sm=0
A=list(map(int, input().split()))
for a in A:
l[a-1]+=1
sm+=a
Q=int(eval(input()))
BC=[list(map(int,input().split())) for _ in range(Q)]
for bc in BC:
cnt=l[bc[0]-1]
l[bc[0]-1]=0
l[bc[1]-1]+=cnt
sm=sm-bc[0]*cnt+bc[1]*cnt
print(sm)
return
if __name__=='__main__':
main()
| p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
count = Counter(a)
q = int(eval(input()))
b_c = [list(map(int, input().split())) for i in range(q)]
for i in b_c:
count[i[1]] += count[i[0]]
count[i[0]] = 0
ans = 0
for k, v in list(count.items()):
ans += k * v
print(ans) | from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
s = sum(a)
count = Counter(a)
q = int(eval(input()))
b_c = [list(map(int, input().split())) for i in range(q)]
for i in b_c:
s += (i[1] - i[0]) * count[i[0]]
count[i[1]] += count[i[0]]
count[i[0]] = 0
print(s) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for _ in range(Q)]
index_A = { a: 0 for a in set(A) }
for a in A:
index_A[a] += 1
for bc in BC:
if bc[0] in index_A:
if bc[1] not in index_A:
index_A[bc[1]] = 0
index_A[bc[1]] += index_A[bc[0]]
index_A[bc[0]] = 0
print((sum([i[0]*i[1] for i in list(index_A.items())])))
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for _ in range(Q)]
indexA = {}
for a in A:
if a not in indexA:
indexA[a] = 0
indexA[a] += 1
sumA = sum(A)
for (b,c) in BC:
if b in indexA:
sumA += (c-b) * indexA[b]
if c not in indexA:
indexA[c] = 0
indexA[c] += indexA[b]
indexA[b] = 0
print(sumA)
| p02630 |
from collections import Counter
n = eval(input())
N = int(n)
A = [int(a) for a in input().split()]
q = eval(input())
Q = int(q)
B, C = [], []
for i in range(Q):
b, c = input().split()
B.append(int(b))
C.append(int(c))
my_dict = Counter(A)
def cals_sum(my_dict):
values = [ my_dict[key]*key for key in list(my_dict.keys()) if my_dict[key] != 0]
#for key in my_dict.keys():
# value = my_dict[key]
# sum += int(key) * int(value)
return sum(values)
for i in range(len(B)):
b = B[i]
c = C[i]
tmpb = my_dict[b]
my_dict[b] = 0
tmpc = my_dict[c]
my_dict[c] = tmpb + tmpc
print((cals_sum(my_dict)))
| from collections import Counter
n = eval(input())
N = int(n)
A = [int(a) for a in input().split()]
q = eval(input())
Q = int(q)
B, C = [], []
for i in range(Q):
b, c = input().split()
B.append(int(b))
C.append(int(c))
my_dict = Counter(A)
def cals_sum(my_dict):
values = [ my_dict[key]*key for key in list(my_dict.keys()) if my_dict[key] != 0]
#for key in my_dict.keys():
# value = my_dict[key]
# sum += int(key) * int(value)
return sum(values)
my_sum = cals_sum(my_dict)
for i in range(len(B)):
b = B[i]
c = C[i]
tmpb = my_dict[b]
my_dict[b] = 0
tmpc = my_dict[c]
my_dict[c] = tmpb + tmpc
my_sum += ((tmpb)*c - tmpb*b)
print(my_sum)
| p02630 |
import math
input_num = int(eval(input()))
input_numline = list(map(int,input().split(' ')))
q = int(eval(input()))
op_list = []
for i in range(q):
op_list.append(list(map(int,input().split(' '))))
maxnum = 100000
num_list = [0 for m in range(maxnum+1)]
for n in input_numline:
num_list[n] += 1
for o in op_list:
num_list[o[1]] += num_list[o[0]]
num_list[o[0]] = 0
ans = 0
for j in range(maxnum+1):
ans += j*num_list[j]
print(ans)
| import math
input_num = int(eval(input()))
input_numline = list(map(int,input().split(' ')))
q = int(eval(input()))
op_list = []
for i in range(q):
op_list.append(list(map(int,input().split(' '))))
maxnum = 100000
num_list = [0 for m in range(maxnum+1)]
for n in input_numline:
num_list[n] += 1
ans = 0
for j in range(maxnum+1):
ans += j*num_list[j]
for o in op_list:
ans -= o[0]*num_list[o[0]]
ans += o[1]*num_list[o[0]]
num_list[o[1]] += num_list[o[0]]
num_list[o[0]] = 0
print(ans)
| p02630 |
def csum(c):
r = 0
for index, item in enumerate(c):
r += index * item
return r
n = int(eval(input()))
l= list(map(int,input().split()))
c = [0] * 100001
for i in l:
c[i] += 1
n = int(eval(input()))
for i in range(0, n):
be,af = list(map(int,input().split()))
c[af] += c[be]
c[be] = 0
print((csum(c))) | N = int(eval(input()))
A= list(map(int,input().split()))
Q = int(eval(input()))
heavy = [0] * (10 ** 5 + 1)
for i in A:
heavy[i] += 1
s = sum(A)
for i in range(Q):
be,af = list(map(int,input().split()))
s -= be * heavy[be]
s += af * heavy[be]
heavy[af] += heavy[be]
heavy[be] = 0
print(s) | p02630 |
n = int(eval(input()))
num = list(map(int, input().split()))
q = int(eval(input()))
change = [0 for i in range(q)]
for i in range(q):
change[i] = list(map(int, input().split()))
dic = {}
for i in num:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
for i in range(len(change)):
ans = 0
if change[i][0] in dic:
if change[i][1] in dic:
dic[change[i][1]] += dic.pop(change[i][0])
else:
dic[change[i][1]] = dic.pop(change[i][0])
for i, j in enumerate(dic):
ans += j*dic[j]
print(ans) | n = int(eval(input()))
num = list(map(int, input().split()))
q = int(eval(input()))
change = [0 for i in range(q)]
for i in range(q):
change[i] = list(map(int, input().split()))
dic = {}
for i in num:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
ans = 0
for i, j in enumerate(dic):
ans += j*dic[j]
for i in range(q):
if change[i][0] in dic:
ans += dic[change[i][0]] * (change[i][1] - change[i][0])
if change[i][1] in dic:
dic[change[i][1]] += dic.pop(change[i][0])
else:
dic[change[i][1]] = dic.pop(change[i][0])
print(ans) | p02630 |
data = {}
N = int(eval(input()))
for a in input().split():
a = int(a)
data[a] = data.get(a, 0) + 1
Q = int(eval(input()))
for _ in range(Q):
b, c = list(map(int, input().split()))
if data.get(b):
data[c] = data.get(c, 0) + data.pop(b)
print((sum([k * v for k, v in list(data.items())]))) | data = {}
total = 0
N = int(eval(input()))
for a in input().split():
a = int(a)
data[a] = data.get(a, 0) + 1
total += a
Q = int(eval(input()))
for _ in range(Q):
b, c = list(map(int, input().split()))
diff = c - b
count = data.get(b)
if count:
data[c] = data.get(c, 0) + data.pop(b)
total += diff * count
print(total) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
# 値がiであるようなA_iの個数を格納する
val_count = [0] * (10 ** 5 + 1)
total_A = 0
for a in A:
total_A += a
val_count[a] += 1
S = []
for i in range(Q):
B, C = list(map(int, input().split()))
# cur_S = total_A
B_count = val_count[B]
# cur_S -= B * B_count
# cur_S += C * B_count
total_A -= B * B_count
total_A += C * B_count
# S.append(cur_S)
S.append(total_A)
val_count[B] = 0
val_count[C] += B_count
for s in S:
print(s)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
# 値がiであるようなA_iの個数を格納する
val_count = [0] * (10 ** 5 + 1)
total_A = 0
for a in A:
total_A += a
val_count[a] += 1
S = []
for i in range(Q):
B, C = list(map(int, input().split()))
B_count = val_count[B]
total_A -= B * B_count
total_A += C * B_count
S.append(total_A)
val_count[B] = 0
val_count[C] += B_count
for s in S:
print(s)
| p02630 |
import sys
import re
input = sys.stdin.readline
if __name__ == '__main__':
n=int(eval(input()))
#A=list(map(int,input().strip("\n").split()))
A=input().strip("\n")
q=int(eval(input()))
b,c=input().strip("\n").split()
A=A.replace(b,c).replace(" ","+")
ans=''
ans+=str(eval(A))
ans+="\n"
for _ in range(1,q-1):
#b,c=map(int,input().strip("\n").split())
b,c=input().strip("\n").split()
A=A.replace(b,c)
ans+=str(eval(A))
ans+="\n"
b,c=input().strip("\n").split()
A=A.replace(b,c)
ans+=str(eval(A))
print(ans)
| import sys
input = sys.stdin.readline
if __name__ == '__main__':
n=int(eval(input()))
A_str=input().strip("\n")
A=A_str.split()
q=int(eval(input()))
C={}
for a in A:
if a in C:
C[a]+=1
else:
C[a]=1
def rep(b,c):
if c in C:
C[c]+=C[b]
else:
C[c]=C[b]
C[b]=0
#print(b,c,C)
Ans=[]
ans=''
b,c=input().strip("\n").split()
#tmp=eval(A_str.replace(b,c).replace(" ","+"))
tmp=0
hoge=list(map(int,A))
for a in hoge:
if str(a)==b:
tmp+=int(c)
else:
tmp+=a
#ans+=str(tmp)
#ans+="\n"
Ans.append(tmp)
if b in C:
rep(b,c)
for i in range(1,q-1):
b,c=input().strip("\n").split()
if b in C:
tmp+=(int(c)-int(b))*C[b]
rep(b,c)
#ans+=str(tmp)+"\n"
Ans.append(tmp)
b,c=input().strip("\n").split()
if b in C:
tmp+=(int(c)-int(b))*C[b]
#ans+=str(tmp)
Ans.append(tmp)
#print(ans)
for ans in Ans:
print(ans)
| p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
bc = [list(map(int,input().split())) for _ in range(q)]
N=[0]*(10**5+1)
for i in a:
N[i]+=1
for b,c in bc:
N[c] += N[b]
N[b] = 0
print((sum([i*x for i,x in enumerate(N) if x != 0])))
| n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
bc = [list(map(int,input().split())) for _ in range(q)]
N=[0]*(10**5+1)
for i in a:
N[i]+=1
ans = 0
for i,x in enumerate(N):
if x != 0:
ans += i*x #初期値
for b,c in bc:
ans += (c-b)*N[b]
N[c] += N[b]
N[b] = 0
print(ans)
| p02630 |
import collections
n = int(input())
a = list(map(int, input().split()))
ac = collections.Counter(a)
q = int(input())
ans = []
for i in range(q):
b, c = map(int, input().split())
tmp = ac[b]
del ac[b]
ac[c]+= tmp
ans.append(sum(num*size for num, size in ac.items()))
[print(total) for total in ans]
| import collections
n = int(input())
a = list(map(int, input().split()))
a_sum = sum(a)
ac = collections.Counter(a)
q = int(input())
ans = []
for i in range(q):
b, c = map(int, input().split())
b_num = ac[b]
before = b * b_num
after = c * (b_num)
a_sum = a_sum - before + after
ans.append(a_sum)
tmp = ac[b]
del ac[b]
ac[c]+= tmp
[print(total) for total in ans]
| p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
sum_res = sum(A)
counter = [0 for _ in range(10 ** 5 + 1)]
for a in A:
counter[a] += 1
for _ in range(Q):
B, C = list(map(int, input().split()))
sum_res = sum_res - (counter[B] * B)
sum_res = sum_res + (counter[B] * C)
counter[C] += counter[B]
counter[B] = 0
print(sum_res)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
sum_res = sum(A)
counter = [0 for _ in range(10 ** 5 + 1)]
for a in A:
counter[a] += 1
for _ in range(Q):
B, C = list(map(int, input().split()))
sum_res += (C - B) * counter[B]
counter[C] += counter[B]
counter[B] = 0
print(sum_res)
| p02630 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: D_fix
# CreatedDate: 2020-06-21 22:17:03 +0900
# LastModified: 2020-06-21 22:25:13 +0900
#
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*100001
for s in a:
cnt[s]+=1
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
spare = cnt[b]
cnt[b] = 0
cnt[c] += spare
print((sum(i*cnt[i] for i in range(len(cnt)))))
if __name__ == "__main__":
main()
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: D_fix_2
# CreatedDate: 2020-06-22 17:32:46 +0900
# LastModified: 2020-06-22 17:39:47 +0900
#
import os
import sys
#import numpy as np
#import pandas as pd
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*100001
for a_ in a:
cnt[a_] += 1
total = sum(a)
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
total += (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(total)
if __name__ == "__main__":
main()
| p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
change_pair = []
for i in range(Q):
b, c = list(map(int, input().split()))
change_pair.append((b, c))
# Aの出現値毎に回数をカウント
counts = {}
for a in A:
if a in counts:
counts[a] += 1
else:
counts[a] = 1
# 置き換え毎に回数を移動
for b, c in change_pair:
if b in counts:
count = counts[b]
counts[b] = 0
else:
count = 0
if c in counts:
counts[c] += count
else:
counts[c] = count
# 総和を求める
total = 0
for a, count in list(counts.items()):
total += a * count
print(total)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
change_pair = []
for i in range(Q):
b, c = list(map(int, input().split()))
change_pair.append((b, c))
# Aの出現値毎に回数をカウント
counts = {}
total = 0
for a in A:
if a in counts:
counts[a] += 1
else:
counts[a] = 1
total += a
# 置き換え毎に回数を移動
for b, c in change_pair:
if b in counts:
count = counts[b]
counts[b] = 0
total -= b * count
else:
count = 0
if c in counts:
counts[c] += count
else:
counts[c] = count
total += c * count
print(total)
| p02630 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
s = 0
l = {i:0 for i in range(1,100001)}
for num in A:
l[num] += 1
s += num
for _ in range(Q):
B, C = list(map(int, input().split()))
num_of_before = l[B]
l[C] += num_of_before
s = s + num_of_before * (C-B)
print(s)
l[B] = 0
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
s = 0
l = {i:0 for i in range(1,100001)}
A.sort()
for num in A:
l[num] += 1
s += num
for _ in range(Q):
B, C = list(map(int, input().split()))
num_of_before = l[B]
l[C] += num_of_before
s = s + num_of_before * (C-B)
print(s)
l[B] = 0
if __name__ == '__main__':
main()
| p02630 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
s = 0
l = {i:0 for i in range(1,100001)}
s = sum(A)
for num in A:
l[num] += 1
for _ in range(Q):
B, C = list(map(int, input().split()))
num_of_before = l[B]
l[C] += num_of_before
s = s + num_of_before * (C-B)
print(s)
l[B] = 0
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
l = {i:0 for i in range(1,100001)}
for num in A:
l[num] += 1
s = sum(A)
for _ in range(Q):
B, C = list(map(int, input().split()))
num_of_before = l[B]
l[C] += num_of_before
s = s + num_of_before * (C-B)
l[B] = 0
print(s)
if __name__ == '__main__':
main()
| p02630 |
n=int(eval(input()))
l=list(map(int,input().split()))
q=int(eval(input()))
dic=dict()
list_sum=sum(l)
for i in range(len(l)):
if(l[i] not in list(dic.keys())):
dic[l[i]]=1
else:
dic[l[i]]+=1
# print(dic)
for i in range(q):
s=0
b,c=list(map(int,input().split()))
if(b in dic and dic[b]!=0):
# s=(c-b)*dic[b]+list_sum
if(c in dic):
dic[c]+=dic[b]
dic[b]=0
else:
dic[c]=dic[b]
dic[b]=0
for x in dic:
if(dic[x]!=0):
s+=x*dic[x]
print(s)
| n=int(eval(input()))
l=list(map(int,input().split()))
q=int(eval(input()))
dic=dict()
list_sum=sum(l)
for i in range(len(l)):
if(l[i] not in list(dic.keys())):
dic[l[i]]=1
else:
dic[l[i]]+=1
# print(dic)
s=list_sum
for i in range(q):
b,c=list(map(int,input().split()))
# print(dic)
if(b in dic and dic[b]!=0):
s+=(c-b)*dic[b]
if(c in dic):
dic[c]+=dic[b]
dic[b]=0
else:
dic[c]=dic[b]
dic[b]=0
print(s)
# print(dic)
| p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
import collections
a = collections.Counter(a)
for i in range(q):
b,c = list(map(int,input().split()))
d = a[b]
a[b] = 0
a[c] += d
print((sum([key*value for key,value in list(a.items())]))) | n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
import collections
ans = sum(a)
a = collections.Counter(a)
for i in range(q):
b,c = list(map(int,input().split()))
d = a[b]
ans -= d*b
a[b] = 0
ans += d*c
a[c] += d
print(ans) | p02630 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
d=collections.Counter(A)
for i in range(Q):
B,C=list(map(int,input().split()))
if d[C] in d:
d[C]+=d[B]
else:
d[C]=d[B]
d[B]=0
ans=0
for j in d:
ans += j*d[j]
print(ans) | import collections
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=collections.Counter(A)
for i in range(Q):
B,C=list(map(int,input().split()))
s += d[B]*C - d[B]*B
print(s)
if C in d:
d[C]+=d[B]
else:
d[C]=d[B]
d[B]=0 | p02630 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=collections.Counter(A)
for i in range(Q):
B,C=list(map(int,input().split()))
s += d[B]*C - d[B]*B
print(s)
if C in d:
d[C]+=d[B]
else:
d[C]=d[B]
d[B]=0 | N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
print(s)
d[C]+=d[B]
d[B]=0 | p02630 |
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
print(s)
d[C]+=d[B]
d[B]=0 | def main():
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
print(s)
d[C]+=d[B]
d[B]=0
if __name__ == "__main__":
main() | p02630 |
def main():
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
ans=[]
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
ans.append(s)
d[C]+=d[B]
d[B]=0
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main() | def main():
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
ans=[]
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
ans.append(s)
d[C]+=d[B]
d[B]=0
print(("\n".join(map(str, ans))))
#BC入力ごとに出力するよりまとめて出力した方が倍くらい早い
if __name__ == "__main__":
main() | p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = [list(map(int, input().split())) for _ in range(Q)]
A_counter = Counter(A)
for b in B:
cnt = A_counter[b[0]]
A_counter[b[1]] += cnt
del A_counter[b[0]]
print((sum([num * cnt for num, cnt in list(A_counter.items())])))
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = [list(map(int, input().split())) for _ in range(Q)]
res = sum(A)
A_counter = Counter(A)
for i, j in B:
if i not in A_counter:
A_counter[i] = 0
if j not in A_counter:
A_counter[j] = 0
res += (j - i) * A_counter[i]
print(res)
A_counter[j] += A_counter[i]
A_counter[i] = 0
| p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = [list(map(int, input().split())) for _ in range(Q)]
res = sum(A)
A_counter = Counter(A)
for i, j in B:
if i not in A_counter:
A_counter[i] = 0
if j not in A_counter:
A_counter[j] = 0
res += (j - i) * A_counter[i]
print(res)
A_counter[j] += A_counter[i]
A_counter[i] = 0
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = [list(map(int, input().split())) for _ in range(Q)]
res = sum(A)
A_counter = Counter(A)
for i, j in B:
# if i not in A_counter:
# A_counter[i] = 0
# if j not in A_counter:
# A_counter[j] = 0
res += (j - i) * A_counter[i]
print(res)
A_counter[j] += A_counter[i]
A_counter[i] = 0
| p02630 |
from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt_a = Counter(a)
q = int(eval(input()))
s = [sum(a)] + [0] * q
for i in range(q):
b, c = list(map(int, input().split()))
bn = cnt_a[b]
s[i + 1] = s[i] + (c - b)*bn
cnt_a[b] = 0
cnt_a[c] += bn
print((s[i + 1])) | from collections import Counter
n = int(input())
a = [int(i) for i in input().split()]
cnt_a = Counter(a)
q = int(input())
s = [sum(a)] + [0] * q
for i in range(q):
b, c = map(int, input().split())
bn = cnt_a[b]
s[i + 1] = s[i] + (c - b)*bn
cnt_a[b] = 0
cnt_a[c] += bn
print(*s[1:], sep='\n')
| p02630 |
from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt_a = Counter(a)
q = int(eval(input()))
s = sum(a)
for i in range(q):
b, c = list(map(int, input().split()))
s += (c - b)*cnt_a[b]
print(s)
cnt_a[b], cnt_a[c] = 0, cnt_a[c] + cnt_a[b] | from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt = Counter(a)
q = int(eval(input()))
s = sum(a)
for i in range(q):
b, c = list(map(int, input().split()))
s += (c - b)*cnt[b]
print(s)
cnt[b], cnt[c] = 0, cnt[c] + cnt[b] | p02630 |
from collections import Counter
n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt = Counter(a)
q = int(eval(input()))
s = sum(a)
for i in range(q):
b, c = list(map(int, input().split()))
s += (c - b)*cnt[b]
print(s)
cnt[b], cnt[c] = 0, cnt[c] + cnt[b] | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
cnt = Counter(a)
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
cnt_b = cnt[b]
cnt[b], cnt[c] = 0, cnt[c] + cnt_b
s += (c - b)*cnt_b
print(s) | p02630 |
s=set()
l = [0] * ( 10 ** 5 + 1 )
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(len(A)):
l[A[i]] += 1
s.add(A[i])
Q = int(eval(input()))
for i in range(Q):
B, C = list(map(int, input().split()))
if l[B] > 0:
s.add(C)
l[C] += l[B]
l[B] = 0
s.discard(B)
sum=0
for i in s:
sum += i * l[i]
print(sum)
| s=set()
l = [0] * ( 10 ** 5 + 1 )
sum=0
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(len(A)):
l[A[i]] += 1
s.add(A[i])
sum += A[i]
Q = int(eval(input()))
for i in range(Q):
B, C = list(map(int, input().split()))
if l[B] > 0:
s.add(C)
sum = sum + l[B] * ( C - B )
l[C] += l[B]
l[B] = 0
s.discard(B)
print(sum)
| p02630 |
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
trans=[[] for _ in range(Q)]
for i in range(Q):
B,C=list(map(int,input().split()))
trans[i].append(B)
trans[i].append(C)
S=0
#まずはじめの合計求める
num=[0]
#これに数の出現回数をプロットする
for i in range(1,10**5+1):
cnt=A.count(i)
num.append(cnt)
if cnt!=0:
S+=cnt*i
for i in range(Q):
B=trans[i][0]
C=trans[i][1]
change=num[B]*(C-B)
num[C]+=num[B]
num[B]-=num[B]
S+=change
print(S) | N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
BC = []
for i in range(Q):
BC.append(list(map(int,input().split())))
num = [0]*(10**5+1)
S = []
#1 iterlation
S.append(sum(A))
for i in range(N):
num[A[i]]+=1
for j in range(Q):
if num[BC[j][0]] != 0:
#Bに当たる交換するものがある時
B = BC[j][0]
C = BC[j][1]
S.append(S[-1] + (C - B)*num[B] )
#S[-1]で合計の一番最新のもの
dammy = num[B]
num[B] = 0
num[C] += dammy
else:
B = BC[j][0]
C = BC[j][1]
S.append(S[-1])
for i in range(1,Q+1):
print((S[i])) | p02630 |
n= int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = [list(map(int,input().split())) for i in range(q)]
num = [0]*(10**5+1)
for i in a:
num[i] = a.count(i)
sum_a = sum(a)
for i in range(q):
dif = b[i][1]-b[i][0]
#print(dif)
sum_a += dif*num[b[i][0]]
num[b[i][1]] += num[b[i][0]]
num[b[i][0]] = 0
print(sum_a) | n= int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = [list(map(int,input().split())) for i in range(q)]
num = [0]*(10**5+1)
for i in a:
num[i] += 1
sum_a = sum(a)
for i in range(q):
dif = b[i][1]-b[i][0]
#print(dif)
sum_a += dif*num[b[i][0]]
num[b[i][1]] += num[b[i][0]]
num[b[i][0]] = 0
print(sum_a) | p02630 |
import collections
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
a_dict = collections.Counter(a)
a_dict = {key: key*value for key, value in list(a_dict.items())}
for _ in range(q):
b, c = list(map(int, input().split()))
if b in a_dict:
if c in a_dict:
a_dict[c] += (a_dict.pop(b)//b) * c
else:
a_dict[c] = (a_dict.pop(b)//b) * c
print((sum(a_dict.values())))
if __name__ == '__main__':
main()
| import collections
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
a_dict = collections.Counter(a)
a_dict = {key: key*value for key, value in list(a_dict.items())}
answer = sum(a_dict.values())
for _ in range(q):
b, c = list(map(int, input().split()))
diff = 0
if b in a_dict:
b_sum = a_dict.pop(b)
c_add = b_sum//b * c
diff = c_add - b_sum
if c in a_dict:
a_dict[c] += c_add
else:
a_dict[c] = c_add
answer += diff
print(answer)
if __name__ == '__main__':
main()
| p02630 |
def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
count = [0 for _ in range(10**5)]
for i in range(n):
count[a[i] - 1] += 1
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
count[c - 1] += count[b - 1]
count[b - 1] = 0
total = 0
for i in range(10**5):
if count[i] == 0:
continue
total += count[i] * (i + 1)
print(total)
if 'unittest' not in globals():
resolve() | def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
total = 0
count = [0 for _ in range(10**5)]
for i in range(n):
count[a[i] - 1] += 1
total += a[i]
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
count_b = count[b - 1]
count[b - 1] = 0
count[c - 1] += count_b
total -= count_b * (b - c)
print(total)
if 'unittest' not in globals():
resolve() | p02630 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
M=collections.Counter(A)
for i in range(Q):
B,C=list(map(int,input().split()))
M[C]+=M[B]
M[B]=0
ans=0
for j in list(M.items()):
ans+=j[0]*j[1]
print(ans) | import collections
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
M=collections.Counter(A)
ans=0
for j in list(M.items()):
ans+=j[0]*j[1]
for i in range(Q):
B,C=list(map(int,input().split()))
ans+=(C-B)*M[B]
M[C]+=M[B]
M[B]=0
print(ans) | p02630 |
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
B = []
C = []
for i in range(Q):
b,c = list(map(int,input().split()))
B.append(b)
C.append(c)
S = sum(A)
NUM = [0]
for j in range(1,100005):
num_j = A.count(j)
NUM.append(num_j)
for k in range(Q):
S += (C[k]-B[k]) * (NUM[B[k]])
NUM[C[k]] += NUM[B[k]]
NUM[B[k]] = 0
print(S) | N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
B = []
C = []
for i in range(Q):
b,c = list(map(int,input().split()))
B.append(b)
C.append(c)
S = sum(A)
NUM = [0] * 100005
for a in A:
NUM[a] += 1
for k in range(Q):
S += (C[k]-B[k]) * (NUM[B[k]])
NUM[C[k]] += NUM[B[k]]
NUM[B[k]] = 0
print(S)
| p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
bucket = [0]*100001
for i in range(100000):
bucket[i] = A.count(i)
sum = sum(A)
for i in range(Q):
b, c = list(map(int, input().split()))
sum += (c - b) * bucket[b]
bucket[c] += bucket[b]
bucket[b] = 0
print(sum) | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B, C = [0]*Q, [0]*Q
for i in range(Q):
B[i], C[i] = list(map(int, input().split()))
bucket = [0]*100001
for i in A:
bucket[i] += 1
sum = sum(A)
for i in range(Q):
sum += (C[i] - B[i]) * bucket[B[i]]
bucket[C[i]] += bucket[B[i]]
bucket[B[i]] = 0
print(sum) | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
dic={}
for i in range(n):
if a[i] in dic:
dic[a[i]]+=1
else:
dic[a[i]]=1
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
if b in dic:
if c in dic:
dic[c]+=dic[b]
del dic[b]
else:
dic[c]=dic[b]
del dic[b]
ans=0
for key,value in list(dic.items()):
ans+=key*value
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
dic={}
for i in range(n):
if a[i] in dic:
dic[a[i]]+=1
else:
dic[a[i]]=1
q=int(eval(input()))
ans=0
for key,value in list(dic.items()):
ans+=key*value
for i in range(q):
b,c=list(map(int,input().split()))
if b in dic:
if c in dic:
dic[c]+=dic[b]
ans+=dic[b]*(c-b)
del dic[b]
else:
dic[c]=dic[b]
ans+=dic[b]*(c-b)
del dic[b]
print(ans) | p02630 |
n=int(eval(input()))
l=[0]*10**5
A=list(map(int,input().split()))
for a in A:
l[a-1]+=1
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
tmp=l[b-1]
l[b-1]=0
l[c-1]+=tmp
ans=0
for j in range(10**5):
ans+=l[j]*(j+1)
print(ans) | n=int(eval(input()))
l=[0]*10**5
A=list(map(int,input().split()))
for a in A:
l[a-1]+=1
ans=sum(A)
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
tmp=l[b-1]
l[b-1]=0
l[c-1]+=tmp
ans+=tmp*(c-b)
print(ans) | p02630 |
from collections import Counter
N = int(eval(input()))
A = [int(x) for x in input().split()]
d = Counter(A)
Q = int(eval(input()))
def sum_from_counter(d):
return sum([k * d[k] for k in d])
for i in range(Q):
B, C = [int(x) for x in input().split()]
d[C] = d.get(C, 0) + d[B]
del d[B]
print((sum_from_counter(d))) | from collections import Counter
N = int(eval(input()))
A = [int(x) for x in input().split()]
d = Counter(A)
Q = int(eval(input()))
def sum_from_counter(d):
return sum([k * d[k] for k in d])
s = sum([k * d[k] for k in d])
for i in range(Q):
B, C = [int(x) for x in input().split()]
d[C] = d.get(C, 0) + d[B]
s += (C - B) * d[B]
d[B] = 0
print(s) | p02630 |
s = int(eval(input()))
dict={}
num_list = list(map(int, input().split()))
length=len(num_list)
count=[0]*(s+1000)
for i in range(length):
count[num_list[i]]+=1
dict[num_list[i]]=count[num_list[i]]
#print(dict)
sum=0
count=0
n = int(eval(input()))
for i in range(n):
a,b = list(map(int, input().split()))
if dict.get(a)!=None:
if dict.get(b)!=None:
count=dict[b]
dict[b]=dict[a]+dict[b]
else:
dict[b]=dict[a]
dict[a]=0
else:
pass
#print(dict)
for k, v in list(dict.items()):
sum+=k*v
print(sum)
sum=0
| s = int(eval(input()))
dict={}
num_list = list(map(int, input().split()))
length=len(num_list)
count=[0]*(s+1000)
for i in range(length):
count[num_list[i]]+=1
dict[num_list[i]]=count[num_list[i]]
sum=0
#print(dict)
for k, v in list(dict.items()):
sum+=k*v
#print(dict)
#print(sum)
count=0
d=0
n = int(eval(input()))
for i in range(n):
a,b = list(map(int, input().split()))
if dict.get(a)!=None:
d=(b-a)*dict[a]
#print("d:{}".format(d))
if dict.get(b)!=None:
count=dict[b]
dict[b]=dict[a]+dict[b]
else:
dict[b]=dict[a]
dict[a]=0
sum+=d
#print(dict)
else:
pass
d=0
print(sum)
#print()
| p02630 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
D = defaultdict(int)
for a in A:
D[a] += 1
Q = int(eval(input()))
B = []
C = []
for _ in range(Q):
l = list(map(int, input().split()))
B.append(l[0])
C.append(l[1])
for i in range(Q):
k = D[B[i]]
D.pop(B[i])
D[C[i]] += k
ans = 0
for k, v in list(D.items()):
ans += k * v
print(ans) | from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
D = defaultdict(int)
for a in A:
D[a] += 1
Q = int(eval(input()))
B = []
C = []
for _ in range(Q):
l = list(map(int, input().split()))
B.append(l[0])
C.append(l[1])
ans = sum(A)
for i in range(Q):
k = D[B[i]]
D[B[i]] = 0
D[C[i]] += k
ans = ans - (B[i]*k) + (C[i]*k)
print(ans) | p02630 |
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
cnt = [0]*(10**5+7)
for i in range(n):
cnt[a[i]]+=1
ruiseki = sum(a)
for i in range(q):
b,c = list(map(int,input().split()))
d = cnt[b]
e = d*(c-b)
cnt[c] += d
cnt[b] -= d
ruiseki += e
print(ruiseki) | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
cnt = [0]*(10**5+7)
for i in range(n):
cnt[a[i]]+=1
p = sum(a)
for i in range(q):
b,c = list(map(int,input().split()))
d = cnt[b]
e = cnt[c]
diff = d*(c-b)
p += diff
cnt[c]+=d
cnt[b]-=d
print(p)
if __name__ == "__main__":
main() | p02630 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for i in range(Q)]
g = {}
for a in A:
if a not in g:
g[a] = 1
else:
g[a] += 1
for i in range(Q):
B, C = tuple(BC[i])
if B in g:
t = g.pop(B)
if C in g:
g[C] += t
else:
g[C] = t
ans = 0
for k, v in list(g.items()):
ans += k * v
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for i in range(Q)]
g = {}
ans = 0
for a in A:
ans += a
if a not in g:
g[a] = 1
else:
g[a] += 1
for i in range(Q):
B, C = tuple(BC[i])
if B in g:
t = g.pop(B)
ans += t * (C - B)
if C in g:
g[C] += t
else:
g[C] = t
print(ans)
if __name__ == "__main__":
main()
| p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
b=[]
c=[]
for _ in range(q):
x,y=list(map(int,input().split()))
b.append(x)
c.append(y)
d=[0]*100001
for i in a:
d[i]+=1
for m,p in zip(b,c):
minus=d[m]
d[m]=0
d[p]+=minus
ans=0
for i in range(len(d)):
ans+=i*d[i]
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
b=[]
c=[]
for _ in range(q):
x,y=list(map(int,input().split()))
b.append(x)
c.append(y)
d=[0]*100001
for i in a:
d[i]+=1
ans=sum(a)
for m,p in zip(b,c):
minus=d[m]
d[m]=0
d[p]+=minus
ans+=(p-m)*minus
print(ans)
| p02630 |
from collections import Counter
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N = int(input().strip())
A_list = [int(i) for i in input().strip().split()]
Q = int(input().strip())
_sum = sum(A_list)
num_count = Counter(A_list)
for _ in range(Q):
B, C = [int(i) for i in input().strip().split()]
if B in num_count:
if C in num_count:
num_count[C] = num_count[C] + num_count[B]
else:
num_count[C] = num_count[B]
del num_count[B]
_sum = 0
for k, v in list(num_count.items()):
_sum += k * v
print(_sum)
else:
print(_sum)
if __name__ == "__main__":
main()
| from collections import Counter
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N = int(input().strip())
A_list = [int(i) for i in input().strip().split()]
Q = int(input().strip())
_sum = sum(A_list)
num_count = Counter(A_list)
for _ in range(Q):
B, C = [int(i) for i in input().strip().split()]
if B in num_count:
if C in num_count:
num_count[C] = num_count[C] + num_count[B]
else:
num_count[C] = num_count[B]
_sum = _sum - (num_count[B] * B) + num_count[B] * C
del num_count[B]
print(_sum)
else:
print(_sum)
if __name__ == "__main__":
main() | p02630 |
def main():
N = int(input().strip())
A = [int(_a) for _a in input().strip().split()]
Q = int(input().strip())
BCS = []
for i in range(Q):
BCS.append([int(_bc) for _bc in input().strip().split()])
Amap = {}
for a in A:
if a not in Amap:
Amap[a] = 0
Amap[a] += 1
for bc in BCS:
b = bc[0]
c = bc[1]
if b in Amap:
num = Amap[b]
del Amap[b]
else:
num = 0
if c not in Amap:
Amap[c] = 0
Amap[c] += num
total = 0
for k,v in list(Amap.items()):
total += (k*v)
print(total)
main()
| def main():
N = int(input().strip())
A = [int(_a) for _a in input().strip().split()]
Q = int(input().strip())
BCS = []
for i in range(Q):
BCS.append([int(_bc) for _bc in input().strip().split()])
Amap = {}
for a in A:
if a not in Amap:
Amap[a] = 0
Amap[a] += 1
total = 0
for k,v in list(Amap.items()):
total += (k*v)
for bc in BCS:
b = bc[0]
c = bc[1]
if b in Amap:
num = Amap[b]
del Amap[b]
if c not in Amap:
Amap[c] = 0
Amap[c] += num
total = total + num*c - num*b
print(total)
main()
| p02630 |
import collections
b=[]
c=[]
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
d=collections.Counter(a)
for i in range(q):
x,y=list(map(int,input().split()))
b.append(x)
c.append(y)
for i in range(q):
tmp=d[b[i]]
d[b[i]]=0
d[c[i]]+=tmp
sum=0
for key,val in list(d.items()):
sum+=key*val
print(sum)
| import collections
b=[]
c=[]
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
d=collections.Counter(a)
for i in range(q):
x,y=list(map(int,input().split()))
b.append(x)
c.append(y)
sum=0
for i in range(n):
sum+=a[i]
for i in range(q):
tmp=d[b[i]]
d[b[i]]=0
d[c[i]]+=tmp
sum=sum-b[i]*tmp+tmp*c[i]
print(sum)
| p02630 |
n = int(eval(input()))
n_list = list(map(int, input().split()))
q = int(eval(input()))
n_dic = {}
for i in n_list:
n_dic.setdefault(i, 0)
n_dic[i] += 1
for i in range(q):
b, c = list(map(int, input().split()))
if b in n_dic:
n_dic.setdefault(c, 0)
n_dic[c] += n_dic[b]
del n_dic[b]
result = 0
for k in n_dic:
result += k * n_dic[k]
print(result)
| n = int(eval(input()))
n_list = list(map(int, input().split()))
q = int(eval(input()))
n_dic = {}
for i in n_list:
n_dic.setdefault(i, 0)
n_dic[i] += 1
result = 0
for k in n_dic:
result += k * n_dic[k]
for i in range(q):
b, c = list(map(int, input().split()))
if b in n_dic:
n_dic.setdefault(c, 0)
n_dic[c] += n_dic[b]
result = result + (c-b)*n_dic[b]
del n_dic[b]
print(result)
| p02630 |
import sys
input = sys.stdin.readline
# D - Replacing
def get_sum(dic):
sum = 0
for k, v in list(dic.items()):
sum += k * v
return sum
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
dic = dict()
for ai in a:
dic.setdefault(ai, 0)
dic[ai] += 1
for i in range(q):
b, c = list(map(int, input().split()))
count = dic.pop(b, 0)
if count > 0:
dic.setdefault(c, 0)
dic[c] += count
print((get_sum(dic))) | import sys
input = sys.stdin.readline
# D - Replacing
def get_sum(dic):
sum = 0
for k, v in list(dic.items()):
sum += k * v
return sum
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
dic = dict()
for ai in a:
dic.setdefault(ai, 0)
dic[ai] += 1
for i in range(q):
b, c = list(map(int, input().split()))
count = dic.pop(b, 0)
if count > 0:
dic.setdefault(c, 0)
dic[c] += count
if i == 0:
sum = get_sum(dic)
else:
sum += (c - b) * count
print(sum) | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
from collections import Counter
x = Counter(a)
for i in range(q):
b, c = list(map(int, input().split()))
if b in x:
m = x[b]
x.pop(b)
if c in x:
x[c] += m
else:
x[c] = m
print((sum(i*j for i, j in list(x.items())))) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
from collections import Counter
x = Counter(a)
r = sum(a)
for i in range(q):
b, c = list(map(int, input().split()))
m = 0
if b in x:
m = x[b]
x.pop(b)
if c in x:
x[c] += m
else:
x[c] = m
r += m*(c-b)
print(r) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split(' ')))
Q = int(eval(input()))
Bs = []
for i in range(Q):
Bs.append(list(map(int, input().split(' '))))
A_list = [0]*(10**5+1)
for i in A:
A_list[i] += 1
for B in Bs:
b, c = B
A_list[c] += A_list[b]
A_list[b] = 0
print((sum([i*num for num, i in enumerate(A_list)]))) | N = int(eval(input()))
A = list(map(int, input().split(' ')))
Q = int(eval(input()))
Bs = []
for i in range(Q):
Bs.append(list(map(int, input().split(' '))))
A_list = [0]*(10**5+1)
for i in A:
A_list[i] += 1
sum_value = sum(A)
for B in Bs:
b, c = B
sum_value += A_list[b]*c
sum_value -= A_list[b]*b
A_list[c] += A_list[b]
A_list[b] = 0
print(sum_value) | p02630 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
cnt = [0]*100005
s = sum(A)
for i in A:
cnt[i] += 1
for i in range(Q):
B, C = list(map(int,input().split()))
s += (C-B)*cnt[B]
print(s)
cnt[C] += cnt[B]
cnt[B] = 0 | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = tuple(map(int,input().split()))
Q = int(eval(input()))
cnt = [0]*100005
s = sum(A)
for i in A:
cnt[i] += 1
for i in range(Q):
B, C = list(map(int,input().split()))
s += (C-B)*cnt[B]
print(s)
cnt[C] += cnt[B]
cnt[B] = 0 | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
n_data = {i: A.count(i) for i in range(1, 10 ** 5 + 1)}
ans = sum(A)
for _ in range(Q):
b, c = list(map(int, input().split()))
ans += (c - b) * n_data[b]
n_data[c] += n_data[b]
n_data[b] = 0
print(ans) | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
n_data = Counter(A)
ans = sum(A)
for _ in range(Q):
b, c = list(map(int, input().split()))
ans += (c - b) * n_data[b]
n_data[c] += n_data[b]
n_data[b] = 0
print(ans) | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
g = []
t = sum(a)
s = []
for j in range(100001):
h = a.count(j)
g.append(h)
for i in range(q):
b,c = list(map(int,input().split()))
if g[b] != 0:
t = t + c*g[b] - b*g[b]
g[c] = g[c] + g[b]
g[b] = 0
s.append(t)
else:
s.append(t)
for m in range(q):
print((s[m]))
| n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
g = [0]*(10**5+1)
t = sum(a)
s = []
for aj in a:
g[aj]+=1
for i in range(q):
b,c = list(map(int,input().split()))
if g[b] != 0:
t = t + c*g[b] - b*g[b]
g[c] = g[c] + g[b]
g[b] = 0
s.append(t)
else:
s.append(t)
for m in range(q):
print((s[m]))
| p02630 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A_list = input().split()
Q = int(eval(input()))
num_list = [list(input().split()) for _ in range(Q)]
A_cha = ",".join(A_list)
for i in num_list:
B = i[0]
C = i[1]
A_cha = A_cha.replace(B, C)
A_result = sum([int(A) for A in A_cha.split(",")])
print(A_result) | import sys
input = sys.stdin.readline
N = int(eval(input()))
A_list = input().split()
Q = int(eval(input()))
num_list = [input().split() for _ in range(Q)]
A_cha = ",".join(A_list)
for i in num_list:
B = i[0]
C = i[1]
A_cha = A_cha.replace(B, C)
A_result = sum([int(A) for A in A_cha.split(",")])
print(A_result) | p02630 |
N = int(eval(input()))
l = [0]*(10**5+1)
A = list(map(int,input().split()))
Q = int(eval(input()))
for a in A:
l[a] += a
for _ in range(Q):
b,c = list(map(int,input().split()))
l[c] += (l[b]//b)*c
l[b] = 0
print((sum(l))) | N = int(eval(input()))
l = [0]*(10**5+1)
A = list(map(int,input().split()))
Q = int(eval(input()))
for a in A:
l[a] += a
suml = sum(l)
for _ in range(Q):
b,c = list(map(int,input().split()))
suml += ((l[b]//b)*c - l[b])
l[c] += (l[b]//b)*c
l[b] = 0
print(suml) | p02630 |
N = int(eval(input()))
l = [0]*(10**5+1)
A = list(map(int,input().split()))
Q = int(eval(input()))
for a in A:
l[a] += a
suml = sum(l)
for _ in range(Q):
b,c = list(map(int,input().split()))
suml += ((l[b]//b)*c - l[b])
l[c] += (l[b]//b)*c
l[b] = 0
print(suml) | N = int(eval(input()))
l = [0]*(10**5+1)
A = list(map(int,input().split()))
Q = int(eval(input()))
for a in A:
l[a] += a
suml = sum(l)
for _ in range(Q):
b,c = list(map(int,input().split()))
suml += (l[b]//b*c - l[b])
l[c] += l[b]//b*c
l[b] = 0
print(suml) | p02630 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
oper = [list(map(int, input().split())) for _ in range(q)]
a.sort()
res = sum(a)
for i in range(q):
b, c = oper[i]
if b in a:
bCount = a.count(b)
idx = a.index(b)
a = a[:idx] + a[idx+bCount:]
a.extend([c]*bCount)
dif = c-b
res += dif*bCount
print(res) | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
oper = [list(map(int, input().split())) for _ in range(q)]
dic = {}
for i in range(n):
if a[i] in dic:
dic[a[i]] += 1
else:
dic[a[i]] = 1
res = sum(a)
for i in range(q):
b, c = oper[i]
if b in dic:
bCount = dic[b]
del(dic[b])
if c in dic:
dic[c] += bCount
else:
dic[c] = bCount
dif = c-b
res += dif*bCount
print(res) | p02630 |
from collections import defaultdict
d = defaultdict(int)
N = eval(input())
A = list(map(int, input().split()))
for i in A:
d[i] += 1
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
d[C] += d[B]
d[B] = 0
ans = 0
for i,j in list(d.items()):
ans += i*j
print(ans) | from collections import defaultdict
d = defaultdict(int)
N = eval(input())
A = list(map(int, input().split()))
for i in A:
d[i] += 1
ans = sum(A)
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
ans = ans - B*d[B] + C*d[B]
print(ans)
d[C] += d[B]
d[B] = 0 | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for i in range(Q)]
def calc(A):
ans = 0
for i in range(len(A)):
ans += A[i] * (i + 1)
return ans
VALUE = [0 for i in range(100000)]
for i in range(N):
VALUE[A[i] - 1] += 1
for i in range(Q):
VALUE[BC[i][1] - 1] += VALUE[BC[i][0] - 1]
VALUE[BC[i][0] - 1] = 0
print((calc(VALUE)))
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for i in range(Q)]
def calc(A):
ans = 0
for i in range(len(A)):
ans += A[i] * (i + 1)
return ans
VALUE = [0 for i in range(100000)]
for i in range(N):
VALUE[A[i] - 1] += 1
ANS = []
ANS.append(calc(VALUE))
for i in range(Q):
VALUE[BC[i][1] - 1] += VALUE[BC[i][0] - 1]
ANS.append(ANS[i] + (BC[i][1] - BC[i][0]) * VALUE[BC[i][0] - 1])
VALUE[BC[i][0] - 1] = 0
for i in range(1, Q + 1):
print((ANS[i]))
| p02630 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
l = [0] * 100000
m = list(range(1,100001))
for i in range(n):
l[a[i]-1] += 1
for j in range(q):
b = list(map(int,input().split()))
l[b[1]-1] += l[b[0]-1]
l[b[0]-1] = 0
print((sum(list(map(lambda x,y: x*y, l, m)))))
| n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
ans = sum(a)
l = [0] * 100001
for i in a:
l[i] += 1
for j in range(q):
b, c = list(map(int,input().split()))
l[c] += l[b]
ans += l[b] * (c-b)
l[b] = 0
print(ans)
| p02630 |
#atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
D = Counter(A)
S = sum(A)
Q = int(eval(input()))
B = [0] * Q
C = [0] * Q
for i in range(Q):
b, c = list(map(int, input().split()))
x = D[b]
y = D[c]
temp = -x * b + x * c
print((S+temp))
S += temp
D[b] = 0
D[c] += x
#N = 1のときなどcorner caseを確認！
if __name__ == "__main__":
main() | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = [0] * Q
C = [0] * Q
for i in range(Q):
B[i], C[i] = list(map(int, input().split()))
#output
from collections import Counter
D = Counter(A)
S = sum(A)
for i in range(Q):
x = D[B[i]]
temp = S - x*B[i] + x*C[i]
print(temp)
D[B[i]] = 0
D[C[i]] += x
S = temp
#N = 1のときなどcorner caseを確認！
if __name__ == "__main__":
main()
| p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
num_A = [A.count(i) for i in range(10**5+1)]
first = sum(A)
for i in range(Q):
b, c = list(map(int, input().split()))
first += c*num_A[b]
first -= b*num_A[b]
num_A[c] += num_A[b]
num_A[b] = 0
print(first) | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
num_A = [0 for i in range(10**5+1)]
first = 0
for a in A:
num_A[a] += 1
first += a
for i in range(Q):
b, c = list(map(int, input().split()))
first += c*num_A[b]
first -= b*num_A[b]
num_A[c] += num_A[b]
num_A[b] = 0
print(first) | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = []
for i in range(q):
bc.append(list(map(int, input().split())))
dic = {}
for i in range(n):
if str(a[i]) not in dic:
dic[str(a[i])] = 1
else:
dic[str(a[i])] += 1
for i in range(q):
ans = 0
if str(bc[i][0]) in dic:
buf = dic[str(bc[i][0])]
dic[str(bc[i][0])] = 0
if str(bc[i][1]) in dic:
dic[str(bc[i][1])] += buf
else:
dic[str(bc[i][1])] = buf
for j in dic:
ans += int(j) * dic[j]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = []
for i in range(q):
bc.append(list(map(int, input().split())))
a_sum = sum(a)
dic = {}
for i in range(n):
if str(a[i]) not in dic:
dic[str(a[i])] = 1
else:
dic[str(a[i])] += 1
for i in range(q):
ans = 0
if str(bc[i][0]) in list(dic.keys()):
buf = dic[str(bc[i][0])]
if str(bc[i][1]) in list(dic.keys()):
dic[str(bc[i][1])] += buf
else:
dic[str(bc[i][1])] = buf
a_sum += buf*(-bc[i][0] + bc[i][1])
dic[str(bc[i][0])] = 0
print(a_sum) | p02630 |
n0 = int(1e5)+1
x = [0]*n0
n = int(eval(input()))
a0 = list(map(int,input().split()))
q = int(eval(input()))
bcs = []
for i in range(q):
bcs.append(list(map(int,input().split())))
for a in a0:
x[a] += 1
for bc in bcs:
x[bc[1]] += x[bc[0]]
x[bc[0]] = 0
sum0 = 0
for i in range(n0):
sum0 += i*x[i]
print(sum0) | n0 = int(1e5)+1
x = [0]*n0
n = int(eval(input()))
a0 = list(map(int,input().split()))
q = int(eval(input()))
bcs = []
for i in range(q):
bcs.append(list(map(int,input().split())))
for a in a0:
x[a] += 1
sum0 = sum(a0)
for bc in bcs:
sum0 = sum0 + bc[1]*x[bc[0]] - bc[0]*x[bc[0]]
x[bc[1]] += x[bc[0]]
x[bc[0]] = 0
print(sum0) | p02630 |
from collections import Counter
n = int(eval(input()))
a_li = list(map(int,input().split()))
a_counter = Counter(a_li)
q = int(eval(input()))
for i in range(q):
ans = 0
a,b = list(map(int,input().split()))
dum = a_counter[a]
a_counter[a] = 0
a_counter[b] += dum
for j in a_counter:
ans += j * a_counter[j]
print(ans)
| from collections import Counter
n = int(eval(input()))
a_li = list(map(int,input().split()))
ans = sum(a_li)
a_counter = Counter(a_li)
q = int(eval(input()))
for i in range(q):
a,b = list(map(int,input().split()))
dum = a_counter[a]
ans -= dum*a
ans += dum*b
a_counter[a] = 0
a_counter[b] += dum
print(ans)
| p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
d=[0]*(10**5 +1 )
for i in a:
d[i-1]+=i
for _ in range(q):
b,c=list(map(int,input().split()))
ans=0
k=d[b-1]//b
d[c-1]+=c*k
d[b-1]=0
print((sum(d)))
| n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
s=sum(a)
d=[0]*(10**5+1)
for i in a:
d[i-1]+=1
for _ in range(q):
b,c=list(map(int,input().split()))
tmp=0
k=d[b-1]
d[c-1]+=k
d[b-1]=0
tmp = k*c-k*b
s+=tmp
print(s)
| p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dictA = {}
for z in A:
dictA.setdefault(z, 0)
dictA[z] += 1
BC = [list(map(int, input().split())) for i in range(Q)]
for x in BC:
if x[0] in list(dictA.keys()):
dictA.setdefault(x[1], 0)
dictA[x[1]] += dictA[x[0]]
dictA.pop(x[0])
# print(dictA)
sumA = 0
for k, v in list(dictA.items()):
sumA += k * v
print(sumA)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dictA = {}
for z in A:
dictA.setdefault(z, 0)
dictA[z] += 1
sumA = sum(A)
BC = [list(map(int, input().split())) for i in range(Q)]
for x in BC:
if x[0] in list(dictA.keys()):
sumA += (x[1] - x[0]) * dictA[x[0]]
dictA.setdefault(x[1], 0)
dictA[x[1]] += dictA[x[0]]
dictA.pop(x[0])
print(sumA)
| p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
s = Counter(A)
t=[0]*(10**5+1)
for i in range(10**5+1):
t[i] = s[i]*i
sumnum=sum(t)
for i in range(Q):
B, C = list(map(int, input().split()))
num = t[B]//(B)
t[B] = 0
t[C] += num*(C)
sumnum=sumnum-num*B+num*C
print((sum(t)))
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
s = Counter(A)
t=[0]*(10**5+1)
for i in range(10**5+1):
t[i] = s[i]*i
sumnum=sum(t)
for i in range(Q):
B, C = list(map(int, input().split()))
num = t[B]//(B)
t[B] = 0
t[C] += num*(C)
sumnum=sumnum-num*B+num*C
print(sumnum)
| p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=sum(a)
q=int(eval(input()))
dp=[0]*(10**5+1)
for i in range(1,10**5+1):
dp[i]=a.count(i)
for j in range(q):
b,c=list(map(int,input().split()))
ans+=(c-b)*dp[b]
dp[c]+=dp[b]
dp[b]=0
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=sum(a)
q=int(eval(input()))
dp=[0]*(10**5+1)
for i in a:
dp[i]+=1
for j in range(q):
b,c=list(map(int,input().split()))
ans+=(c-b)*dp[b]
dp[c]+=dp[b]
dp[b]=0
print(ans) | p02630 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def main():
n = int(eval(input()))
al = list(map(int, input().split()))
q = int(eval(input()))
cnt_dic = {}
ans = 0
for a in al:
cnt_dic.setdefault(a,0)
cnt_dic[a] += 1
ans += a
bcl = []
for _ in range(q):
b, c = list(map(int, input().split()))
bcl.append((b,c))
for bc in bcl:
b,c = bc
if b not in cnt_dic:
print(ans)
continue
ans += cnt_dic[b]*(c-b)
cnt_dic.setdefault(c,0)
cnt_dic[c] += cnt_dic[b]
cnt_dic[b] = 0
print(ans)
if __name__ == "__main__":
main() | n = int(eval(input()))
al = list(map(int, input().split()))
num_cnt = {}
c_sum = 0
for a in al:
num_cnt.setdefault(a,0)
num_cnt[a] += 1
c_sum += a
ans = []
q = int(eval(input()))
for _ in range(q):
b,c = list(map(int, input().split()))
num_cnt.setdefault(b,0)
num_cnt.setdefault(c,0)
diff = num_cnt[b]*c - num_cnt[b]*b
num_cnt[c] += num_cnt[b]
num_cnt[b] = 0
c_sum += diff
ans.append(c_sum)
for a in ans:
print(a) | p02630 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
for i in range(Q):
B,C=list(map(int,input().split()))
A=[C if i==B else i for i in A]
a=collections.Counter(A)
check=list(a.items())
ans=0
for j in range(len(check)):
ans+=check[j][0]*check[j][1]
print(ans)
| N=int(eval(input()))
A=list(map(int,input().split()))
ans=sum(A)
check=[0]*(10**5+1)
for key in A:
check[key]+=1
Q=int(eval(input()))
for i in range(Q):
B,C=list(map(int,input().split()))
if check[B]==0:
print(ans)
else:
x=C-B
ans+=check[B]*x
print(ans)
check[C]+=check[B]
check[B]=0
| p02630 |
#!/usr/bin/env python3
import sys
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
d = collections.Counter(A)
for i in range(Q):
B,C = list(map(int, input().split()))
if B in d:
val = d[B]
if C in d:
d[C] = d[C] + d[B]
else:
d[C] = d[B]
d.pop(B)
ans = 0
for k, v in list(d.items()):
ans += k * v
print(ans) | #!/usr/bin/env python3
import sys
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
d = collections.Counter(A)
ans = 0
for k, v in list(d.items()):
ans += k * v
for i in range(Q):
B,C = list(map(int, input().split()))
if B in d:
val = d[B]
ans -= B * d[B]
ans += C * d[B]
if C in d:
d[C] = d[C] + d[B]
else:
d[C] = d[B]
d.pop(B)
print(ans) | p02630 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
M=[list(map(int,input().split())) for _ in range(q)]
Sum = sum(A)
d={}
for i in range(n):
if A[i] not in d:
d[A[i]]=1
else:
d[A[i]]+=1
for i in M:
a,b=i[0],i[1]
if a not in d:
L = list(d.items())
print((sum([x*y for x,y in L])))
continue
elif b in d:
d[b]+=d[a]
else:
d[b]=d[a]
d.pop(a)
L = list(d.items())
print((sum([x*y for x,y in L])))
| import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
M=[list(map(int,input().split())) for _ in range(q)]
Sum = sum(A)
d={}
for i in range(n):
if A[i] not in d:
d[A[i]]=1
else:
d[A[i]]+=1
for i in M:
prev = 0
a,b=i[0],i[1]
if a not in d:
print(Sum)
continue
elif b in d:
prev = d[b]*b
d[b]+=d[a]
else:
d[b]=d[a]
Sum += d[b]*b-d[a]*a-prev
d.pop(a)
print(Sum)
| p02630 |
N=int(eval(input()))
A=list(map(int,input().split()))
TMP=sum(A)
Q=int(eval(input()))
import collections
List=collections.Counter(A)
for i in range(Q):
S,T=list(map(int,input().split()))
TMP=TMP+(T-S)*List[S]
print(TMP)
List[T]+=List[S]
List[S]=0 | def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
N=II()
A=LI()
Sum=sum(A)
Q=II()
cnt={}
queries=[]
for i in range(Q):
b,c=MI()
queries.append((b,c))
for a in A:
if a not in cnt:
cnt[a]=0
cnt[a]+=1
#print(cnt)
for b,c in queries:
if b in cnt:
Sum-=cnt[b]*b
Sum+=cnt[b]*c
if c not in cnt:
cnt[c]=0
cnt[c]+=cnt[b]
cnt[b]=0
print(Sum)
| p02630 |
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
N=II()
A=LI()
Sum=sum(A)
Q=II()
cnt={}
queries=[]
for i in range(Q):
b,c=MI()
queries.append((b,c))
for a in A:
if a not in cnt:
cnt[a]=0
cnt[a]+=1
#print(cnt)
for b,c in queries:
if b in cnt:
Sum-=cnt[b]*b
Sum+=cnt[b]*c
if c not in cnt:
cnt[c]=0
cnt[c]+=cnt[b]
cnt[b]=0
print(Sum)
| def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
N=II()
A=LI()
SA=sum(A)
Q=II()
queries=[]
for i in range(Q):
b,c=MI()
queries.append((b,c))
cnt={}
for a in A:
if a not in cnt:
cnt[a]=0
cnt[a]+=1
for b,c in queries:
if b in cnt:
SA-=cnt[b]*b
SA+=cnt[b]*c
if c not in cnt:
cnt[c]=0
cnt[c]+=cnt[b]
cnt[b]=0
print(SA)
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
for i in bc:
str_a = " ".join(map(str, a))
str_a = str_a.replace(str(i[0]), str(i[1]))
a = list(map(int, str_a.split()))
print((sum(a))) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
dic = {}
suma = sum(a)
for i in a:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
for j in bc:
dif = j[1] - j[0]
if j[0] in dic:
suma += dif * dic[j[0]]
else:
print(suma)
continue
if j[1] in dic:
dic[j[1]] += dic.pop(j[0])
else:
dic[j[1]] = dic.pop(j[0])
print(suma) | p02630 |
from collections import defaultdict
def main():
number = int(eval(input()))
numcount = defaultdict(int)
for x in input().split():
numcount[int(x)] += 1
queries = int(eval(input()))
for _ in range(queries):
before, after = [int(x) for x in input().split()]
tmp = numcount[before]
numcount[before] -= tmp
numcount[after] += tmp
print((sum(num * count for num, count in list(numcount.items()))))
if __name__ == '__main__':
main()
| from collections import defaultdict
def main():
number = int(eval(input()))
numcount = defaultdict(int)
for x in input().split():
numcount[int(x)] += 1
queries = int(eval(input()))
ans = sum(num * count for num, count in list(numcount.items()))
for _ in range(queries):
before, after = [int(x) for x in input().split()]
tmp = numcount[before]
numcount[before] -= tmp
numcount[after] += tmp
ans += (after - before) * tmp
print(ans)
if __name__ == '__main__':
main()
| p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
dic = {}
s = sum(a)
for i in range(1,10**5+1):
if i in a:
dic[i] = a.count(i)
else:
dic[i] = 0
lis=[]
for j in range(q):
b,c = list(map(int,input().split()))
lis.append([b,c])
for p in lis:
s += (p[1]-p[0])*dic[p[0]]
dic[p[1]] += dic[p[0]]
dic[p[0]] = 0
print(s) | from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
num = Counter(a)
s = sum(a)
for _ in range(q):
b,c = list(map(int,input().split()))
s += (c-b)*num[b]
num[c] += num[b]
num[b] = 0
print(s) | p02630 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = []
C = []
for _ in range(Q):
B_i, C_i = list(map(int, input().split()))
B.append(B_i)
C.append(C_i)
max_i = max(max(A), max(C))
A_N = [A.count(i) * i for i in range(max_i + 1)]
sum_i = sum(A_N)
for i in range(Q):
diff_replace = int(A_N[B[i]] / B[i]) * C[i]
sum_i += diff_replace - A_N[B[i]]
A_N[C[i]] += diff_replace
A_N[B[i]] = 0
print(sum_i)
| # -*- coding: utf-8 -*-
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = []
C = []
for _ in range(Q):
B_i, C_i = list(map(int, input().split()))
B.append(B_i)
C.append(C_i)
max_i = max(max(A), max(C))
A_N = [0 for _ in range(max_i + 1)]
sum_i = 0
for a in A:
A_N[a] += a
sum_i += a
for i in range(Q):
diff_replace = int(A_N[B[i]] / B[i]) * C[i]
sum_i += diff_replace - A_N[B[i]]
A_N[C[i]] += diff_replace
A_N[B[i]] = 0
print(sum_i)
| p02630 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.