input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#create date: 2020-06-29 09:42
import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
a = na()
alist = [0] * (10**5 + 1)
for ai in a:
alist[ai] += 1
q = ni()
for i in range(q):
b, c = na()
alist[c] += alist[b]
alist[b] = 0
ans = 0
for i, num in enumerate(alist):
ans += i*num
print(ans)
if __name__ == "__main__":
main() | #create date: 2020-06-29 09:42
import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
a = na()
alist = [0] * (10**5 + 1)
for ai in a:
alist[ai] += 1
asum = 0
for i, num in enumerate(alist):
asum += i*num
q = ni()
for i in range(q):
b, c = na()
asum += alist[b] * (c-b)
alist[c] += alist[b]
alist[b] = 0
print(asum)
if __name__ == "__main__":
main() | 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)]
# print(n,q)
# print(A)
# print(BC)
C = {}
for a in A:
if a in C:
C[a]+=1
else:
C[a]=1
s = sum(A)
# print(a)
for b,c in BC:
# print(b,c)
d = c-b
if not b in C:
C[b] = 0
s += d*C[b]
if not c in C:
C[c] = 0
C[c] += C[b]
C[b] = 0
print(s)
| n = int(eval(input()))
A = [*list(map(int, input().split()))]
q = int(eval(input()))
BC = [[*list(map(int, input().split()))] for _ in range(q)]
C = {}
for a in A:
if a in C: C[a] += 1
else: C[a] = 1
s = sum(A)
for b, c in BC:
if not b in C: C[b] = 0
if not c in C: C[c] = 0
s += (c - b) * C[b]
C[c] += C[b]
C[b] = 0
print(s)
| p02630 |
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
req = [list(map(int, input().split())) for _ in range(q)]
count = [0]*100000
sum = 0
ans = [0]*q
for i in range(100000):
count[i] = a.count(i+1)
for j in a:
sum += j
for k in range(q):
diff = req[k][1] - req[k][0]
diff = diff * count[req[k][0] - 1]
count[req[k][1] - 1] += count[req[k][0] - 1]
count[req[k][0] - 1] = 0
sum += diff
ans[k] = sum
for l in range(q):
print((ans[l]))
| #n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
req = [list(map(int, input().split())) for _ in range(q)]
count = [0]*100001
sum = sum(a)
for i in a:
count[i] += 1
for k in range(q):
sum += (req[k][1] - req[k][0]) * count[req[k][0]]
count[req[k][1]] += count[req[k][0]]
count[req[k][0]] = 0
print(sum)
| p02630 |
import collections
N = int(eval(input()))
A = [int(x) for x in input().split()]
a = collections.Counter(A)
Q = int(eval(input()))
for i in range(Q):
B, C = list(map(int, input().split()))
if B in a:
a[C] += a[B]
a[B] = 0
tmp = 0
for i in a:
tmp += a[i] * i
print(tmp) | N = int(eval(input()))
A = [int(x) for x in input().split()]
S =sum(A)
D = [0]*(10**5+1)
for a in A:
D[a] += 1
Q = int(eval(input()))
for i in range(Q):
b, c = list(map(int, input().split()))
S -= D[b]*b
S += D[b]*c
D[c] += D[b]
D[b] = 0
print(S) | p02630 |
#!/usr/bin/env python3
n = int(eval(input()))
A = list(map(str, input().split()))
q = int(eval(input()))
for i in range(q):
b, c = list(map(str, input().split()))
A = [int(str(a).replace(b, c)) for a in A]
print((sum(A))) | #!/usr/bin/env python3
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
for i in range(q):
b, c = list(map(str, input().split()))
if int(b) in A:
A = [int(str(a).replace(b, c)) for a in A]
print((sum(A))) | p02630 |
from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
raw_number = list(map(int, input().split()))
numbers = defaultdict(int)
for num in raw_number:
numbers[num] += 1
Q = int(eval(input()))
for _ in range(Q):
a, b = list(map(int, input().split()))
numbers[b] += numbers[a]
numbers.pop(a)
print((sum([v*k for (k, v) in list(numbers.items())])))
main() | class Counter(dict):
def __missing__(self, i):
return 0
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
total = sum(a)
bucket = Counter()
for item in a:
bucket[item] += 1
for i in range(q):
b, c = list(map(int, input().split()))
taken = bucket[b]
total -= bucket[b]*b
bucket[c] += bucket[b]
bucket[b] = 0
total += taken*c
print(total)
| p02630 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
total = sum(a)
numbers = defaultdict(int)
for item in a:
numbers[item] += 1
for i in range(q):
b, c = list(map(int, input().split()))
taken = numbers[b]
total -= numbers[b]*b
numbers[c] += numbers[b]
numbers[b] = 0
total += taken*c
print(total) | from collections import defaultdict
n = int(eval(input()))
raw_numbers = list(map(int, input().split()))
q = int(eval(input()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for item in raw_numbers:
numbers[item] += 1
for i in range(q):
b, c = list(map(int, input().split()))
taken = numbers[b]
total -= numbers[b]*b
numbers[c] += numbers[b]
numbers[b] = 0
total += taken*c
print(total) | p02630 |
from collections import defaultdict
n = int(eval(input()))
raw_numbers = list(map(int, input().split()))
q = int(eval(input()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for item in raw_numbers:
numbers[item] += 1
for i in range(q):
b, c = list(map(int, input().split()))
taken = numbers[b]
total -= numbers[b]*b
numbers[c] += numbers[b]
numbers[b] = 0
total += taken*c
print(total) | from collections import defaultdict
n = int(eval(input()))
raw_numbers = list(map(int, input().split()))
q = int(eval(input()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for item in raw_numbers:
numbers[item] += 1
for i in range(q):
a, b = list(map(int, input().split()))
taken = numbers[a]
total -= numbers[a]*a
numbers[b] += numbers[a]
numbers[a] = 0
total += taken*b
print(total) | p02630 |
from collections import defaultdict
N = int(eval(input()))
raw_numbers = list(map(int, input().split()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for num in raw_numbers:
numbers[num] += 1
Q = int(eval(input()))
for i in range(Q):
a, b = list(map(int, input().split()))
taken = numbers[a]
total -= numbers[a]*a
numbers[b] += numbers[a]
numbers[a] = 0
total += taken*b
print(total) | from collections import defaultdict
N = int(eval(input()))
raw_numbers = list(map(int, input().split()))
Q = int(eval(input()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for num in raw_numbers:
numbers[num] += 1
for _ in range(Q):
a, b = list(map(int, input().split()))
taken = numbers[a]
total -= numbers[a]*a
numbers[b] += numbers[a]
numbers[a] = 0
total += taken*b
print(total) | p02630 |
from collections import defaultdict
N = int(eval(input()))
raw_numbers = list(map(int, input().split()))
Q = int(eval(input()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for num in raw_numbers:
numbers[num] += 1
for _ in range(Q):
a, b = list(map(int, input().split()))
taken = numbers[a]
total -= numbers[a]*a
numbers[b] += numbers[a]
numbers[a] = 0
total += taken*b
print(total) | from collections import defaultdict
N = int(eval(input()))
raw_numbers = list(map(int, input().split()))
Q = int(eval(input()))
total = sum(raw_numbers)
numbers = defaultdict(int)
for num in raw_numbers:
numbers[num] += 1
for _ in range(Q):
a, b = list(map(int, input().split()))
taken = numbers[a]
total -= numbers[a]*a
numbers[b] += numbers[a]
total += taken*b
numbers[a] = 0
print(total) | p02630 |
N=int(eval(input()))
A=[str(i) for i in input().split()]
Q=int(eval(input()))
BC= [list(map(str, input().split())) for i in range(Q)]
#
# print(BC)
for i in range(Q):
A = [s.replace(BC[i][0],BC[i][1]) for s in A]
print((sum(int(j) for j in A)))
| import sys
input = sys.stdin.readline
N=int(eval(input()))
A=[str(i) for i in input().split()]
Q=int(eval(input()))
BC= [list(map(str, input().split())) for i in range(Q)]
#
# print(BC)
for i in range(Q):
A = [s.replace(BC[i][0],BC[i][1]) for s in A]
print((sum(int(j) for j in A)))
| 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())))
A_sum=sum(A)
A_count=[]
for i in range(100001):
A_count.append(A.count(i))
for i in range(Q):
A_sum+=(BC[i][1]-BC[i][0])*A_count[BC[i][0]]
A_count[BC[i][1]]+=A_count[BC[i][0]]
print(A_sum) | 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)
A_count=[]
for i in range(100001):
A_count.append(A.count(i))
for i in range(Q):
A_sum+=(BC[i][1]-BC[i][0])*A_count[BC[i][0]]
A_count[BC[i][1]]+=A_count[BC[i][0]]
A_count[BC[i][0]]=0
print(A_sum) | 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())))
A_sum=sum(A)
A_count=[]
for i in range(100001):
A_count.append(A.count(i))
for i in range(Q):
B,C=(list(map(int,input().split())))
A_sum+=(C-B)*A_count[B]
A_count[C]+=A_count[B]
A_count[B]=0
print(A_sum) | from collections import Counter
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)
A_count=Counter(A)
for i in range(Q):
B,C=(list(map(int,input().split())))
A_sum+=(C-B)*A_count[B]
A_count[C]+=A_count[B]
A_count[B]=0
print(A_sum) | p02630 |
import math
n = int(eval(input()))
aL = list(map(int, input().split(" ")))
q = int(eval(input()))
bcL = [list(map(int, input().split(" "))) for _ in range(q)]
sums = [0 for i in range(10**5 + 1)]
for a in aL:
sums[a] += 1
for b, c in bcL:
sums[c] += sums[b]
sums[b] = 0
_sum = 0
for i, s in enumerate(sums):
_sum += i * s
print(_sum) | import math
n = int(eval(input()))
aL = list(map(int, input().split(" ")))
q = int(eval(input()))
bcL = [list(map(int, input().split(" "))) for _ in range(q)]
sums = [0 for i in range(10**5 + 1)]
for a in aL:
sums[a] += 1
_sum = 0
for i, a in enumerate(sums):
_sum += i * a
for b, c in bcL:
_sum += (c - b) * sums[b]
sums[c] += sums[b]
sums[b] = 0
print(_sum) | p02630 |
N = int(input().strip())
A = {}
for a in [int(x) for x in input().strip().split(" ")]:
A.setdefault(a, 0)
A[a] += 1
Q = int(input().strip())
for q in range(Q):
B, C = [int(x) for x in input().strip().split(" ")]
if B in A:
A.setdefault(C, 0)
A[C] += A[B]
del A[B]
print((sum([k * v for k, v in list(A.items())])))
| N = int(input().strip())
A = {}
for a in [int(x) for x in input().strip().split(" ")]:
A.setdefault(a, 0)
A[a] += 1
total = sum([k * v for k, v in list(A.items())])
Q = int(input().strip())
for q in range(Q):
B, C = [int(x) for x in input().strip().split(" ")]
if B in A:
A.setdefault(C, 0)
dif = (C - B) * A[B]
A[C] += A[B]
del A[B]
total += dif
print(total)
| p02630 |
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
total = sum(A)
num = [0] * (10 ** 5 + 1)
for a in A:
num[a] += 1
Q = int(eval(input()))
for _ in range(Q):
b, c = list(map(int, sys.stdin.readline().split()))
total -= b * num[b]
total += c * num[b]
num[c] += num[b]
num[b] = 0
print(total) | import sys
N = int(eval(input()))
A = tuple(map(int, input().split()))
count = [0] * (10 ** 5 + 1)
for a in A:
count[a] += 1
s = sum(A)
Q = int(eval(input()))
for _ in range(Q):
b, c = list(map(int, sys.stdin.readline().split()))
s -= count[b] * b
s += count[b] * c
count[c] += count[b]
count[b] = 0
print(s) | p02630 |
import math
# from collections import Counter
# N = int(input()) # 1行, 単数
# arg = list(map(int, input().split())) # 1行, 配列
# D = Counter(arg) # 出現数カウント
# print('Yes')
# print('No')
# print()
import collections
N = int(eval(input())) # 1行, 単数
A = list(map(int, input().split())) # 1行, 配列
Q = int(eval(input())) # 1行, 単数
counter = collections.Counter(A)
while True:
try:
# ans = 0
B,C = list(map(int, input().split())) # 1行, 配列
# counter[C] = counter[C] + counter[B]
# del counter[B]
# for i in counter.keys():
# ans = ans + i * counter[i]
A = [C if i == B else i for i in A]
print((sum(A)))
except:
break; | import math
# from collections import Counter
# N = int(input()) # 1行, 単数
# arg = list(map(int, input().split())) # 1行, 配列
# D = Counter(arg) # 出現数カウント
# print('Yes')
# print('No')
# print()
import collections
N = int(eval(input())) # 1行, 単数
A = list(map(int, input().split())) # 1行, 配列
Q = int(eval(input())) # 1行, 単数
counter = collections.Counter(A)
ans = 0
for i in list(counter.keys()):
ans = ans + i * counter[i]
while True:
try:
B,C = list(map(int, input().split())) # 1行, 配列
old = C * counter[C] + counter[B] * B
counter[C] = counter[C] + counter[B]
del counter[B]
new = C * counter[C]
ans = ans + (new - old)
print(ans)
except:
break; | p02630 |
N = int(eval(input()))
A = list(map(str, input().split()))
Q = int(eval(input()))
for i in range(1,Q+1):
x, y = list(map(str, input().split()))
A = [s.replace(x, y) for s in A]
A_int = list(map((lambda x: int(x)), A))
print((sum(A_int))) | N = int(eval(input()))
A = list(map(str, input().split()))
Q = int(eval(input()))
for i in range(1,Q+1):
x, y = list(map(str, input().split()))
A = [s.replace(x, y) for s in A]
A_int = list(map(int, A))
print((sum(A_int))) | 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)]
temp = [0] * (10**5 + 1)
for i in a:
temp[i] += i
for i in range(q):
b,c = bc[i][0],bc[i][1]
temp[c] += (temp[b]//b) * c
temp[b] = 0
print((sum(temp)))
|
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc =[list(map(int, input().split())) for _ in range(q)]
temp = [0] * (10**5 + 1)
for i in a:
temp[i] += 1
ans = sum(a)
for i in range(q):
b,c = bc[i][0],bc[i][1]
ans = ans - temp[b] * b + temp[b] * c
print(ans)
temp[c] += temp[b]
temp[b] = 0
if __name__ == "__main__":
main() | p02630 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
dic = defaultdict(int)
for i in range(n):
dic[a[i]]+=1
Q= int(eval(input()))
for q in range(Q):
b, c = list(map(int, input().split()))
dic[c]+=dic[b]
dic[b]=0
ans = 0
for j in dic:
ans += dic[j]*j
print(ans) | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
dic = defaultdict(int)
for i in range(n):
dic[a[i]]+=1
ans = 0
for j in dic:
ans += dic[j]*j
Q= int(eval(input()))
for q in range(Q):
b, c = list(map(int, input().split()))
s= dic[b]*(c-b)
ans += s
dic[c]+=dic[b]
dic[b]=0
print(ans) | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
ans=[0]*(10**5+1)
for i in a:
ans[i]+=1
for _ in range(q):
b,c=list(map(int,input().split()))
ans[c]+=ans[b]
ans[b]=0
s=0
for i,x in enumerate(ans):
s+=i*x
print(s)
| n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
ans=[0]*(10**5+1)
for i in a:
ans[i]+=1
res=sum(a)
for _ in range(q):
b,c=list(map(int,input().split()))
ans[c]+=ans[b]
res-=ans[b]*b
res+=ans[b]*c
ans[b]=0
print(res) | p02630 |
n = int(eval(input()))
a = list(map(int,input().strip().split()))
q = int(eval(input()))
import collections
counter = collections.Counter(a)
result = 0
for j in range(q):
b,c = list(map(int,input().strip().split()))
if c in counter:
counter[c] += counter[b]
else:
counter[c] = counter[b]
counter[b] = 0
result = 0
for i in counter:
result += i * counter[i]
print(result) | n = int(eval(input()))
a = list(map(int,input().strip().split()))
q = int(eval(input()))
import collections
result = sum(a)
counter = collections.Counter(a)
for j in range(q):
b,c = list(map(int,input().strip().split()))
if c in counter:
counter[c] += counter[b]
else:
counter[c] = counter[b]
result += (c-b) * counter[b]
counter[b] = 0
print(result) | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = list(list(map(int, input().split())) for _ in range(q))
num = [0]*(10**5 + 1)
for i in range(10**5 + 1):
num[i] = a.count(i)
s = sum(a)
for b, c in bc:
s += (c - b)*num[b]
num[c] += num[b]
num[b] = 0
print(s) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = list(list(map(int, input().split())) for _ in range(q))
s = sum(a)
num = [0]*(10**5 + 1)
for x in a:
num[x] += 1
for b, c in bc:
s += (c - b)*num[b]
num[c] += num[b]
num[b] = 0
print(s) | p02630 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
A=sorted(A)
Q=int(eval(input()))
B=[0]*Q;C=[0]*Q
for i in range(Q):
B[i],C[i]=list(map(int,input().split()))
#c = collections.Counter(A)
#print(c)
for i in range(Q):
A = [C[i] if B[i]==A[j] else A[j] for j in range(N)]
# print(A)
print((sum(A))) | import collections
N=int(eval(input()))
A=list(map(int,input().split()))
A=sorted(A)
Q=int(eval(input()))
B=[0]*Q;C=[0]*Q
for i in range(Q):
B[i],C[i]=list(map(int,input().split()))
D = collections.Counter(A)
s=sum(A)
for i in range(Q):
s=s-B[i]*D[B[i]]
D[C[i]]+=D[B[i]]
s=s+C[i]*D[B[i]]
D[B[i]]=0
# A = [C[i] if B[i]==A[j] else A[j] for j in range(N)]
# print(A)
print(s) | p02630 |
import collections
N = int(eval(input()))
a = list(map(int, input().split()))
a_c = collections.Counter(a)
Q = int(eval(input()))
BC = [list(map(int, input().split())) for _ in range(Q)]
for bc in BC:
b = bc[0]
c = bc[1]
s = 0
if b in a_c:
a_c[c]+=a_c.pop(b)
for k, v in list(a_c.items()):
s += k*v
print(s) | import collections
N = int(eval(input()))
a = list(map(int, input().split()))
a_c = collections.Counter(a)
Q = int(eval(input()))
BC = [list(map(int, input().split())) for _ in range(Q)]
s_old = 0
for k, v in list(a_c.items()):
s_old += k*v
for bc in BC:
b = bc[0]
c = bc[1]
s = s_old
if b in a_c:
n = a_c.pop(b)
a_c[c]+=n
s-=n*b
s+=n*c
print(s)
s_old = s | p02630 |
N = int(eval(input()))
A = [int(n) for n in input().split()]
Q = int(eval(input()))
D = dict()
for a in A:
if a not in list(D.keys()):
D[a] = 0
D[a] += 1
for _ in range(Q):
B, C = [int(n) for n in input().split()]
if B in list(D.keys()):
if C not in list(D.keys()):
D[C] = 0
D[C] += D[B]
del D[B]
ans = 0
for k, v in list(D.items()):
ans += k * v
print(ans)
| N = int(eval(input()))
A = [int(n) for n in input().split()]
Q = int(eval(input()))
D = dict()
for a in A:
if a not in list(D.keys()):
D[a] = 0
D[a] += 1
ans = 0
for k, v in list(D.items()):
ans += k * v
for _ in range(Q):
B, C = [int(n) for n in input().split()]
if B in list(D.keys()):
count = D[B]
if C not in list(D.keys()):
D[C] = 0
D[C] += count
del D[B]
ans += (C - B) * count
print(ans)
| p02630 |
from collections import defaultdict
n = int(eval(input()))
arr = list(map(int,input().split()))
dd = defaultdict(int)
for a in arr:
dd[a]+=1
q = int(eval(input()))
for _ in range(q):
b,c = list(map(int,input().split()))
if dd[b]>0:
dd[c]+=dd[b]
dd[b]=0
sum = 0
for key in list(dd.keys()):
sum+=dd[key]*key
print(sum) | from collections import defaultdict
n = int(eval(input()))
arr = list(map(int,input().split()))
dd = defaultdict(int)
for a in arr:
dd[a]+=1
sum = sum(arr)
q = int(eval(input()))
for _ in range(q):
b,c = list(map(int,input().split()))
if dd[b]>0:
sum += dd[b]*(c-b)
dd[c]+=dd[b]
dd[b]=0
print(sum) | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
#print(a)
q = int(eval(input()))
z = [0 for i in range(100001)]
for i in range(len(a)):
z[a[i]] += 1
b = []
for _ in range(q):
b.append(list(map(int,input().split())))
#print(b)
for i in range(q):
z[b[i][1]] += z[b[i][0]]
z[b[i][0]] = 0
#print(z[:5])
s = 0
for j in range(len(z)):
s += j * z[j]
print(s) | n = int(eval(input()))
a = list(map(int,input().split()))
#print(a)
q = int(eval(input()))
z = [0 for i in range(100001)]
for i in range(len(a)):
z[a[i]] += 1
x = sum(a)
b = []
for _ in range(q):
b.append(list(map(int,input().split())))
#print(b)
for i in range(q):
x += (b[i][1] - b[i][0]) * z[b[i][0]]
z[b[i][1]] += z[b[i][0]]
z[b[i][0]] = 0
print(x) | p02630 |
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")
MOD = 1000000007
INF = float('inf')
alpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
def keta(kazu): # 入力されたintを桁ごとに分解，リストで出力
kazu_str = str(kazu)
kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
return kazu_list
def gcd(*numbers): # 最小公倍数
return reduce(math.gcd, numbers)
def combination(m,n): # mCn
if n > m:
return 'すまん'
return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))
def pow_k(x,n): # (x**n)の計算の高速化
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
def main():
n = int(stdin.readline().rstrip())
a = list(map(int,[int(x) for x in stdin.readline().rstrip().split()]))
dic = {}
ans = 0
for i in range(len(a)):
if a[i] in dic:
dic[a[i]] += 1
else:
dic[a[i]] = 1
q = int(stdin.readline().rstrip())
for i in range(q):
b, c = [int(x) for x in stdin.readline().rstrip().split()]
if b in dic:
if c in dic:
dic[c] += dic[b]
dic[b] = 0
else:
dic[c] = dic[b]
dic[b] = 0
ans = 0
for k, v in list(dic.items()):
if v != 0:
ans += k*v
print(ans)
main() | # -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")
MOD = 1000000007
INF = float('inf')
alpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
def keta(kazu): # 入力されたintを桁ごとに分解，リストで出力
kazu_str = str(kazu)
kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
return kazu_list
def gcd(*numbers): # 最小公倍数
return reduce(math.gcd, numbers)
def combination(m,n): # mCn
if n > m:
return 'すまん'
return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))
def pow_k(x,n): # (x**n)の計算の高速化
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
def main():
n = int(stdin.readline().rstrip())
a = list(map(int,[int(x) for x in stdin.readline().rstrip().split()]))
dic = {}
ans = 0
for i in range(len(a)):
if a[i] in dic:
dic[a[i]] += 1
else:
dic[a[i]] = 1
for k, v in list(dic.items()):
if v != 0:
ans += k*v
q = int(stdin.readline().rstrip())
for i in range(q):
b, c = [int(x) for x in stdin.readline().rstrip().split()]
if b in dic:
ans += (c-b)*dic[b]
print(ans)
if c in dic:
dic[c] += dic[b]
else:
dic[c] = dic[b]
dic[b] = 0
else:
print(ans)
main() | p02630 |
n = int(eval(input()))
a_list = [int(i) for i in input().split()]
q = int(eval(input()))
ary = [0 for _ in range((10 ** 5)+1)]
for i in a_list:
ary[i] += i
ans = []
for _ in range(q):
b, c = list(map(int, input().split()))
ary[c] += (ary[b]/b)*c
ary[b] = 0
ans.append(int(sum(ary)))
for a in ans:
print(a)
| n = int(eval(input()))
a_list = [int(i) for i in input().split()]
q = int(eval(input()))
ary = [0 for _ in range((10**5) + 1)]
for i in a_list:
ary[i] += 1
ans = []
f_ans = sum(a_list)
for _ in range(q):
b, c = list(map(int, input().split()))
f_ans += (c-b)*ary[b]
ary[c] += ary[b]
ary[b] = 0
ans.append(f_ans)
for a in ans:
print(a)
| p02630 |
import sys
import collections
def main():
n = int(eval(input()))
a = collections.Counter(list(map(int, input().split())))
s = [0 for i in range(10**5+1)]
sa = 0
for i in a:
s[i] += a[i]
sa += i*a[i]
q = int(eval(input()))
for x in sys.stdin.readlines():
b, c = list(map(int, x.split()))
s[c] += s[b]
sa = sa + c*s[b] - b*s[b]
s[b] = 0
print(sa)
main() | import sys
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
s = [0 for i in range(10**5+1)]
sa = sum(a)
for i in a:
s[i] += 1
q = int(eval(input()))
for x in sys.stdin.readlines():
b, c = list(map(int, x.split()))
s[c] += s[b]
sa = sa + (c-b)*s[b]
s[b] = 0
print(sa)
main() | p02630 |
import sys
readline = sys.stdin.readline
def st(line):
tmp = ''
for l in line:
if l == '\n':
yield tmp
elif l == ' ':
yield tmp
tmp = ''
else:
tmp += l
N = int(eval(input()))
As = st(readline())
d = dict()
total = 0
for a in As:
a = int(a)
if a in d:
d[a] += 1
else:
d[a] = 1
total += a
Q = int(eval(input()))
queries = (list(map(int, readline().strip().split())) for _ in range(Q))
for que in queries:
b, c = que
if b not in d:
print(total)
continue
n_b = d[b]
d[b] = 0
if c not in d:
d[c] = 0
d[c] += n_b
total += (c - b) * n_b
print(total)
| import sys
readline = sys.stdin.readline
def st(line):
tmp = ''
for l in line:
if l == '\n':
yield tmp
elif l == ' ':
yield tmp
tmp = ''
else:
tmp += l
def solve():
N = int(eval(input()))
As = st(readline())
d = dict()
total = 0
for a in As:
a = int(a)
if a in d:
d[a] += 1
else:
d[a] = 1
total += a
Q = int(eval(input()))
queries = (list(map(int, readline().strip().split())) for _ in range(Q))
for que in queries:
b, c = que
if b not in d:
print(total)
continue
n_b = d[b]
d[b] = 0
if c not in d:
d[c] = 0
d[c] += n_b
total += (c - b) * n_b
print(total)
def main():
solve()
if __name__ == "__main__":
main() | p02630 |
import sys
import math
from collections import deque
from collections import Counter
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(input())
def make_grid(h, w, num): return [[int(num)] * w for _ in range(h)]
#隣接リスト 1-order
def make_adjlist_d(n, edges):
res = [[] for _ in range(n + 1)]
for edge in edges:
res[edge[0]].append(edge[1])
res[edge[1]].append(edge[0])
return res
def make_adjlist_nond(n, edges):
res = [[] for _ in range(n + 1)]
for edge in edges:
res[edge[0]].append(edge[1])
return res
#nCr
def cmb(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
def main():
N = NI()
A = NLI()
Q = NI()
querys = [NLI() for _ in range(Q)]
Dic = dict(Counter(A))
for b, c in querys:
Dic.setdefault(c, 0)
Dic.setdefault(b, 0)
Dic[c] += Dic[b]
del Dic[b]
res = 0
for n, x in list(Dic.items()):
res += n * x
print(res)
if __name__ == "__main__":
main() | import sys
import math
from collections import deque
from collections import Counter
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(input())
def make_grid(h, w, num): return [[int(num)] * w for _ in range(h)]
#隣接リスト 1-order
def make_adjlist_d(n, edges):
res = [[] for _ in range(n + 1)]
for edge in edges:
res[edge[0]].append(edge[1])
res[edge[1]].append(edge[0])
return res
def make_adjlist_nond(n, edges):
res = [[] for _ in range(n + 1)]
for edge in edges:
res[edge[0]].append(edge[1])
return res
#nCr
def cmb(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(n - r)
def main():
N = NI()
A = NLI()
Q = NI()
querys = [NLI() for _ in range(Q)]
res = sum(A)
Dic = dict(Counter(A))
for b, c in querys:
Dic.setdefault(c, 0)
Dic.setdefault(b, 0)
gap = (c-b) * Dic[b]
Dic[c] += Dic[b]
del Dic[b]
res += gap
print(res)
if __name__ == "__main__":
main() | p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
# bc = [list(map(int,input().split())) for _ in range(q)]
c = Counter(a)
ans = []
for i in range(q):
bi,ci = list(map(int,input().split()))
c[ci] = c[bi]+c[ci]
c[bi] = 0
csum = 0
for k,v in list(c.items()):
csum += k*v
ans.append(csum)
for i in ans:
print(i) | from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
# bc = [list(map(int,input().split())) for _ in range(q)]
c = Counter(a)
allsum = 0
for k,v in list(c.items()):
allsum += k*v
ans = []
for i in range(q):
bi,ci = list(map(int,input().split()))
allsum += ci*c[bi] - bi*c[bi]
c[ci] = c[ci] + c[bi]
c[bi] = 0
ans.append(allsum)
for i in ans:
print(i) | p02630 |
N=int(eval(input()))
A=list(map(int,input().strip().split()))
Q=int(eval(input()))
dp=[0 for n in range(100000)]
for n in range(len(A)):
dp[A[n]-1]+=1
for n in range(Q):
B,C=list(map(int,input().strip().split()))
dp[C-1]+=dp[B-1]
dp[B-1]=0
ans=0
for n in range(1,len(dp)):
ans+=n*dp[n-1]
print(ans) | N=int(eval(input()))
A=list(map(int,input().strip().split()))
Q=int(eval(input()))
dp=[0 for n in range(100000+1)]
for n in range(len(A)):
dp[A[n]-1]+=1
init=0
for n in range(1,len(dp)):
init+=n*dp[n-1]
ans=init
for n in range(Q):
B,C=list(map(int,input().strip().split()))
ans=ans-dp[B-1]*B+dp[B-1]*C
dp[C-1]+=dp[B-1]
dp[B-1]=0
print(ans) | p02630 |
#D
from collections import defaultdict
n = int(eval(input()))
a = list(map(int,input().split()))
mp = defaultdict(int)
for i in a:
mp[i] += 1
q = int(eval(input()))
for _ in range(q):
#print(mp)
s = 0
b,c=list(map(int,input().split()))
if c in mp:
mp[c] = mp[c]+mp[b]
mp.pop(b)
elif b in mp:
mp[c] = mp.pop(b)
for i in mp:
s += (mp[i])*i
print(s)
| #D more faster method than above see it ..........
l = lambda : list(map(int,input().strip().split()))
n = int(eval(input()))
a = l()
t = [0]*(10**5+1)
s = 0
for i in a:
s += i
t[i] += 1
q = int(eval(input()))
for _ in range(q):
b,c = l()
s += (c-b)*t[b]
t[c] += t[b]
t[b] = 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)]
B, C = [list(i) for i in zip(*BC)]
list = [0] * 100001
sum = 0
for i in range(100001):
list[i] = A.count(i)
for j in range(N):
sum += A[j]
for k in range(Q):
sum += list[B[k]] * (C[k] -B[k])
list[C[k]] += list[B[k]]
list[B[k]] = 0
print(sum) | N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
B=[]
C=[]
for _ in range(Q):
bi, ci = list(map(int, input().split()))
B.append(bi)
C.append(ci)
dic = {}
for i in A:
dic[i] = dic.get(i,0) + 1
sum = sum(A)
for i in range(Q):
sum += dic.get(B[i], 0) * (C[i] -B[i])
dic[C[i]] = dic.get(C[i], 0) + dic.get(B[i], 0)
dic[B[i]] = dic.get(B[i], 0)
dic[B[i]] = 0
print(sum) | p02630 |
from collections import Counter
def change_dict_key(d, old_key, new_key, default_value=None):
d[new_key] = d.pop(old_key, default_value)
n=int(eval(input()))
a=list(map(int,input().split()))
a_cnt = Counter(a)
q=int(eval(input()))
for _ in range(q):
b,c=list(map(int,input().split()))
if b in list(a_cnt.keys()):
if c in list(a_cnt.keys()):
a_cnt[c]+=a_cnt[b]
a_cnt.pop(b)
else:
change_dict_key(a_cnt,b,c)
ans=0
for key,value in list(a_cnt.items()):
ans+=key*value
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
sum=0
num=[0]*(10**5+1)
for i in range(n):
sum+=a[i]
num[a[i]]+=1
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
sum+=(c-b)*num[b]
print(sum)
num[c]+=num[b]
num[b]=0 | p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
counter = Counter(a)
ini_sum = sum(a)
q = int(eval(input()))
s = [0] * q
for i in range(q):
b, c = list(map(int, input().split()))
counter[c] += counter[b]
counter[b] = 0
print((sum(key * value for key, value in list(counter.items()))))
| from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
counter = Counter(a)
ini_sum = sum(a)
q = int(eval(input()))
s = [ini_sum] + [0] * q
for i in range(1, q+1):
b, c = list(map(int, input().split()))
x = c - b
s[i] = s[i-1] + x*counter[b]
counter[c] += counter[b]
counter[b] = 0
for i in range(1, q+1):
print((s[i]))
| p02630 |
from collections import Counter
n = int(input())
A = list(input().split())
q = int(input())
ansList = [0]*q
d = Counter(A)
Sum = sum(map(int,A))
for i in range(q):
b,c = input().split()
Sum = Sum - int(b)*d[b] + int(c)*d[b]
if b in d:
if c in d:
d[c] += d.pop(b)
else:
d[c] = d.pop(b)
ansList[i] += Sum
[print(ans) for ans in ansList]
| from collections import Counter
n = int(input())
A = list(input().split())
q = int(input())
ansList = [0]*q
d = Counter(A)
Sum = sum(map(int,A))
for i in range(q):
b,c = input().split()
Sum -= (int(b)-int(c))*d[b]
if b in d:
if c in d:
d[c] += d.pop(b)
else:
d[c] = d.pop(b)
ansList[i] += Sum
[print(ans) for ans in ansList]
| p02630 |
def main():
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()))
ans = sum(A)
d = dict()
for i, a in enumerate(A):
if a not in d:
d[a] = ()
d[a] += (i,)
for b, c in zip(B, C):
if b not in d:
print(ans)
continue
ans += len(d[b]) * (c-b)
if c not in d:
d[c] = ()
d[c] = d[c] + d[b]
d[b] = ()
print(ans)
main() | def main():
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()))
ans = sum(A)
d = dict()
for i, a in enumerate(A):
d[a] = d.get(a, 0) + 1
for b, c in zip(B, C):
if b not in d:
print(ans)
continue
ans += d[b] * (c-b)
if c not in d:
d[c] = 0
d[c] = d[c] + d[b]
d[b] = 0
print(ans)
main() | p02630 |
import collections
def calc_sum(c):
sum_val = 0
for key, val in list(c.items()):
sum_val += key * val
return sum_val
N = int(eval(input()))
arr = list(map(int, input().split()))
Q = int(eval(input()))
actions = []
for i in range(Q):
B, C = list(map(int, input().split()))
actions.append({'B':B, 'C':C})
c = collections.Counter(arr)
for i in range(Q):
B = actions[i]['B']
C = actions[i]['C']
if B in c:
c[C] += c[B]
c.pop(B)
print((calc_sum(c))) | import collections
def calc_sum(c):
sum_val = 0
for key, val in list(c.items()):
sum_val += key * val
return sum_val
N = int(eval(input()))
arr = list(map(int, input().split()))
Q = int(eval(input()))
actions = []
for i in range(Q):
B, C = list(map(int, input().split()))
actions.append({'B':B, 'C':C})
c = collections.Counter(arr)
sum_val = calc_sum(c)
for i in range(Q):
B = actions[i]['B']
C = actions[i]['C']
if B in c:
c[C] += c[B]
sum_val += c[B] * C - c[B] * B
c.pop(B)
print(sum_val) | p02630 |
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
bcs = []
for i in range(Q):
j,k = list(map(int,input().split()))
bcs.append([j,k])
cnts = [0]*100000
for a in A:
cnts[a-1]+=1
for b,c in bcs:
t = cnts[b-1]
cnts[b-1]=0
cnts[c-1]+=t
s = 0
for i in range(1,100001):
s += cnts[i-1]*i
print(s) | N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
bcs = []
for i in range(Q):
j,k = list(map(int,input().split()))
bcs.append([j,k])
s = sum(A)
cnts = [0]*100000
for a in A:
cnts[a-1]+=1
for b,c in bcs:
t = cnts[b-1]
s -= t * b
cnts[b-1]=0
cnts[c-1]+=t
s += t*c
print(s) | p02630 |
from collections import defaultdict
N = int(eval(input()))
d = defaultdict(int)
A = list(map(int, input().split()))
for a in A:
d[a] += 1
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
d[C] += d[B]
del d[B]
ans = 0
for k, v in list(d.items()):
ans += k * v
print(ans) | from collections import defaultdict
N = int(eval(input()))
d = defaultdict(int)
A = list(map(int, input().split()))
for a in A:
d[a] += 1
Q = int(eval(input()))
ans = 0
for k, v in list(d.items()):
ans += k * v
for _ in range(Q):
B, C = list(map(int, input().split()))
d[C] += d[B]
ans -= B * d[B]
ans += C * d[B]
del d[B]
print(ans) | p02630 |
N = int(eval(input()))
given_list = [str(i) for i in input().split()]
Q = int(eval(input()))
for _ in range(Q):
query = input().split()
query = [str(i) for i in query]
B = query[0]
C = query[1]
given_list_replased = [a.replace(B, C) for a in given_list]
given_list_replased = [int(i) for i in given_list_replased]
print((sum(given_list_replased)))
given_list = [str(i) for i in given_list_replased] | N = int(eval(input()))
given_list = [str(i) for i in input().split()]
Q = int(eval(input()))
for _ in range(Q):
query = input().split()
query = [str(i) for i in query]
B = query[0]
C = query[1]
if B in given_list:
given_list = sorted(given_list)
for i in range(N):
if given_list[i] == B:
given_list[i] = C
elif int(given_list[i]) > int(C):
break
given_list = [int(i) for i in given_list]
print((sum(given_list))) #####
else:
given_list = [int(i) for i in given_list]
print((sum(given_list))) #####
given_list = [str(i) for i in given_list] | p02630 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
l = [0]*10**5
for i in a:
l[i-1] += i
q = int(eval(input()))
for i in range(q):
b,c = list(map(int, input().split()))
l[c-1] += l[b-1]//b*c
l[b-1] = 0
print((sum(l)))
if __name__=="__main__":
main()
| import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = sum(a)
l = [0]*10**5
for i in a:
l[i-1] += 1
q = int(eval(input()))
for i in range(q):
b,c = list(map(int, input().split()))
ans += (c-b)*l[b-1]
l[c-1] += l[b-1]
l[b-1] = 0
print(ans)
if __name__=="__main__":
main()
| p02630 |
import sys
def func1(lst, value):
return [i for i, x in enumerate(lst) if x == value]
def main():
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(str, input().strip().split()))
q = int(eval(input()))
bc = [list(map(str, input().split())) for _ in range(q)]
b, c = [list(i) for i in zip(*bc)]
for i in range(q):
aa = [n.replace(b[i],c[i]) for n in a]
a = aa
print((sum(list(map(int, aa)))))
if __name__ == "__main__":
main() | import sys
def func1(lst, value):
return [i for i, x in enumerate(lst) if x == value]
def main():
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(str, input().strip().split()))
q = int(eval(input()))
bc = [list(map(str, input().split())) for _ in range(q)]
b, c = [list(i) for i in zip(*bc)]
ii = 0
for i in b:
a = [n.replace(i,c[ii]) for n in a]
print((sum(list(map(int, a)))))
ii += 1
if __name__ == "__main__":
main() | p02630 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(str, input().strip().split()))
q = int(eval(input()))
bc = [list(map(str, input().split())) for _ in range(q)]
b, c = [list(i) for i in zip(*bc)]
i = 0
for _ in range(q):
a = [n.replace(b[i],c[i]) for n in a]
print((sum(list(map(int, a)))))
i += 1 | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().strip().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
b, c = [list(i) for i in zip(*bc)]
i = 0
for _ in b:
for aa in range(n):
if(a[aa]==b[i]):
a[aa]=c[i]
i += 1
print((sum(a))) | p02630 |
import collections
N = eval(input())
inp = list(map(int, input().split()))
dic = dict(collections.Counter(inp))
wa = 0
for i in range(len(dic)):
wa += list(dic.keys())[i] * list(dic.values())[i]
se = set(dic.keys())
for i in range(int(eval(input()))):
a, b = list(map(int, input().split()))
if a in se:
wa += dic[a] * (b-a)
if b in se:
pass
else:
dic[b] = 0
se.add(b)
dic[b] += dic[a]
dic[a] = 0
print(wa) | import collections
N = int(eval(input()))
inp = list(map(int,input().split()))
dic = dict(collections.Counter(inp))
wa = 0
for i, j in list(dic.items()):
wa += i * j
se = set(dic.keys())
for i in range(int(eval(input()))):
a, b = list(map(int,input().split()))
if a in se:
wa += dic[a] * (b-a)
if b in se:
pass
else:
dic[b] = 0
se.add(b)
dic[b] += dic[a]
dic[a] = 0
print(wa) | p02630 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(str,input().split()))
q = int(eval(input()))
d = defaultdict(lambda: 0)
for nums in a:
d[nums] += 1
for i in range (q):
Sum = 0
b,c = list(map(str,input().split()))
d[c] += d[b]
del d[b]
for keys in d:
cnt = d[keys]
keys = int(keys)
Sum += keys*cnt
print(Sum) | from collections import defaultdict
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
d = defaultdict(lambda: 0)
Sum = 0
for nums in a:
d[nums] += 1
for keys in d:
cnt = d[keys]
keys = int(keys)
Sum += keys*cnt
for i in range (q):
b,c = list(map(int,input().split()))
d[c] += d[b]
Sum += (c-b)*d[b]
del d[b]
print(Sum) | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = {}
for i in a:
if i in list(m.keys()):
m[i] = m[i] + 1
else:
m[i] = 1
for i in range(q):
b, c = list(map(int,input().split()))
if b in list(m.keys()):
if c in list(m.keys()):
m[c] = m[c] + m[b]
else:
m[c] = m[b]
m.pop(b)
ans = 0
for k in m:
ans += m[k] * k
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = {}
for i in a:
if i in list(m.keys()):
m[i] = m[i] + 1
else:
m[i] = 1
ans = 0
for k in m:
ans += m[k] * k
for i in range(q):
b, c = list(map(int,input().split()))
if b in list(m.keys()):
t = 0
if c in list(m.keys()):
t = m[c] * c
m[c] = m[c] + m[b]
else:
m[c] = m[b]
ans += m[c] * c - m[b] * b - t
m.pop(b)
print(ans)
| 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)]
goukeiti=sum(A)
atai=[0]*(10**5+1)
for i in A:
atai[i-1]+=1
for i in BC:
if atai[i[0]-1]!=0:
kotae=atai[i[0]-1]*i[1]-atai[i[0]-1]*(i[0])
atai[i[1]-1]+=atai[i[0]-1]
atai[i[0]-1]=0
goukeiti+=kotae
print(goukeiti)
else:
print(goukeiti) | 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)]
goukeiti=sum(A)
atai=[0]*(10**5+1)
for i in A:
atai[i-1]+=1
for i in BC:
kotae=atai[i[0]-1]*i[1]-atai[i[0]-1]*(i[0])
atai[i[1]-1]+=atai[i[0]-1]
atai[i[0]-1]=0
goukeiti+=kotae
print(goukeiti)
| p02630 |
N = int(input())
A = list(map(int, input().split()))
total = sum(A)
from collections import defaultdict
d = defaultdict(lambda: 0)
for a in A:
d[a] += 1
Q = int(input())
ans = []
for i in range(Q):
x,y = map(int, input().split())
total += y*d[x]-x*d[x]
d[y] += d[x]
d[x] = 0
ans.append(total)
print(*ans, sep='\n')
| from collections import Counter
def solve():
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
Q = int(input())
ans = [0]*Q
total = sum(A)
for i in range(Q):
x,y = map(int, input().split())
total += c[x]*(y-x)
c[y] += c[x]
c[x] = 0
ans[i] = total
return ans
print(*solve(),sep='\n')
| p02630 |
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A)
l = [[i, 0] for i in range(10**5+1)]
for _ in range(n):
l[A[_]][1] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total -= (l[b][0] * l[b][1])
total += (l[c][0] * l[b][1])
print(total)
l[c][1] += l[b][1]
l[b][1] = 0 | n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A)
l = [0 for i in range(10**5+1)]
for _ in range(n):
l[A[_]] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += (c * l[b])
total -= (b * l[b])
print(total)
l[c] += l[b]
l[b] = 0
| p02630 |
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A) # これを基に各queryに対応(加算、減算)する
l = [0 for i in range(10**5+1)] # 配列のインデックスを各valueとみなす
for _ in A: # 各インデックスに各keyを加算
l[_] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += c * l[b] # totalの調整のみ
total -= b * l[b] # 同上
print(total)
l[c] += l[b] # ここでリストの更新
l[b] = 0 # 同上
| def Replacing():
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A) # これを基に各queryに対応(加算、減算)する
l = [0 for i in range(10**5+1)] # 配列のインデックスを各valueとみなす
for _ in A: # 各インデックスに各keyを加算
l[_] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += c * l[b] # totalの調整のみ
total -= b * l[b] # 同上
print(total)
l[c] += l[b] # ここでリストの更新
l[b] = 0 # 同上
Replacing() | p02630 |
def Replacing():
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A) # これを基に各queryに対応(加算、減算)する
l = [0 for i in range(10**5+1)] # 配列のインデックスを各valueとみなす
for _ in A: # 各インデックスに各keyを加算
l[_] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += c * l[b] # totalの調整のみ
total -= b * l[b] # 同上
print(total)
l[c] += l[b] # ここでリストの更新
l[b] = 0 # 同上
Replacing() | import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A) # これを基に各queryに対応(加算、減算)する
l = [0 for i in range(10**5+1)] # 配列のインデックスを各valueとみなす
for _ in A: # 各インデックスに各keyを加算
l[_] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += c * l[b] # totalの調整のみ
total -= b * l[b] # 同上
print(total)
l[c] += l[b] # ここでリストの更新
l[b] = 0 # 同上
| p02630 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A) # これを基に各queryに対応(加算、減算)する
l = [0 for i in range(10**5+1)] # 配列のインデックスを各valueとみなす
for _ in A: # 各インデックスに各keyを加算
l[_] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += c * l[b] # totalの調整のみ
total -= b * l[b] # 同上
print(total)
l[c] += l[b] # ここでリストの更新
l[b] = 0 # 同上
| def Replacing():
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
total = sum(A) # これを基に各queryに対応(加算、減算)する
l = [0 for i in range(10**5+1)] # 配列のインデックスを各valueとみなす
for _ in A: # 各インデックスに各keyを加算
l[_] += 1
for i in range(q):
b, c = list(map(int,input().split()))
total += c * l[b] # totalの調整のみ
total -= b * l[b] # 同上
print(total)
l[c] += l[b] # ここでリストの更新
l[b] = 0 # 同上
Replacing() | p02630 |
from collections import Counter
n = int(eval(input()))
a = Counter(list(map(int, input().split())))
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
a[c] += a[b]
del a[b]
s = sum(x * y for x, y in list(a.items()))
print(s)
| from collections import Counter
n = int(eval(input()))
a = Counter(list(map(int, input().split())))
q = int(eval(input()))
s = sum(x * y for x, y in list(a.items()))
for _ in range(q):
b, c = list(map(int, input().split()))
s = s + (c - b) * a[b]
a[c] += a[b]
a[b] = 0
print(s)
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
from collections import Counter
ca = Counter(a)
def sum_dict(dic):
return sum([num*cnt for num,cnt in list(dic.items())])
for _ in range(q):
b,c = list(map(int, input().split()))
if b in ca:
cnt = ca.pop(b)
ca[c] += cnt
print((sum_dict(ca))) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
from collections import Counter
ca = Counter(a)
ans=sum(a)
for _ in range(q):
b,c = list(map(int, input().split()))
if b in ca:
cnt = ca.pop(b)
ca[c] += cnt
ans -= b * cnt
ans += c * cnt
print(ans)
| p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dic = {}
for num in A:
if num in dic:
dic[num] += 1
else:
dic[num] = 1
for _ in range(Q):
total = 0
B, C = list(map(int, input().split()))
if B in dic and C in dic:
dic[C] += dic[B]
del dic[B]
elif B in dic and C not in dic:
dic[C] = dic[B]
del dic[B]
for mykey, myvalue in list(dic.items()):
total += mykey * myvalue
print(total)
| N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dic = {}
for num in A:
if num in dic:
dic[num] += 1
else:
dic[num] = 1
prev_sum = 0
for key, value in list(dic.items()):
prev_sum += key * value
for _ in range(Q):
B, C = list(map(int, input().split()))
if B in dic and C in dic:
dic[C] += dic[B]
dif = (C - B) * dic[B]
prev_sum += dif
del dic[B]
elif B in dic and C not in dic:
dic[C] = dic[B]
dif = (C - B) * dic[B]
prev_sum += dif
del dic[B]
print(prev_sum)
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
mp = {}
for i in range(n):
if(a[i] in list(mp.keys())):
mp[a[i]] += 1
else:
mp[a[i]] = 1
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
if(b not in list(mp.keys())):
mp[b] = 0
if(c in list(mp.keys())):
mp[c] += mp[b]
else:
mp[c] = mp[b]
mp[b] = ans = 0
for k in list(mp.keys()):
ans += k * mp[k]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
mp, ans = {}, 0
for i in range(n):
if(a[i] in list(mp.keys())):
mp[a[i]] += 1
else:
mp[a[i]] = 1
for k in list(mp.keys()):
ans += k * mp[k]
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
if(b not in list(mp.keys())):
mp[b] = 0
print(ans)
continue
if(c in list(mp.keys())):
mp[c] += mp[b]
else:
mp[c] = mp[b]
ans += (c-b) * mp[b]
mp[b] = 0
print(ans) | p02630 |
N=int(eval(input()))
number=list(map(int,input().split()))
sum_number=sum(number)
Q=int(eval(input()))
number_count=[0]*100001
for i in range(100001):
number_count[i]=number.count(i)
for _ in range(Q):
B,C=list(map(int,input().split()))
sum_number += (C-B)*number_count[B]
number_count[C] += number_count[B]
number_count[B] = 0
print(sum_number)
| from collections import Counter
N=int(eval(input()))
number=list(map(int,input().split()))
sum_number=sum(number)
Q=int(eval(input()))
number_count=Counter(number)
for _ in range(Q):
B,C=list(map(int,input().split()))
sum_number += (C-B)*number_count[B]
number_count[C] += number_count[B]
number_count[B] = 0
print(sum_number) | p02630 |
n = int(eval(input()))
l_a = list(map(int, input().split()))
many = []
for i in range(1, 100001) :
many.append(l_a.count(i))
bef = sum(l_a)
q = int(eval(input()))
ans = []
for _ in range(q) :
b, c = list(map(int, input().split()))
bef += (c - b)*many[b - 1]
ans.append(bef)
many[c - 1] += many[b - 1]
many[b - 1] = 0
for value in ans :
print(value)
| import collections
n = int(eval(input()))
l_a = list(map(int, input().split()))
col = collections.Counter(l_a)
bef = sum(l_a)
q = int(eval(input()))
ans = []
for _ in range(q) :
b, c = list(map(int, input().split()))
bef += (c - b)*col[b]
ans.append(bef)
col[c] += col[b]
col[b] = 0
for value in ans :
print(value)
| p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = []
c = []
for i in range(q):
b_i, c_i = list(map(int, input().split()))
b.append(b_i)
c.append(c_i)
res = {}
for a_i in a:
if not a_i in res:
res[a_i] = 0
res[a_i] += 1
for b_i, c_i in zip(b, c):
num = res[b_i] if b_i in res else 0
res[b_i] = 0
if not c_i in res:
res[c_i] = 0
res[c_i] += num
ans = 0
for key, val in list(res.items()):
ans += key * val
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = []
c = []
for i in range(q):
b_i, c_i = list(map(int, input().split()))
b.append(b_i)
c.append(c_i)
res = {}
for a_i in a:
if not a_i in res:
res[a_i] = 0
res[a_i] += 1
ans = 0
for key, val in list(res.items()):
ans += key * val
for b_i, c_i in zip(b, c):
num = res[b_i] if b_i in res else 0
res[b_i] = 0
if not c_i in res:
res[c_i] = 0
res[c_i] += num
ans += (c_i - b_i) * num
print(ans)
| p02630 |
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
B=[]
C=[]
for i in range(q):
b1,c1=list(map(int, input().split()))
B.append(b1)
C.append(c1)
# print(A)
for i in range(q):
A=[ C[i] if B[i]==a else a for a in A ]
print((sum(A)))
| n=int(eval(input()))
A=list(map(int,input().split()))
asum = sum(A)
S={}
for i in range(len(A)):
if A[i] in S:
S[A[i]]+=1
else:
S[A[i]]=1
D=[]
q=int(eval(input()))
for i in range(q):
diff=0
b,c =list(map(int,input().split()))
if not c in S:
S[c]=0
if b in S:
diff = (S[b]*c-S[b]*b)
S[c]+=S[b]
S[b]=0
asum+=diff
D.append(asum)
for d in D:
print(d)
| p02630 |
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
L=[0]*(10**5)
for i in A:L[i-1]+=i
for i in range(Q):
B,C=list(map(int,input().split()))
L[C-1]+=(L[B-1]//B)*C;L[B-1]=0
print((sum(L))) | N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
L=[0]*(10**5)
S=sum(A)
for i in A:L[i-1]+=1
for i in range(Q):
B,C=list(map(int,input().split()));B-=1;C-=1
S+=((C+1)-(B+1))*L[B]
L[C]+=L[B];L[B]=0
print(S) | p02630 |
n = int(eval(input()))
a = list(map(str, input().split()))
q = int(eval(input()))
for i in range(q):
b, c = list(map(str, input().split()))
num = ",".join(a)
num = num.replace(b, c)
a = num.split(",")
ans = list(map(int, a))
print((sum(ans))) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
def list1(n):
if n == b:
return c
else:
return n
for i in range(q):
b, c = list(map(int, input().split()))
a = list(map(list1, a))
print((sum(a)))
| 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)]
array = [0]*(10**5+1)
for a in A:
array[a] += 1
for bc in BC:
b, c = bc
array[c] += array[b]
array[b] = 0
total = 0
for i in range(10 ** 5 + 1):
total += i * array[i]
print(total)
| # 入力
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = [list(map(int, input().split())) for _ in range(Q)]
array = [0]*(10**5+1)
total = sum(A)
for a in A:
array[a] += 1
for bc in BC:
b, c = bc
total += c*array[b]-b*array[b]
array[c] += array[b]
array[b] = 0
print(total)
| p02630 |
from collections import Counter
from sys import stdin
N = int(stdin.readline().rstrip())
A = Counter([int(_) for _ in stdin.readline().rstrip().split()])
Q = int(stdin.readline().rstrip())
BC = [list(map(int, stdin.readline().rstrip().split())) for _ in range(Q)]
ans = []
for bc in BC:
if bc[1] not in A:
A[bc[1]] = A[bc[0]]
else:
A[bc[1]] += A[bc[0]]
A.pop(bc[0], None)
ans.append(sum(k*v for k, v in list(A.items())))
for a in ans:
print(a) | from collections import Counter
from sys import stdin
N = int(stdin.readline().rstrip())
A = [int(_) for _ in stdin.readline().rstrip().split()]
CA = Counter(A)
Q = int(stdin.readline().rstrip())
ans = sum(A)
for i in range(Q):
b, c = [int(_) for _ in stdin.readline().rstrip().split()]
ans += (c-b)*CA[b]
CA[c] += CA[b]
CA[b] = 0
print(ans) | p02630 |
from collections import Counter
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
dict_A = Counter(A)
sum_list = sum(A)
for i in range(q):
b, c = list(map(int, input().split()))
if b not in dict_A:
print(sum_list)
else:
dict_A[c] += dict_A[b]
dict_A[b] = 0
sum_list = 0
for key, value in list(dict_A.items()):
sum_list += key * value
print(sum_list) | from collections import Counter
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
dict_A = Counter(A)
sum_list = sum(A)
for i in range(q):
b, c = list(map(int, input().split()))
if b not in dict_A:
print(sum_list)
else:
b_num = dict_A[b]
dict_A[c] += dict_A[b]
dict_A[b] = 0
sum_list = sum_list + (c - b) * b_num
print(sum_list)
| p02630 |
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
q = int(eval(input()))
l1 = [0]*(10**5+10)
l2 = [0]*(10**5+10)
index = 0
l1[0] = a[0]
l2[0] = 1
for i in a[1:]:
if i == l1[index]:
l2[index] += 1
else:
index += 1
l1[index] = i
l2[index] = 1
s = sum(a)
for _ in range(q):
b, c = list(map(int, input().split()))
i = 0
while i < index + 2:
if (b == l1[i]):
break
i += 1
if i > index:
print(s)
continue
j = 0
while j < index + 2:
if(c == l1[j]):
break
j += 1
if j > index:
index = j
l1[index] = c
s += (c - b) * l2[i]
l2[j] += l2[i]
l2[i] = 0
print(s)
| n = int(eval(input()))
a = sorted(list(map(int, input().split())))
q = int(eval(input()))
l = [0]*(10**5+10)
for i in a:
l[i] += 1
s = sum(a)
for _ in range(q):
b, c = list(map(int, input().split()))
s += (c - b) * l[b]
l[c] += l[b]
l[b] = 0
print(s)
| p02630 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
dict = {}
for i in range(1, 10**5+1):
dict[i] = 0
for i in a:
dict[i] += 1
for i in range(q):
b, c = list(map(int, input().split()))
dict[c] += dict[b]
dict[b] = 0
ans = 0
for i, j in list(dict.items()):
ans += i*j
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
dict = {}
for i in range(1, 10**5+1):
dict[i] = 0
for i in a:
dict[i] += 1
s = sum(a)
for i in range(q):
b, c = list(map(int, input().split()))
s += (c-b)*dict[b]
dict[c] += dict[b]
dict[b] = 0
print(s) | p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
suma = sum(a)
counter = Counter(a)
for i in range(q):
suma -= bc[i][0] * counter[bc[i][0]]
suma += bc[i][1] * counter[bc[i][0]]
counter[bc[i][1]] += counter[bc[i][0]]
counter[bc[i][0]] = 0
print(suma)
| from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
suma = sum(a)
counter = Counter(a)
for b, c in bc:
suma -= b * counter[b]
suma += c * counter[b]
counter[c] += counter[b]
counter[b] = 0
print(suma)
| p02630 |
def solve():
N = int(eval(input()))
s = 0
n = [0 for _ in range(100000+1)]
for a in map(int, input().split()):
s += a
n[a] += 1
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
s += (c - b) * n[b]
print(s)
n[c] += n[b]
n[b] = 0
if __name__ == '__main__':
solve()
| def solve():
N = int(eval(input()))
s = 0
n = [0] * (10**5+1)
for a in map(int, input().split()):
s += a
n[a] += 1
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
s += (c - b) * n[b]
print(s)
n[c] += n[b]
n[b] = 0
if __name__ == '__main__':
solve()
| p02630 |
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
arr = [0] * (10**5+1)
# arr = [i for i in range(1, 10**5+1)]
for i in A:
arr[i] += i
for _ in range(q):
b, c = list(map(int, input().split()))
arr[c] += (arr[b]//b*c)
arr[b] = 0
print((sum(arr)))
| n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
from collections import Counter
arr = Counter(A)
ans = sum([i*arr[i] for i in arr])
for i in range(q):
b,c = list(map(int,input().split()))
ans += (c-b)*arr[b]
arr[c],arr[b] = arr[c]+arr[b],0
print(ans) | p02630 |
import collections
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
b=[[int(i) for i in input().split()] for l in range(q)]
c=collections.Counter(a)
for x in b:
c[x[0]],c[x[1]]=0,c[x[0]]+c[x[1]]
print((sum([j*k for j,k in list(c.items())]))) | import collections
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
b=[[int(i) for i in input().split()] for l in range(q)]
c=collections.Counter(a)
s=sum([j*k for j,k in list(c.items())])
for x in b:
s=s-x[0]*c[x[0]]+x[1]*c[x[0]]
c[x[0]],c[x[1]]=0,c[x[0]]+c[x[1]]
print(s) | p02630 |
from collections import Counter
N=int(eval(input()))
A=list(map(int, input().split()))
q=int(eval(input()))
Q=[list(map(int, input().split())) for _ in range(q)]
L=[0]*(10**5+1)
B=dict(Counter(A))
for k in list(B.keys()):
L[k]=B[k]
# print(L)
C=set(B)
sum = 0
for k in list(B.keys()):
sum += k*B[k]
for i in range(q):
x=Q[i][0]
y=Q[i][1]
if L[x]==0:
print(sum)
continue
L[y]+=L[x]
L[x]=0
C.add(y)
C.remove(x)
sum=0
for k in C:
sum+=k*L[k]
print(sum) | N=int(eval(input()))
A=list(map(int, input().split()))
q=int(eval(input()))
Q=[list(map(int, input().split())) for _ in range(q)]
L=[0]*(10**5+1)
S=0
for i in range(N):
L[A[i]]+=1
S+=A[i]
for i in range(q):
S+=L[Q[i][0]]*(Q[i][1]-Q[i][0])
L[Q[i][1]]+=L[Q[i][0]]
L[Q[i][0]]=0
# print(L)
print(S) | p02630 |
N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
BC=[]
for i in range(Q):
b,c=(list(map(int,input().split())))
BC.append([b,c])
#最初に全探索で位置をインデックスに登録する
DP=[[] for _ in range(10**5+1)]
for i in range(len(A)):
DP[A[i]].append(i)#
ans=sum(A)
for i in BC:
target=i[0]
nex=i[1]
for j in DP[target]:
A[j]=nex
DP[nex].append(j)
ans-=target
ans+=nex
print(ans)
DP[target]=[] | N=int(eval(input()))
A=list(map(int,input().split()))
Q=int(eval(input()))
BC=[]
for i in range(Q):
b,c=(list(map(int,input().split())))
BC.append([b,c])
#最初に全探索で位置をインデックスに登録する
DP=[0]*(10**5+1)
for i in A:
DP[i]+=1#
ans=sum(A)
for i in BC:
target=i[0]
nex=i[1]
num=DP[target]
DP[target]=0
DP[nex]=DP[nex]+num
ans=ans+num*nex-num*target
print(ans)
| p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
z=[0]*((10**5)+1)
for i in range(n):
z[a[i]]+=1
q=int(eval(input()))
y=[]
for i in range(q):
b,c=list(map(int,input().split()))
z[c]+=z[b]
z[b]=0
#print(z)
sam=0
for j in range(len(z)):
sam+=z[j]*j
y.append(sam)
for i in range(len(y)):
print((y[i])) | n=int(eval(input()))
a=list(map(int,input().split()))
z=[0]*((10**5)+1)
for i in range(n):
z[a[i]]+=1
q=int(eval(input()))
y=[]
sam=sum(a)
for i in range(q):
b,c=list(map(int,input().split()))
z[c]+=z[b]
sam-=z[b]*b
sam+=z[b]*c
z[b]=0
#print(z)
y.append(sam)
for i in range(len(y)):
print((y[i])) | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
q = int(eval(input()))
b = []
c = []
# diff = []
for i in range(q):
_ = list(map(int, input().split()))
c.append(_[1])
b.append(_[0])
for i in range(q):
for j in range(n):
if b[i] == a[j]:
a[j] = c[i]
print((sum(a)))
| n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
b = []
c = []
for i in range(q):
_ = list(map(int, input().split()))
c.append(_[1])
b.append(_[0])
s = sum(a)
# 辞書型で度数を持つ
hist = {}
for i in range(n):
if a[i] in hist:
hist[a[i]] += 1
else:
hist[a[i]] = 1
# print(hist)
for i in range(q):
diff = c[i] - b[i]
if b[i] in hist:
s += hist[b[i]]*diff
print(s)
if c[i] in hist:
hist[c[i]] += hist[b[i]]
del hist[b[i]]
else:
hist[c[i]] = hist[b[i]]
del hist[b[i]]
else:
print(s)
# print(hist)
| p02630 |
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
B = []
C = []
for i in range(Q):
a, b = list(map(int, input().split()))
B.append(a)
C.append(b)
d = collections.Counter(A)
ans = 0
c = list(d.keys())
cs = list(d.values())
for i in range(Q):
l=[j for j,x in enumerate(c) if x == B[i]]
for k in l:
c[k]=C[i]
for m in range(len(c)):
ans += c[m]*cs[m]
print(ans)
ans = 0
| n = int(eval(input()))
a = [int(i) for i in input().split()]
q = int(eval(input()))
num = [0] * 100010
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(int, input().split()))
for i in a:
num[i] += 1
s = sum(a)
for i in range(q):
s += (c[i]-b[i])*num[b[i]]
num[c[i]] += num[b[i]]
num[b[i]] = 0
print(s)
| p02630 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
q = int(eval(input()))
num = [0] * 100010
b = [0] * q
c = [0] * q
for i in range(q):
b[i], c[i] = list(map(int, input().split()))
for i in a:
num[i] += 1
s = sum(a)
for i in range(q):
s += (c[i]-b[i])*num[b[i]]
num[c[i]] += num[b[i]]
num[b[i]] = 0
print(s)
| N = int(eval(input()))
A = list(map(int, input().split()))
LIST = [0]*(100001)
Q = int(eval(input()))
b =[0]*Q
c =[0]*Q
for i in range(Q):
b[i], c[i] = list(map(int, input().split()))
for i in A:
LIST[i]+=1
s = sum(A)
for i in range(Q):
s += LIST[b[i]]*(c[i]-b[i])
LIST[c[i]]+=LIST[b[i]]
LIST[b[i]] = 0
print(s)
| p02630 |
N = int(eval(input()))
a=list(map(int, input().split()))
Q = int(eval(input()))
num_a =[0]*100001
num_b = []
sum_a = sum(a)
b=[]
c=[]
for i in range(Q):
b1,c1=list(map(int, input().split()))
b.append(b1)
c.append(c1)
if b[i] not in a:
continue
elif num_a[b[i]]>0:
continue
else:
num_a[b[i]] = a.count(b[i])
for i in range(Q):
if num_a[b[i]]==0:
num_b.append(0)
sum_a = sum_a - b[i]*num_b[i] +c[i]*num_b[i]
else:
num_b.append(num_a[b[i]])
num_a[c[i]] += num_a[b[i]]
num_a[b[i]] = 0
sum_a = sum_a - b[i]*num_b[i] +c[i]*num_b[i]
print(sum_a)
| N = int(eval(input()))
a=list(map(int, input().split()))
Q = int(eval(input()))
num_a =[0]*100001
num_b = []
sum_a = sum(a)
b=[]
c=[]
for i in a:
num_a[i]+= 1
for i in range(Q):
b1,c1=list(map(int, input().split()))
b.append(b1)
c.append(c1)
for i in range(Q):
if num_a[b[i]]==0:
num_b.append(0)
sum_a = sum_a - b[i]*num_b[i] +c[i]*num_b[i]
else:
num_b.append(num_a[b[i]])
num_a[c[i]] += num_a[b[i]]
num_a[b[i]] = 0
sum_a = sum_a - b[i]*num_b[i] +c[i]*num_b[i]
print(sum_a) | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
ans=[0]*(10**5+1)
for i in a:
ans[i]+=1
for i in range(q):
x=0
b,c=list(map(int,input().split()))
ans[c]+=ans[b]
ans[b]=0
for j in range(10**5+1):
if ans[j]==0:
continue
x+=(ans[j])*j
print(x) | N = int(eval(input()))
A = list(map(int, input().split()))
L = [0] * (100001)
s = sum(A)
for a in A:
L[a] += 1
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
L[C] += L[B]
s += L[B] * (C-B)
L[B] = 0
print(s)
| p02630 |
N = int(eval(input()))
A = sorted(map(int, input().split()))
ans = sum(A)
nums = [A.count(num) for num in range(10 ** 5 + 1)]
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
ans += (C - B) * nums[B]
nums[C] += nums[B]
nums[B] = 0
print(ans) | import collections
N = int(eval(input()))
A = sorted(map(int, input().split()))
cnt = collections.defaultdict(int)
for a in A:
cnt[a] += 1
ans = sum(A)
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
ans += (C - B) * cnt[B]
cnt[C] += cnt[B]
cnt[B] = 0
print(ans)
| p02630 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
q=int(eval(input()))
bc=[]
for i in range(q):
bc.append([int(i) for i in input().split()])
import collections
collect = collections.Counter(a)
for i in bc:
if i[1] in collect:
collect[i[1]] += collect.pop(i[0],0)
else:
if i[0] in collect:
collect[i[1]] = collect.pop(i[0],0)
ans=0
for k,v in list(collect.items()):
ans += (k * v)
print(ans)
| #sum を計算しておく
n=int(eval(input()))
a=[int(i) for i in input().split()]
a.sort()
q=int(eval(input()))
bc=[]
for i in range(q):
bc.append([int(i) for i in input().split()])
import collections
collect = collections.Counter(a)
ans=0
for k,v in list(collect.items()):
ans += (k * v)
for i in bc:
if i[0] in collect:
if i[1] in collect:
ans += ((i[1]-i[0]) * collect[i[0]])
collect[i[1]] += collect.pop(i[0],0)
else:
ans += ((i[1]-i[0]) * collect[i[0]])
collect[i[1]] = collect.pop(i[0],0)
print(ans) | p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
num = Counter(A)
for i in range(Q):
b,c = list(map(int,input().split()))
num[c] += num[b]
num[b] = 0
sums = 0
for j in num:
sums += num[j]*j
print(sums) | from collections import Counter
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
ans = sum(A)
num = Counter(A)
for i in range(Q):
b,c = list(map(int,input().split()))
ans += (c-b)*num[b]
num[c] += num[b]
num[b] = 0
print(ans) | p02630 |
import collections
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)
# print(N,A,Q,B,C)
a = []
a = dict(collections.Counter(A))
# print(a)
# d1 = {'k1': 1, 'k2': 2}
# d2 = {'k1': 100, 'k3': 3, 'k4': 4}
# d1.update(d2)
# print(d1)
# # {'k1': 100, 'k2': 2, 'k3': 3, 'k4': 4}
# これを用いれば良い。
for i in range(Q):
# 変更後
after = {B[i]: 0, C[i]: a.setdefault(B[i], 0) + a.setdefault(C[i], 0)}
# print(a, after)
a.update(after)
s = 0
for k in a:
s += k * a[k]
print(s)
# print(a)
| import collections
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)
# print(N,A,Q,B,C)
a = []
a = dict(collections.Counter(A))
s = 0
for k in a:
s += k * a[k]
# print(s)
# sに対する増減だけ管理する
for i in range(Q):
# 変更後
after = {B[i]: 0, C[i]: a.setdefault(B[i], 0) + a.setdefault(C[i], 0)}
# print(a, after)
s = s + (C[i] - B[i] ) * a[B[i]]
print(s)
a.update(after)
| p02630 |
from collections import Counter
n = int(eval(input()))
cnt = Counter(list(map(int, input().split())))
q = int(eval(input()))
Asum = sum(k*v for k, v in list(cnt.items()))
for _ in range(q):
b, c = list(map(int, input().split()))
cnt[c] += cnt[b]
Asum += c*cnt[b]-b*cnt[b]
cnt[b] = 0
print(Asum)
| from collections import Counter
n = int(eval(input()))
cnt = Counter(list(map(int, input().split())))
Asum = sum(k*v for k, v in list(cnt.items()))
q = int(eval(input()))
for _ in range(q):
b, c = list(map(int, input().split()))
Asum += (c-b)*cnt[b]
print(Asum)
cnt[b], cnt[c] = 0, cnt[b]+cnt[c]
| p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
ans = sum(a)
many =[0]*(10**5)
bc = [0]*q
for i in range(10**5) :
many[i] = a.count(i+1)
for i in range(q) :
bc[i] = list(map(int,input().split()))
for i in range(q) :
ans += (bc[i][1] - bc[i][0]) * many[bc[i][0] - 1]
print(ans)
many[bc[i][1]-1] += many[bc[i][0]-1]
many[bc[i][0]-1] =0
| n = int(eval(input()))
A = list(map(int,input().split()))
q = int(eval(input()))
ans = sum(A)
many =[0]*(10**5 + 1)
for a in A :
many[a] += 1
for i in range(q) :
B,C = (int(a) for a in input().split())
many[C] += many[B]
ans += many[B] * (C-B)
many[B] = 0
print(ans) | 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)]
anum=[]
asum=sum(a) #当初の数列Aの要素の和
for i in a:
acnt=a.count(i)
anum.append([i,acnt])
d=dict(anum) #当初の数列Aの各整数の数のdictionary
for i in range(q):
if bc[i][0] not in list(d.keys()):
print(asum)
if bc[i][0] in list(d.keys()):
x=(bc[i][1]-bc[i][0])*d[bc[i][0]]
print((asum+x))
asum+=x
if bc[i][1] in list(d.keys()):
d[bc[i][1]]=d[bc[i][1]]+d[bc[i][0]]
d[bc[i][0]]=0
else:
d[bc[i][1]]=d[bc[i][0]]
d[bc[i][0]]=0 | 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)]
asum=sum(a) #当初の数列Aの要素の和
d={}
for i in a:
if i in d:
d[i]+=1
else:
d[i]=1
for b,c in bc:
if b in d:
asum+=d[b]*(c-b)
if c in d:
d[c]+=d[b]
else:
d[c]=d[b]
d[b]=0
print(asum) | p02630 |
from collections import Counter
def resolve():
N = int(eval(input()))
countA = Counter([int(x) for x in input().split(" ")])
Q = int(eval(input()))
sum_A = 0
for a in list(countA.keys()):
sum_A += a*countA[a]
for _ in range(Q):
B, C = list(map(int, input().split(" ")))
if B in list(countA.keys()):
countA[C] += countA.pop(B)
sum_A = 0
for a in list(countA.keys()):
sum_A += a*countA[a]
print(sum_A)
else:
print(sum_A)
if __name__ == "__main__":
resolve() | from collections import Counter
def resolve():
N = int(eval(input()))
countA = Counter([int(x) for x in input().split(" ")])
Q = int(eval(input()))
sum_A = 0
for a in list(countA.keys()):
sum_A += a*countA[a]
for _ in range(Q):
B, C = list(map(int, input().split(" ")))
if B in list(countA.keys()):
target_value = countA.pop(B)
sum_A += (C - B) * target_value
countA[C] += target_value
print(sum_A)
else:
print(sum_A)
if __name__ == "__main__":
resolve() | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
r = []
for _ in range(q):
r.append(list(map(int, input().split())))
s = {}
for v in a:
if v in s:
s[v] += v
else:
s[v] = v
for t in r:
if t[0] in s:
n = s[t[0]] // t[0] * t[1]
if t[1] in s:
s[t[1]] += n
else:
s[t[1]] = n
del s[t[0]]
print((sum(s.values())))
| n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
r = []
for _ in range(q):
r.append(list(map(int, input().split())))
s = {}
for v in a:
if v in s:
s[v] += v
else:
s[v] = v
p = sum(s.values())
for t in r:
if t[0] in s:
n = s[t[0]] // t[0] * t[1]
p = p - s[t[0]] + n
if t[1] in s:
s[t[1]] += n
else:
s[t[1]] = n
del s[t[0]]
print(p) | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
num=[[a.count(i+1)] for i in range(10**5)]
ans=sum(a)
for i in range(q):
b,c=list(map(int,input().split()))
ans=ans+(c-b)*num[b-1][0]
num[c-1][0]+=num[b-1][0]
num[b-1][0]=0
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
num=[0]*(10**5+1)
ans=sum(a)
for i in a:
num[i]+=1
for i in range(q):
b,c=list(map(int,input().split()))
ans=ans+(c-b)*num[b]
num[c]+=num[b]
num[b]=0
print(ans)
| p02630 |
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
indices = collections.defaultdict(list)
for i, a in enumerate(A):
indices[a].append(i)
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
for i in indices[B]:
indices[C].append(i)
A[i] = C
print((sum(A))) | import collections
N = int(eval(input()))
A = list(map(int, input().split()))
count = collections.defaultdict(int)
currSum = 0
for a in A:
count[a] += 1
currSum += a
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
currSum += (count[B] * (C - B))
count[C] += count[B]
count[B] = 0
print(currSum) | p02630 |
def main():
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
B = [list(map(int,input().split())) for _ in range(Q)]
dict = {}
for i in range(1,10**5+1):
#for i in range(1,6):
dict[i] = 0
for i in range(N):
dict[A[i]] += 1
for i in range(Q):
dict[B[i][1]] += dict[B[i][0]]
dict[B[i][0]] = 0
#print(dict)
sum = 0
for i in range(1,10**5+1):
#for i in range(1,6):
if dict[i] != 0:
sum += dict[i]*i
print(sum)
main()
| def main():
N = int(eval(input()))
A = list(map(int,input().split()))
Q = int(eval(input()))
B = [list(map(int,input().split())) for _ in range(Q)]
dict = {}
for i in range(1,10**5+1):
#for i in range(1,6):
dict[i] = 0
for i in range(N):
dict[A[i]] += 1
sum = 0
for i in range(1,10**5+1):
#for i in range(1,6):
if dict[i] != 0:
sum += dict[i]*i
for i in range(Q):
sum = sum +(dict[B[i][0]]*B[i][1] - dict[B[i][0]]*B[i][0])
dict[B[i][1]] += dict[B[i][0]]
dict[B[i][0]] = 0
#print(dict)
print(sum)
main()
| p02630 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
x = Counter(a)
for b, c in bc:
x[c] += x[b]
x[b] = 0
ans = 0
for key, value in x.most_common():
ans += key * value
print(ans)
| from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
bc = [list(map(int, input().split())) for _ in range(q)]
x = Counter(a)
ans = sum(a)
for b, c in bc:
ans += (c - b) * x[b]
print(ans)
x[c] += x[b]
x[b] = 0
| p02630 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
q = int(eval(input()))
bc=[]
for i in range(q):
bc.append([int(x) for x in input().split()])
a_cnt=[0]*(10**5+1)
for i in range(max(a)+1):
a_cnt[i]=a.count(i)
a_goukei=sum(a)
for gyou in range(q):
a_goukei+=(bc[gyou][1]-bc[gyou][0])*a_cnt[bc[gyou][0]]
print(a_goukei)
a_cnt[bc[gyou][1]]+=a_cnt[bc[gyou][0]]
a_cnt[bc[gyou][0]]=0 | n = int(eval(input()))
a = [int(x) for x in input().split()]
q = int(eval(input()))
bc=[]
for i in range(q):
bc.append([int(x) for x in input().split()])
a_cnt=[0]*(10**5+1)
for i in range(len(a)):
a_cnt[a[i]]+=1
a_goukei=sum(a)
for gyou in range(q):
a_goukei+=(bc[gyou][1]-bc[gyou][0])*a_cnt[bc[gyou][0]]
print(a_goukei)
a_cnt[bc[gyou][1]]+=a_cnt[bc[gyou][0]]
a_cnt[bc[gyou][0]]=0 | p02630 |
import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 8)
def main():
N = int(readline())
A = [0] *(10**5+1)
total = 0
for a in map(int, readline().split()):
total += a
A[a] += 1
Q = int(readline())
for _ in range(Q):
b, c = list(map(int, readline().split()))
total += A[b]*(c-b)
print(total)
A[c] += A[b]
A[b] = 0
if __name__ == '__main__':
main() | import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.read
def main():
N = int(readline())
A = [0] *(10**5+1)
total = 0
for a in map(int, readline().split()):
total += a
A[a] += 1
Q = int(readline())
for _ in range(Q):
b, c = list(map(int, readline().split()))
total += A[b]*(c-b)
print(total)
A[c] += A[b]
A[b] = 0
if __name__ == '__main__':
main() | p02630 |
# collect input N integers
# replace every element whose value is Bi with Ci
# get input x and y and compute them to display output
from collections import Counter
n=eval(input())
a=list(map(int,input().split()))
b=Counter(a)
n=int(eval(input()))
ans=sum(a)
for i in range(n):
x,y=list(map(int,input().split()))
ans+=b[x]*(y-x)
print(ans)
b[y]+=b[x]
b[x]=0 | n = int(input())
a = [int(x) for x in input().split()]
q = int(input())
op = []
for _ in range(q):
v = input().split()
op.append([int(x) for x in v])
d = {}
total = 0
for v in a:
d[v] = d.get(v, 0) + 1
total += v
for src, dest in op:
c = d.pop(src, 0)
d[dest] = d.get(dest, 0) + c
total += c * (dest - src)
print(total) | p02630 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.