input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python3
import sys
def solve(N: int, S: str):
answer = 0
for i in range(0,1000):
i = str(i).zfill(3)
index = 0
for ss in S:
if ss == i[index]:
index += 1
if index >= 3:
answer += 1
... | #!/usr/bin/env python3
import sys
def solve(N: int, S: str):
answer = 0
for i in range(0,1000):
i = str(i).zfill(3)
x = S.find(i[0])
if x == -1:
continue
y = S.find(i[1],x+1)
if y == -1:
continue
z = S.find(i[2],y+1)
... | p02844 |
from pprint import pprint
import sys
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
count = 0
for i in range(1000):
pin = str(i).zfill(3)
start = 0
flags = [False] * 3
for i, pin_i in enumerate(pin):
flag = False
for j, s_j in enumerate(s):
... | import sys
N = int(sys.stdin.readline())
S = sys.stdin.readline()
ans = 0
for i in range(1000):
password = str(i).zfill(3)
p_i = 0
s_i = 0
while s_i < len(S) and p_i < 3:
# print(p_i, s_i)
if S[s_i] == password[p_i]:
p_i += 1
s_i += 1
if p_i == 3:... | p02844 |
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
# 初期入力 ２０２０－０７２７ 21：50
from collections import Counter
import sys
input = sys.stdin.readline #文字列では使わない
N = int(eval(input()))
*S, =input().strip()
"""
c =Counter(S)
ans =combinations_c... | # forしながらif、ifでないときはforしないので、計算量減
# 初期入力 ２０２０－０７２７ 21：50
from collections import Counter
import sys
input = sys.stdin.readline #文字列では使わない
N = int(eval(input()))
*S, =input().strip()
"""
c =Counter(S)
ans =combinations_count(N, 3) -len(c)
"""
count =0
x100=0
x10=0
x1=0
for i in range(10):
if str(i)... | p02844 |
def strKey(key):
if key == 0:
return '000'
if 1<= key <= 9:
return '00' + str(key)
if 10<= key <=99:
return '0' + str(key)
return str(key)
N = int(eval(input()))
s = input().strip()
cnt = 0
for key in range(1000):
key = strKey(key) #; print(key)
isFl... | N = int(eval(input()))
s = input().strip()
cnt = 0
for key in range(1000):
key = '{:0>3}'.format(str(key)) #; print(key)
i0 = s.find(key[0])
if 0 <= i0 < N-2:
i1 = s.find(key[1], i0+1)
if 0 < i1 < N-1:
i2 = s.find(key[2], i1+1)
if i2 != -1:
... | p02844 |
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
S = readline()
count = 0
for i in range(0,1000):
c = (i//100,(i//10)%10,i%10)
f = 0
for j in range(0,N):
if int(S[j]... | #!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
S = readline()
count = 0
for i in range(10):
a = S.find(str(i))
if a == -1:
continue
for j in range(10):
b... | p02844 |
# coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
s = args[1]
ret = 0
for i in range(1000):
iii = '{:03d}'.format(i)
j = 0
for k in range(n):
if s[k] == iii[j]:
j += 1
if j == 3:
ret += 1... | # coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
s = args[1]
ret = 0
index = [[] for _ in range(10)]
for i in range(n):
index[int(s[i])].append(i)
for i in range(1000):
iii = '{:03d}'.format(i)
cur = -1
found = False
for... | p02844 |
import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
def sumitrust2019_d(a,b,c,s):
a,b,c = list(map(str,[a,b,c]))
for idx_a in range(len(s)-2):
if s[idx_a] == a:
... | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
def sumitrust2019_d(a,b,c,s):
abc = list(map(str,[a,b,c]))
now = 0
for i in range(len(s)):
if s[i] == abc[now]:
... | p02844 |
import sys
from itertools import product
from string import digits
def main():
n, s = sys.stdin.read().split()
n = int(n)
cand = list(''.join(p) for p in product(digits, repeat=3))
res = set()
for c in cand:
i = s.find(c[0])
if i == -1:
continue
... | import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
res = []
for i in digits:
x = s.find(i)
if x == -1:
continue
for j in digits:
y = s.find(j, x+1)
if y == -1:
continue
for ... | p02844 |
import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
n = int(n)
place = dict((i, set()) for i in digits)
for i in range(n):
place[s[i]].add(i)
l = [None] * n
l[0] = set()
for i in range(1, n):
l[i] = l[i-1] | set([s[i-1]])
... | import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
n = int(n)
place = dict((i, set()) for i in digits)
for i in range(n):
place[s[i]].add(i)
l = [None] * n
l[0] = set()
for i in range(1, n):
l[i] = l[i-1] | set([s[i-1]])
... | p02844 |
import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
n = int(n)
place = dict((i, set()) for i in digits)
for i in range(n):
place[s[i]].add(i)
l = [None] * n
l[0] = set()
for i in range(1, n):
l[i] = l[i-1] | set([s[i-1]])
... | import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
n = int(n)
place = dict((i, list()) for i in digits)
for i in range(n):
place[s[i]].append(i)
l = [None] * n
l[0] = set()
for i in range(1, n):
l[i] = l[i-1] | set([s[i-1]])
... | p02844 |
import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
n = int(n)
place = dict((i, list()) for i in digits)
for i in range(n):
place[s[i]].append(i)
l = [None] * n
l[0] = set()
for i in range(1, n):
l[i] = l[i-1] | set([s[i-1]])
... | import sys
from string import digits
def main():
n, s = sys.stdin.read().split()
cnt = 0
for i in digits:
x = s.find(i)
if x == -1:
continue
for j in digits:
y = s.find(j, x + 1)
if y == -1:
continue
for... | p02844 |
import bisect
import collections
def read():
N = int(input().strip())
S = str(input().strip())
return N, S
def dig(S, T, N):
for i in range(N):
if S[i] == T[0]:
for j in range(i+1, N):
if S[j] == T[1]:
for k in range(... | import bisect
import collections
def read():
N = int(input().strip())
S = str(input().strip())
return N, S
def dig(S, T, N):
k0, k1, k2 = -1, -1, -1
for i in range(N):
if S[i] == T[0]:
k0 = i
break
if k0 == -1:
return False
for i in r... | p02844 |
import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
S = input().rstrip()
s = set()
l = list(itertools.combinations(S, 3))
for x in l:
s.add(x[0]+x[1]+x[2])
print((len(s)))
| import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
S = input().rstrip()
s = set()
for i in range(0, N-2):
for j in range(i+1, N-1):
for k in range(j+1, N):
s.add(S[i]+S[j]+S[k])
print((len(s)))
| p02844 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
S = input().rstrip()
ans = 0
for i in range(1000):
t = str(i).zfill(3)
ti = 0
for j in range(N):
if S[j] == t[ti]:
ti += 1
if ti == 3:
break
if ti == 3:
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
S = input().rstrip()
ans = 0
for i in range(1000):
t = str(i).zfill(3)
t1 = S.find(t[0])
if t1 == -1:
continue
t2 = S.find(t[1], t1+1)
if t2 == -1:
continue
t3 = S.find(t... | p02844 |
N = int(eval(input()))
S = input().rstrip()
dp = [[[[False for _ in range(11)] for _ in range(11)]
for _ in range(11)] for _ in range(N + 1)]
for i in range(N):
num = int(S[i])
for j in range(11):
for k in range(11):
for l in range(11):
dp[i + 1][num][10][... | N = int(eval(input()))
S = input().rstrip()
ans = 0
for i in range(10):
for j in range(10):
for k in range(10):
num = str(i) + str(j) + str(k)
tmp = 0
for s in S:
if num[tmp] == s:
tmp += 1
if tmp >= 3... | p02844 |
import sys
import math
input = sys.stdin.readline
def main():
sc = Scan()
N = sc.intarr()[0]
S = sc.strarr()[0]
count = 0
for i in range(1000):
# print("--------")
lucky = format_str(i)
Flag = 0
for j in range(N):
if S[j] == lucky[Flag... | import sys
import math
input = sys.stdin.readline
def main():
sc = Scan()
_ = sc.intarr()[0]
S = sc.strarr()[0]
count = 0
for i in range(1000):
# print("--------")
lucky = format_str(i)
first = S.find(lucky[0])
third = S.rfind(lucky[2])
... | p02844 |
import sys
input = sys.stdin.readline # 改行コード「\n」を呼んでしまうため、文字数など、注意！！
n = int(input().replace("\n",""))
s = input().replace("\n","")
anslist = []
ans = 0
for i in range(1000):
if i < 10:
chk = '00' + str(i)
elif i < 100:
chk = '0' + str(i)
else:
chk = str(i)
... | import sys
input = sys.stdin.readline # 改行コード「\n」を呼んでしまうため、文字数など、注意！！
n = int(input().replace("\n",""))
s = input().replace("\n","")
ans = 0
for i in range(1000):
i = str(i).zfill(3)
x = s.find(i[0])
y = s.find(i[1], x+1)
z = s.find(i[2], y+1)
if x != -1 and y != -1 and z != -1:
... | p02844 |
#三井住友2019 D 貪欲法
def main():
import sys
N = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()
ans = 0
for i in range(1000):
num = str(i).zfill(3)
L = []
k = 0
for j in range(N):
#print(num, S[j])
if int(S[j])==int(num[k]):
... | #三井住友2019 D
def main():
import sys
N = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()
cnt = 0
for i in range(0, 10):
for j in range(0, 10):
for k in range(0, 10):
st1 = S.find(str(i))
if st1 ==-1:
continu... | p02844 |
import sys
from collections import deque
from itertools import *
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
s = S()
ans = 0
for i in range(1000):
num = str(i).zfill... | p02844 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02844 |
import sys
input = sys.stdin.readline
lists = ['{0:03d}'.format(i) for i in range(1000)]
import re
def check(target, a):
ans = re.search(a, target)
if ans == None:
return None
else:
return target[ans.start()+1:]
def print_ans(N, S):
"""Test Case
>>> print_ans(4, "0224")... | import sys
input = sys.stdin.readline
lists = ['{0:03d}'.format(i) for i in range(1000)]
import re
def check(target, a):
ans = re.search(a, target)
if ans == None:
return None
else:
return target[ans.start()+1:]
def print_ans(N, S):
"""Test Case
>>> print_ans(4, "0224")... | p02844 |
import sys
sys.setrecursionlimit(10 ** 9)
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
# 上限は1000
N = ri()
S = list(rs())
answer = set()
for i in range(len(S)-2):
se2 = set()
fo... | import sys
sys.setrecursionlimit(10 ** 9)
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
# 上限は1000
N = ri()
S = list(rs())
answer = set()
se1 = set()
for i in range(len(S)-2):
x = S[i]... | p02844 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p02844 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = int(readline())
S = readline().strip()
ans = 0
for p in range(1000):
pattern = str(p).zfill(3)
key = 0
cnt = 0
for n in pattern:
for... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N = int(readline())
S = readline().strip()
ans = 0
for p in range(1000):
pattern = str(p).zfill(3)
cnt = 0
T = S
for n in pattern:
i = T... | p02844 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | p02844 |
N = int(eval(input()))
S = input().strip()
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
cur = [i,j,k]
ind = 0
for n in range(N):
if int(S[n])==cur[ind]:
ind += 1
if ind==3:break
... | N = int(eval(input()))
S = list(map(int,list(input().strip())))
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
cur = [i,j,k]
ind = 0
for n in range(N):
if S[n]==cur[ind]:
ind += 1
if i... | p02844 |
N = int(eval(input()))
S = input().strip()
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
flag = 0
for n in range(N):
if flag==0 and S[n]==str(i):
flag = 1
elif flag==1 and S[n]==str(j):
... | def chk(x):
cur = 0
cnt = 0
while cur<N:
if S[cur]==str(x[cnt]):
cnt += 1
if cnt==3:
break
cur += 1
if cnt==3:
return 1
else:
return 0
N = int(eval(input()))
S = input().strip()
cnt = 0
for i in range(0,10):
... | p02844 |
import sys
from itertools import combinations
input = sys.stdin.readline
def main():
# 種類
N = int(eval(input()))
S = input().strip()
print((len(set(combinations(S, 3)))))
if __name__ == "__main__":
main()
| import sys
from itertools import combinations
input = sys.stdin.readline
def check_num(text):
cnt = 0
for i in range(10):
index = text.find(str(i))
if index != -1:
cnt += 1
return cnt
def main():
# 種類
# N = int(input())
# S = input().strip()
... | p02844 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
s = read().rstrip().decode()
cnt = 0
for i in range(1000):
num = ''
if i < 100:
num += '0'
if i < 10:
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
s = read().rstrip().decode()
cnt = 0
for i in range(1000):
num = str(i).zfill(3)
idx = -1
for m in num:
idx = s.find(m,... | p02844 |
import sys
readline = sys.stdin.readline
n = int(readline())
s = readline().rstrip()
from collections import deque
q = deque([])
ss = set(s)
for i in ss:
q.append(["",0,str(i)])
ans = 0
while q:
num, ind, target = q.popleft()
#print(num, ind, target)
while ind < len(s):
i... | import sys
readline = sys.stdin.readline
n = int(readline())
s = readline().rstrip()
from collections import deque
q = deque([])
ss = set(s)
for i in ss:
q.append(["",0,str(i)])
ans = 0
while q:
num, ind, target = q.popleft()
#print(num, ind, target)
while ind < len(s):
i... | p02844 |
import sys
input = sys.stdin.readline
import copy
N=int(eval(input()))
S=input().strip()
SUB={""}
ANS=set()
for s in S:
NSUB=copy.deepcopy(SUB)
for t in SUB:
x=t+s
if len(x)<=2:
NSUB.add(x)
else:
ANS.add(x)
SUB=NSUB
print((len(ANS))) | import sys
input = sys.stdin.readline
N=int(eval(input()))
S=input().strip()
SUB={""}
ANS=set()
for s in S:
N=set()
for t in SUB:
x=t+s
if len(x)<=2:
N.add(x)
else:
ANS.add(x)
SUB|=N
print((len(ANS))) | p02844 |
_,s=open(0)
x,y,z=eval('set(),'*3)
for c in s[:-1]:
for t in y:z.add(t+c)
for t in x:y.add(t+c)
x.add(c)
print((len(z))) | _,s=open(0)
x,y,z=eval('set(),'*3)
for c in s[:-1]:
z|={t+c for t in y}
y|={t+c for t in x}
x|={c}
print((len(z))) | p02844 |
from collections import*
_,s=open(0)
dp=defaultdict(bool)
for c in s[:-1]:
for i in range(100):
j=str(i).zfill(2)
dp[j+c]|=dp[j]
for i in range(10):
j=str(i)
dp[j+c]|=dp[j]
dp[c]=True
print((sum(dp[str(i).zfill(3)]for i in range(1000)))) | from collections import*
_,s=open(0)
dp=defaultdict(bool)
d1=[str(i)for i in range(10)]
d2=[str(i).zfill(2)for i in range(100)]
for c in s[:-1]:
for i in d2:
dp[i+c]|=dp[i]
for i in d1:
dp[i+c]|=dp[i]
dp[c]=True
print((sum(dp[str(i).zfill(3)]for i in range(1000)))) | p02844 |
import re
N = int(eval(input()))
S = input().strip()
count = 0
for c1 in range(10):
for c2 in range(10):
for c3 in range(10):
if re.search("{}.*{}.*{}".format(c1, c2, c3), S):
count += 1
print(count)
| import re
N = int(eval(input()))
S = [int(c) for c in input().strip()]
length = len(S)
count = 0
for c1 in range(10):
index1 = 0
while index1 < length:
if S[index1] == c1:
index1 += 1
break
index1 += 1
if index1 < length:
for c2 in range(10):
index2 = index1
while index2 < length... | p02844 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import ... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import ... | p02844 |
n = int(eval(input()))
s = list(map(int, input().rstrip()))
ans = 0
for i in range(1000):
if i < 10:
x, y, z = 0, 0, i
elif i < 100:
x, y, z = 0, i // 10, i % 10
else:
x = i // 100
y = (i - x * 100) // 10
z = i % 10
flg = 0
for a in range(len(s)... | n = int(eval(input()))
s = list(map(int, input().rstrip()))
ans = 0
for i in range(10):
if i in s[:n - 2]:
x = s.index(i)
for j in range(10):
if j in s[x + 1:n - 1]:
y = x + s[x + 1:n - 1].index(j) + 1
for k in range(10):
... | p02844 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip.split())
def main():
n = I()... | import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip.split())
def main():
sys.set... | p02844 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
S = readline().decode().rstrip()
ans = 0
for i in range(1000):
i_ = str(i).zfill(3)
idx = 0
for s in S:
if s == i_[i... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
S = readline().decode().rstrip()
ans = 0
for i in range(1000):
num = str(i).zfill(3)
idx = 0
flag = True
for s in num:
... | p02844 |
from sys import stdin
n = int(stdin.readline().rstrip())
s = stdin.readline().rstrip()
point = 0
for i in range(1000):
bango = str(i).zfill(3)
count = 0
for j in range(n):
if s[j] == bango[count]:
count += 1
if count == 3:
point += 1
break
pri... | from sys import stdin
n = int(stdin.readline().rstrip())
s = stdin.readline().rstrip()
def count(poi):
point = 0
for i in range(poi):
bango = str(i).zfill(3)
count = 0
for j in range(n):
if s[j] == bango[count]:
count += 1
if count == ... | p02844 |
from itertools import groupby
def main():
n=int(eval(input()))
aa=sorted(map(int,input().split()))
d={}
for k,g in groupby(aa):
d[k] = len(list(g))
q=int(eval(input()))
bc=[]
for _ in range(q):
b,c=list(map(int,input().split()))
bc.append((b,c))
for b,... | from itertools import groupby
def main():
n=int(eval(input()))
aa=sorted(map(int,input().split()))
d={}
for k,g in groupby(aa):
d[k] = len(list(g))
q=int(eval(input()))
bc=[]
for _ in range(q):
b,c=list(map(int,input().split()))
bc.append((b,c))
s = su... | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
dicts = {}
for tmp in a:
if tmp in list(dicts.keys()):
dicts[tmp] += 1
else:
dicts[tmp] = 1
m = int(eval(input()))
result = 0
for key, value in list(dicts.items()):
result += key*value
for _ in range(m):
b,c = list(map(int... | n = int(eval(input()))
a = list(map(int, input().split()))
dicts = {}
for tmp in a:
if tmp in list(dicts.keys()):
dicts[tmp] += 1
else:
dicts[tmp] = 1
m = int(eval(input()))
result = 0
for key, value in list(dicts.items()):
result += key*value
for _ in range(m):
b,c = list(map(int... | p02630 |
from collections import defaultdict
n = int(eval(input()))
alist = list(map(int,input().split()))
q = int(eval(input()))
dict_n = defaultdict(lambda:0)
for i in alist:
dict_n[i] += 1
bclist = []
for i in range(q):
b,c = list(map(int,input().split()))
bclist.append([b,c])
for i in r... | from collections import defaultdict
n = int(eval(input()))
alist = list(map(int,input().split()))
q = int(eval(input()))
dict_n = defaultdict(lambda:0)
for i in alist:
dict_n[i] += 1
bclist = []
for i in range(q):
b,c = list(map(int,input().split()))
bclist.append([b,c])
sum = sum(al... | p02630 |
n = int(input().rstrip())
line = input().rstrip().split(' ')
a = []
for i in range(n):
a.append(int(line[i]))
a.sort()
q = int(input().rstrip())
b = []
c = []
for i in range(q):
line = input().rstrip().split(' ')
b = int(line[0])
c = int(line[1])
for j in range(len(a)):
... | n = int(input().rstrip())
line = input().rstrip().split(' ')
a = {}
ans = 0
for i in range(n):
n = int(line[i])
ans += n
if n in a:
a[n] += 1
else:
a[n] = 1
q = int(input().rstrip())
for i in range(q):
line = input().rstrip().split(' ')
b = int(line[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)]
# print(N)
# print(A)
# print(Q)
# print(B)
total = sum(A)
for i in range(Q):
Bi = BC[i][0]
Ci = BC[i][1]
diff = 0
for j in range(len(A)):
... | import itertools
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)]
# print(N)
# print(A)
# print(Q)
# print(B)
distribution = {}
max_A = max(A)
max_BC = max(list(itertools.chain.from_iterable(BC)))
maximum = max([ma... | p02630 |
from collections import Counter
R = lambda: list(map(int, input().split()))
R()
d = Counter(R())
s = sum(k * v for k,v in list(d.items()))
q, = R()
for _ in range(q):
b, c = R()
s += (c - b) * d[b]
print(s)
d[c]+=d[b]
d[b] = 0
| from collections import Counter
R = lambda: list(map(int, input().split()))
R()
d = Counter(R())
s = sum(d.elements())
q, = R()
for _ in range(q):
b, c = R()
s += (c - b) * d[b]
print(s)
d[c]+=d[b]
d[b] = 0
| p02630 |
from collections import Counter
R = lambda: list(map(int, input().split()))
R()
d = Counter(R())
s = sum(d.elements())
q, = R()
for _ in range(q):
b, c = R()
s += (c - b) * d[b]
print(s)
d[c]+=d[b]
d[b] = 0
| R = lambda: list(map(int, input().split()))
R()
a = [0] * 100001
s = 0
for x in R():
s += x
a[x] += 1
q, = R()
for _ in range(q):
b, c = R()
s += (c - b) * a[b]
print(s)
a[c]+=a[b]
a[b] = 0
| p02630 |
import collections
N = int(eval(input()))
Line = [int(s) for s in input().split()]
c = collections.Counter(Line)
# print(c)
Q = int(eval(input()))
for _ in range(Q):
Line = [int(s) for s in input().split()]
try:
c[Line[1]] += c[Line[0]]
c.pop(Line[0])
except:
pa... | import collections
N = int(eval(input()))
Line = [int(s) for s in input().split()]
c = collections.Counter(Line)
# print(c)
v = 0
for i in c:
# print(i)
v += i * c[i]
# print(v)
Q = int(eval(input()))
for _ in range(Q):
Line = [int(s) for s in input().split()]
try:
... | p02630 |
from collections import Counter
N = int(eval(input()))
As = list(map(int, input().split()))
d = Counter(As)
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
if B in d:
d[C] += d[B]
d[B] = 0
print((sum(k*v for k, v in list(d.items())))) | from collections import Counter
N = int(eval(input()))
As = list(map(int, input().split()))
d = Counter(As)
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 in d:
S += d[B] * (C-B)
d[C] += d[B]
d... | p02630 |
N = int(eval(input()))
numbers = list(map(int,input().split()))
numOfOperation = int(eval(input()))
sums = sum(numbers)
for i in range(numOfOperation):
B,C = list(map(int,input().split()))
cnt = 0
for j in range(len(numbers)):
if numbers[j] == B :
cnt += 1
numbers[... | N = int(eval(input()))
numbers = list(map(int,input().split()))
numOfOperation = int(eval(input()))
dic = {}
for num in numbers:
if num in dic : dic[num] += 1
else: dic[num] = 1
sums = sum(numbers)
for i in range(numOfOperation):
B,C = list(map(int,input().split()))
if (B in dic) :
... | p02630 |
n=int(eval(input()))
ar=list(map(int,input().split()))
di={}
for i in range(n):
if ar[i] not in di:
di[ar[i]]=1
else:
di[ar[i]]+=1
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
if(b in di):
x=di[b]
del di[b]
if(c in di):
... | n=int(eval(input()))
ar=list(map(int,input().split()))
di={}
for i in ar:
di[i]=di.get(i,0)+1
sm=sum(ar)
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
if(b not in di):
print(sm)
elif(b in di):
x=di[b]
del di[b]
if(c in di):
... | p02630 |
def main():
n = int(eval(input()))
As = list(map(int, input().split()))
nums = [0] * (10**5+1)
ans = 0
for a in As:
ans += a
nums[a] += 1
q = int(eval(input()))
for i in range(q):
b, c = list(map(int, input().split()))
ans += (c-b) * nums[b]
... | def main():
n = int(eval(input()))
As = list(map(int, input().split()))
As_Count = [0] * (10**5+1)
q = int(eval(input()))
bcs = [list(map(int, input().split())) for _ in range(q)]
for A in As:
As_Count[A] += 1
ans = sum(As)
for b, c in bcs:
ans -= As_Count[b] * ... | p02630 |
from collections import Counter
def solve(string):
n, *aqbc = list(map(int, string.split()))
a, _, bc = aqbc[:n], aqbc[n], aqbc[n + 1:]
s = sum(a)
t = Counter(a)
ans = []
for b, c in zip(*[iter(bc)] * 2):
if c in list(t.keys()):
t[c] += t[b]
else:
... | from collections import Counter
def solve(string):
n, *aqbc = list(map(int, string.split()))
a, _, bc = aqbc[:n], aqbc[n], aqbc[n + 1:]
s = sum(a)
t = Counter(a)
ans = []
for b, c in zip(*[iter(bc)] * 2):
s += (c - b) * t[b]
t[c] += t[b]
t[b] = 0
an... | p02630 |
from collections import Counter
def solve(string):
n, *aqbc = list(map(int, string.split()))
a, _, bc = aqbc[:n], aqbc[n], aqbc[n + 1:]
s = sum(a)
t = Counter(a)
ans = []
for b, c in zip(*[iter(bc)] * 2):
s += (c - b) * t[b]
t[c] += t[b]
t[b] = 0
an... | from collections import Counter
def solve(string):
n, *aqbc = list(map(int, string.split()))
a, _, bc = aqbc[:n], aqbc[n], aqbc[n + 1:]
s = sum(a)
t = Counter(a)
ans = []
for b, c in zip(*[iter(bc)] * 2):
if b not in list(t.keys()):
ans.append(s)
con... | p02630 |
from collections import Counter
def solve(string):
n, *aqbc = list(map(int, string.split()))
a, _, bc = aqbc[:n], aqbc[n], aqbc[n + 1:]
s = sum(a)
t = Counter(a)
ans = []
for b, c in zip(*[iter(bc)] * 2):
if b not in list(t.keys()):
ans.append(s)
con... | from collections import Counter
def solve(string):
n, *aqbc = list(map(int, string.split()))
a, _, bc = aqbc[:n], aqbc[n], aqbc[n + 1:]
s = sum(a)
t = Counter(a)
ans = []
for b, c in zip(*[iter(bc)] * 2):
if b in list(t.keys()):
s += (c - b) * t[b]
t... | p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(Q)]
ctr = Counter(A)
ans = sum(A)
for b, c in X:
v = ctr[b]
ans = ans - b * v + c * v
ctr[b] -= v
ctr[c] += v
print(an... |
from collections import Counter
N = int(eval(input()))
X = list(map(int, input().split()))
Q = int(eval(input()))
Y = [list(map(int, input().split())) for _ in range(Q)]
ctr = Counter(X)
ans = sum(X)
for b, c in Y:
n = ctr[b]
ctr[b] = 0
ctr[c] += n
ans = ans - b * n + c * n
print(a... | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
a_list = [[i, 0] for i in range(10**5 +1)]
for elem in a:
a_list[elem][1] += 1
for i in range(q):
b, c = list(map(int,(input().split())))
a_list[c][1] += a_list[b][1]
a_list[b][1] = 0
ans = 0
for j in... | n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
a_dic = {}
for elem in a:
if elem not in a_dic:
a_dic[elem] = 1
else:
a_dic[elem] += 1
a_sum = sum(a)
for i in range(q):
b, c = list(map(int,input().split()))
if b in a_dic:
diff =... | p02630 |
import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
x=[0]*(10**5)
for i in range(n):
x[a[i]-1]+=a[i]
for _ in range(q):
b,c=list(map(int,input().split()))
if x[b-1]!=0:
x[c-1]+=x[b-1]//... | import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
q=int(eval(input()))
ans=sum(a)
x=[0]*(10**5+10)
for i in a:
x[i]+=1
for _ in range(q):
b,c=list(map(int,input().split()))
ans+=x[b]*c-x[b]*b
print(ans)
... | p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = []
for _ in range(Q):
b, c = list(map(int, input().split()))
BC.append([b, c])
C = Counter(A)
for bc in BC:
b = bc[0]
c = bc[1]
if b in C:
if c in C:
... | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
BC = []
for _ in range(Q):
b, c = list(map(int, input().split()))
BC.append([b, c])
C = Counter(A)
S = sum([k*v for k, v in list(C.items())])
for bc in BC:
b = bc[0]
c ... | p02630 |
from collections import Counter
from collections import defaultdict
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
ac = Counter(a)
acl = defaultdict(int)
for ae in ac:
acl[ae] = ac[ae]
for _ in range(q):
b, c = lis... | from collections import Counter
from collections import defaultdict
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
asum = sum(a)
ac = Counter(a)
acl = defaultdict(int)
for ae in ac:
acl[ae] = ac[ae]
for _ in range(q):
... | p02630 |
# D - Replacing
from collections import defaultdict
def main():
N, *X = list(map(int, open(0).read().split()))
A, BC = X[:N], X[N + 1 :]
cnt = defaultdict(int)
for a in A:
cnt[a] += 1
total = sum(A)
res = []
for b, c in zip(*[iter(BC)] * 2):
total += (c - b) * ... | # D - Replacing
def main():
N, *X = list(map(int, open(0).read().split()))
A, BC = X[:N], X[N + 1 :]
cnt = [0] * (10 ** 5 + 1)
for a in A:
cnt[a] += 1
total = sum(A)
res = []
for b, c in zip(*[iter(BC)] * 2):
total += (c - b) * cnt[b]
res.append(total)
... | p02630 |
if __name__=='__main__':
N = int(eval(input()))
A = input().split(" ")
#A_i = [int(s) for s in A]
Q=int(eval(input()))
str_list=[]
S=[]
for i in range(Q):
str_list.append(list(input().split()))
for j in range(Q):
A=[s.replace(str_list[j][0],str_list[j]... | if __name__=='__main__':
N = int(eval(input()))
A = input().split(" ")
#A_i = [int(s) for s in A]
Q=int(eval(input()))
str_list=[]
S=[]
for i in range(Q):
str_list.append(list(input().split()))
for j in range(Q):
if str_list[j][0] in A:
A=[s.repla... | p02630 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
Q = int(eval(input()))
B_to_C = []
for i in range(Q):
B_to_C.append([int(x) for x in input().split()])
dict_A = {}
for a in A:
if a in dict_A:
dict_A[a] += 1
else:
dict_A[a] = 1
for B, C in B_to_C:
if B in dict_A:
i... | N = int(eval(input()))
A = [int(x) for x in input().split()]
Q = int(eval(input()))
B_to_C = []
for i in range(Q):
B_to_C.append([int(x) for x in input().split()])
dict_A = {}
sums = 0
for a in A:
if a in dict_A:
dict_A[a] += 1
else:
dict_A[a] = 1
for k, v in list(dict_A.items()):
... | p02630 |
n=int(eval(input()))
elements= input().split()
q=int(eval(input()))
actions=[]
for i in range(q):
actions.append(input().split())
number_list=[]
count_list=[]
for e in elements:
if int(e) in number_list:
count_list[number_list.index(int(e))]+=1
else:
number_list.append(int(e))... | n=int(eval(input()))
elements= input().split()
q=int(eval(input()))
actions=[]
for i in range(q):
actions.append(input().split())
dict={}
for e in elements:
count=dict.get(e,0)
count+=1
dict[e]=count
sum=0
for key in list(dict.keys()):
sum+=int(key)* dict[key]
for act in action... | p02630 |
# import sys
# input = sys.stdin.readline
# import re
# import itertools
import collections
def main():
n = int(eval(input()))
s = input_list()
sc = collections.Counter(s)
q = int(eval(input()))
ans = []
for i in range(q):
b, c = input_list()
sc[c] += sc[b]
... | # import sys
# input = sys.stdin.readline
# import re
# import itertools
import collections
def main():
n = int(eval(input()))
s = input_list()
sc = collections.Counter(s)
q = int(eval(input()))
data = []
for i in range(q):
b, c = input_list()
sc[c] += sc[b]
... | p02630 |
from collections import Counter
N = int(eval(input()))
val2ind = Counter(list(map(int, input().split())))
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
if B in val2ind:
cand = val2ind[B]
del val2ind[B]
if C not in val2ind:
val2in... | from collections import Counter
N = int(eval(input()))
val2ind = Counter(list(map(int, input().split())))
ans = sum([key*val2ind[key] for key in val2ind])
Q = int(eval(input()))
for _ in range(Q):
B, C = list(map(int, input().split()))
if B in val2ind:
cand = val2ind[B]
del val2ind[B]... | p02630 |
from collections import defaultdict
d = defaultdict(int)
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)]
for el in a:
d[el] += 1
def s_sum(dd):
res = 0
for k,v in list(dd.items()):
res += k * v
... | from collections import defaultdict
d = defaultdict(int)
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)]
#print(bc)
for el in a:
d[el] += 1
def s_sum(dd):
res = 0
for k,v in list(dd.items()):
re... | p02630 |
import collections
_ = eval(input())
a = [*list(map(int, input().split()))]
q = int(eval(input()))
b = [[*list(map(int,input().split()))] for _ in range(q)]
c = collections.Counter(a)
for i,j in b:
if j not in c:
c[j] = 0
if i not in c:
c[i] = 0
c[j]+=c[i]
c[i] = 0
prin... | import collections
_ = eval(input())
a = [*list(map(int, input().split()))]
q = int(eval(input()))
s = sum(a)
b = [[*list(map(int,input().split()))] for _ in range(q)]
c = collections.Counter(a)
for i,j in b:
if j not in c:
c[j] = 0
if i not in c:
c[i] = 0
s += (j-i)*c[i]
c[... | p02630 |
import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
Q = int(eval(input()))
BC = [[int(x) for x in input().split()] for _ in range(Q)]
cnt = collections.Counter(A)
an... | import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
Q = int(eval(input()))
BC = [[int(x) for x in input().split()] for _ in range(Q)]
ans = sum(A)
cnt = collections.Co... | p02630 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
dic = collections.Counter(a)
for i in range(q):
b, c = list(map(int, input().split()))
if b in dic and c not in dic:
dic[c] = dic[b]
del dic[b]
elif b in dic and c in dic:
... | import collections
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
dic = collections.Counter(a)
sum_list = [x * y for (x, y) in list(dic.items())]
sum = sum(sum_list)
for i in range(q):
b, c = list(map(int, input().split()))
if b in dic and c not in dic:
sum -... | p02630 |
def sum_dict(d, b, c):
val = 0
sum = 0
if b in d:
val = d[b]
del d[b]
d[c] = d.get(c, 0) + val
for i in list(d.items()):
sum += (i[0] * i[1])
return sum, d
n = int(eval(input()))
a = [int(x) for x in input().split()]
d = {}
for i in a:
d[i] = d... | def sum_dict(d, sum, b, c):
val = 0
if b in d:
val = d[b]
sum -= (b * val)
del d[b]
d[c] = d.get(c, 0) + val
sum += (c * val)
return sum, d
n = int(eval(input()))
a = [int(x) for x in input().split()]
d = {}
for i in a:
d[i] = d.get(i, 0) + 1
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)]
ans = [0]*(10**5+1)
for i in range (len(A)):
ans[A[i]] += 1
maxlen = max(max(A),max(max(BC)))
for i in range(Q):
ans[BC[i][1]] += ans[BC[i][0]]
ans[BC[i][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)]
ans = [0]*(10**5+1)
for i in range (len(A)):
ans[A[i]] += 1
maxlen = max(max(A),max(max(BC)))
S = 0
for i in range(maxlen+1):
S += ans [i]*i
for i in range... | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = {}
for x in a:
try:
if b[x]:
b[x] += 1
except:
b[x] = 1
#print(b)
ans = sum(a)
q = int(eval(input()))
for _ in range(q):
x,y = list(map(int,input().split()))
try:
if b[x] != -1:
bx = b[x]
b[x] = 0
exc... | n = int(eval(input()))
a = list(map(int,input().split()))
b = {}
for x in a:
try:
if b[x] != -1:
b[x] += 1
except:
b[x] = 1
q = int(eval(input()))
ans = sum(a)
for _ in range(q):
x,y = list(map(int,input().split()))
try:
if b[x] != -1:
bx = b[x]
b[x] = 0
except:
... | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [0 for _ in range(100001)]
for x in a:
b[x] += 1
ans = sum(a)
q = int(eval(input()))
for _ in range(q):
x,y = list(map(int,input().split()))
ans += (y-x) * b[x]
b[x],b[y] = 0,b[x]+b[y]
print(ans) | #15:30
n = int(eval(input()))
a = list(map(int,input().split()))
b = {}
for x in a:
b[x] = 0
q = int(eval(input()))
inp = []
for _ in range(q):
x,y = list(map(int,input().split()))
b[x] = 0
b[y] = 0
inp.append([x,y])
for x in a:
b[x] += 1
ans = sum(a)
for z in inp:
x,y = z
ans += (y-x)... | p02630 |
n=int(eval(input()))
a=list(map(int,input().split()))
sum_num=sum(a)
mylist=[]
for i in range(1,10**5+1):
mylist.append(a.count(i))
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
sum_num+=(c-b)*mylist[b-1]
print(sum_num)
mylist[c-1]+=mylist[b-1]
mylist[b-1... | from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
sum_num=sum(a)
cnt=Counter(a)
q=int(eval(input()))
for i in range(q):
b,c=list(map(int,input().split()))
sum_num+=(c-b)*cnt[b]
print(sum_num)
cnt[c]+=cnt[b]
cnt[b]=0 | p02630 |
nb=int(eval(input()))
liste = [int(x) for x in input().split()]
liste2= [0]*((10**5)+1)
for loop in range(len(liste)):
liste2[liste[loop]] +=1
nba = int(eval(input()))
somme = sum(liste)
for loop in range(nba):
n,r = list(map(int,input().split()))
roger = liste2[n]
for loop in range(len(liste)):
... | nb=int(eval(input()))
liste = [int(x) for x in input().split()]
liste2= [0]*((10**5)+1)
for loop in range(len(liste)):
liste2[liste[loop]] +=1
nba = int(eval(input()))
somme = sum(liste)
for loop in range(nba):
n,r = list(map(int,input().split()))
roger = liste2[n]
diff = r-n
somme += diff * roger
... | p02630 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.st... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
from collections import Counter
N = I()
A = LI()
sum = sum(A)
a = Counter(A)
Q = I()
for i in range(Q):
b,c = LI()
sum += a[b]*(c-b)
print(sum)
... | p02630 |
n = int(eval(input()))
li_a = list(map(int, input().split()))
dic_a = {}
for a in li_a:
dic_a[a] = dic_a.get(a, 0) + 1
q = int(eval(input()))
li_bc = list()
for i in range(q):
li_bc.append(tuple(map(int, input().split())))
for l in li_bc:
b = l[0]
c = l[1]
if b in list(dic_a.keys... | n = int(eval(input()))
li_a = list(map(int, input().split()))
dic_a = {}
for a in li_a:
dic_a[a] = dic_a.get(a, 0) + 1
q = int(eval(input()))
li_bc = list()
for i in range(q):
li_bc.append(tuple(map(int, input().split())))
answer = sum(li_a)
for l in li_bc:
b = l[0]
c = l[1]
... | p02630 |
n=int(eval(input()))
a=sorted([int(i) for i in input().split()])
m={}
for i in range(n):
x=m.get(a[i],0)
m[a[i]]=x+1
q=int(eval(input()))
b=[]
c=[]
for i in range(q):
b,c=[int(i) for i in input().split()]
x=m.get(b,0)
y=m.get(c,0)
m[b]=0
m[c]=x+y
print((sum([x*m[x] for x i... | n=int(eval(input()))
m={}
s=0
for i in input().split():
i=int(i)
x=m.get(i,0)
m[i]=x+1
s+=i
q=int(eval(input()))
for i in range(q):
b,c=[int(i) for i in input().split()]
x=m.get(b,0)
y=m.get(c,0)
m[b]=0
m[c]=x+y
s=s-(b*x)+(c*x)
print(s)
| p02630 |
f=lambda:[*list(map(int,input().split()))]
f(); l,q=f(),f()[0]
from collections import *
C,s=Counter(l),sum(l)
for _ in range(q): b,c=f(); s+=(c-b)*C[b]; C[c]+=C[b]; C[b]=0; print(s) | f=lambda:[*list(map(int,input().split()))]
f()
s,*l=[0]*100002
for i in f(): s+=i; l[i]+=1
q=f()[0]
for _ in range(q): b,c=f(); s+=(c-b)*l[b]; l[c]+=l[b]; l[b]=0; print(s) | p02630 |
f=lambda:list(map(int,input().split()))
f()
s,*l=[0]*100002
for i in f(): s+=i; l[i]+=1
q,=f()
for _ in range(q): b,c=f(); s+=(c-b)*l[b]; l[c]+=l[b]; l[b]=0; print(s) | n,*L=list(map(int,open(0).read().split()))
A,q,Q=L[:n],L[n],L[n+1:]
s,*l=[0]*100002
for i in A: s+=i; l[i]+=1
for b,c in zip(*[iter(Q)]*2): s+=(c-b)*l[b]; l[c]+=l[b]; l[b]=0; print(s) | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
a_set = set(a)
a_dict = dict([(i, a.count(i))for i in a_set])
a_sum = sum(a)
for i in range(q):
b,c = list(map(int,input().split()))
if not b in a_dict:
print(a_sum)
continue
a_sum = a_sum - a_dict[... | n = int(eval(input()))
a = list(map(int,input().split()))
q = int(eval(input()))
a_dict = dict()
for i in a:
if i in a_dict:
a_dict[i] = a_dict[i] + 1
else:
a_dict[i] = 1
a_sum = sum(a)
for i in range(q):
b,c = list(map(int,input().split()))
if not b in a_dict:
pri... | p02630 |
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
B,C = [], []
for _ in range(q):
b, c = list(map(int, input().split()))
B.append(b)
C.append(c)
d = {}
for a in A:
d.setdefault(a, 0)
d[a] += 1
for b, c in zip(B,C):
d.setdefault(b, 0)
d.setdef... | n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
B,C = [], []
for _ in range(q):
b, c = list(map(int, input().split()))
B.append(b)
C.append(c)
ans = sum(A)
d = {}
for a in A:
d.setdefault(a, 0)
d[a] += 1
for b, c in zip(B,C):
d.setdefault(b... | 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)]
A=[0]*(10**5+1)
for i in range(10**5+1):
A[i] = a.count(i)
sum_tmp = sum(a)
for i in range(q):
b = bc[i][0]
c = bc[i][1]
A[c] += A[b]
sum_tmp += (c-b) * A[b]
A[b]... | 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)]
A=[0]*(10**5+1)
for i in range(n):
A[a[i]] += 1
sum_tmp = sum(a)
for i in range(q):
b = bc[i][0]
c = bc[i][1]
A[c] += A[b]
sum_tmp += (c-b) * A[b]
A[b] = 0
... | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dic = dict()
for i in A:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
for i in range(Q):
b, c = list(map(int, input().split()))
if b in dic:
if c in dic:
dic[c] += dic.... | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
dic = dict()
for i in A:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
ans = 0
for num in dic:
ans += num * dic[num]
for i in range(Q):
b, c = list(map(int, input().split()))
x = 0
... | p02630 |
import collections
n = int(eval(input()))
li = list(map(int,input().split()))
q = int(eval(input()))
num_li=[list(map(int,input().split())) for i in range(q)]
c = collections.Counter(li)
for i,j in num_li:
s = 0
if i in c:
cnt = c.pop(i)
c[j] += cnt
for k, v in list(c.items(... | import collections
n = int(eval(input()))
li = list(map(int,input().split()))
q = int(eval(input()))
num_li=[list(map(int,input().split())) for i in range(q)]
c = collections.Counter(li)
li_sum = sum(li)
for i,j in num_li:
s = 0
if i in c:
cnt = c.pop(i)
c[j] += cnt
li_... | p02630 |
n = int(eval(input()))
a = list(map(int,input().split()));
q = int(eval(input()))
aa = 0;
for i in range(n):
aa += a[i];
b = [input().split() for l in range(q)]
bu = [0]*(100000);
for i in range(100000):
bu[i] = a.count(i+1);
for x in range(q):
c = int(b[x][0])
d = int(b[x][1])
... |
n = int(eval(input()))
a = list(map(int,input().split()));
q = int(eval(input()))
aa = 0;
for i in range(n):
aa += a[i];
b = [input().split() for l in range(q)]
bu = [0]*(100000);
for i in range(n):
bu[a[i]-1] += 1;
for x in range(q):
c = int(b[x][0])
d = int(b[x][1])
aa +... | p02630 |
import collections
N = int(eval(input()))
a = list(map(int,input().split()))
Q = int(eval(input()))
c = collections.Counter(a)
for i in range(Q):
arr = list(map(int,input().split()))
B = arr[0]
C = arr[1]
if(C not in c):
c[C] = 0
c[C] += c[B]
del c[B]
sum = 0... | import collections
N = int(eval(input()))
a = list(map(int,input().split()))
su = sum(a)
Q = int(eval(input()))
c = collections.Counter(a)
for i in range(Q):
arr = list(map(int,input().split()))
B = arr[0]
C = arr[1]
if(C not in c):
c[C] = 0
num_B = c[B] # 配列に含まれるBの個数... | p02630 |
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
data = collections.Counter(a)
count, key = list(data.values()), list(data.keys())
for i in range(q):
b, c = list(map(int, input().split()))
if b in key and c in key:
count[key.index(c)] += cou... | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
data = [0] * (10**5 + 1)
for i in a:
data[i] += 1
res = sum(a)
for j in range(q):
b, c = list(map(int, input().split()))
res += (c - b) * data[b]
data[c] += data[b]
data[b] = 0
print(res) | 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)]
# sum_first = sum(a)
for i in bc:
a = [i[1] if j==i[0] else j for j in a]
# print(a)
print((sum(a))) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
query = [list(map(int,input().split())) for _ in range(q)]
all_sum = sum(a)
cnt = {}
for i in a:
if i not in cnt:
cnt[i] = 0
cnt[i] += 1
for (b, c) in query:
if b in cnt:
all_sum -= b * cnt[b... | p02630 |
n = int(eval(input()))
lst = [int(i) for i in input().split()]
dic = {}
for i in range(n):
key = lst[i]
if key not in dic:
dic[key] = 0
dic[key] += 1
#print(dic)
m = int(eval(input()))
for _ in range(m):
sum = 0
lst_s = list(map(int, input().split()))
number = dic.get(lst_s[0])
if number... | n = int(eval(input()))
lst = [int(i) for i in input().split()]
dic = {}
for i in range(n):
key = lst[i]
if key not in dic:
dic[key] = 0
dic[key] += 1
#print(dic)
sum = 0
for key, value in list(dic.items()):
sum += key * value
m = int(eval(input()))
for _ in range(m):
lst_s = list(map(int, ... | p02630 |
import collections
eval(input())
math_dic = collections.Counter((list(map(int,input().split()))))
num = int(eval(input()))
for i in range(num):
a,b = list(map(int,input().split()))
if a not in math_dic:
print((sum([index*value for index,value in list(math_dic.items())])))
continue
i... | import collections
eval(input())
math_dic = collections.Counter((list(map(int,input().split()))))
num = int(eval(input()))
total_num = sum([index*value for index,value in list(math_dic.items())])
for i in range(num):
a,b = list(map(int,input().split()))
if a not in math_dic:
print(total_num)
... | p02630 |
import sys
input = sys.stdin.buffer.readline
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
from collections import Counter
C = Counter(A)
C = dict(C)
S = sum(A)
for i in range(q):
b, c = list(map(int, input().split()))
if b in C:
vb = C[b]
C[b... | import sys
input = sys.stdin.buffer.readline
n = int(eval(input()))
A = list(map(int, 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... | p02630 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
A = Counter(A)
bc = [tuple(map(int, input().split())) for i in range(Q)]
ans = 0
for b, c in bc:
v = A.pop(b, None)
if v:
A[c] += v
ans = 0
ans = sum(i*j for i, j in li... | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
ans = sum(A)
A = Counter(A)
bc = [tuple(map(int, input().split())) for i in range(Q)]
for b, c in bc:
v = A.pop(b, None)
if v:
A[c] += v
ans = ans+((c-b)*v)
print(ans... | p02630 |
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = 10**5+1
nums = [0]*m
for i in a: nums[i] += 1
for _ in range(q):
b,c = list(map(int, input().split()))
nums[c] += nums[b]
nums[b] = 0
ans = 0
for i in range(1,m): ans += i*nums[i]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = 10**5+1
nums = [0]*m
ans = 0
for i in a:
nums[i] += 1
ans += i
for _ in range(q):
b,c = list(map(int, input().split()))
ans -= b*nums[b]
ans += c*nums[b]
nums[c] += nums[b]
nums[b] = 0
print(ans) | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
count = [0]*(10**5+1)
for i in range(len(A)):
count[A[i]] += 1
A = list(set(A))
for i in range(Q):
B, C = list(map(int, input().split()))
count[C] += count[B]
count[B] = 0
ans = 0
for i in range(10**5+1):
... | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
S = sum(A)
count = [0]*(10**5+1)
for i in range(len(A)):
count[A[i]] += 1
A = list(set(A))
for i in range(Q):
B, C = list(map(int, input().split()))
S = S - B*count[B] + C*count[B]
count[C] += count[B]
count[B] = 0... | 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())))
num=[0]*(10**5+1)
for i in range(n):
x=a[i]
num[x]+=1
for k in range (q):
b=bc[k][0]
c=bc[k][1]
num[c]+=num[b]
num[b]=0
kk... | 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)
for i in range(n):
x=a[i]
num[x]+=1
kk=0
for l in range(10**5+1):
kk+=l*num[l]
for k in range (q):
b=bc[k][0]
c=... | p02630 |
N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
A_cnt = [0] * 100001
A_sum = 0
for a in A:
A_cnt[a]+=1
for _ in range(Q):
B, C = list(map(int, input().split()))
A_cnt[C] = A_cnt[C] + A_cnt[B]
A_cnt[B] = 0
for i, x in enumerate(A_cnt):
if A_... | N = int(eval(input()))
A = list(map(int, input().split()))
Q = int(eval(input()))
A_cnt = [0] * 100001
A_sum = 0
# 各数値の数を数えておく
for a in A:
A_cnt[a]+=1
# ついでに現時点の総和も出しておく
A_sum+=a
for _ in range(Q):
B, C = list(map(int, input().split()))
A_cnt[C] = A_cnt[C] + A_cnt[B]
A_sum = A_s... | p02630 |
n, *bc = list(map(int, open(0).read().split()))
a = [bc.pop(0) for _ in range(n)]
q = bc.pop(0)
d = {}
for x in a:
if x in d:
d[x] += 1
else:
d[x] = 1
ret = sum(a)
for i in range(0, min(q*2, len(bc)), 2):
b = bc[i]
c = bc[i+1]
if b in d:
v = d.pop(b)
... | n, r = open(0).read().split(maxsplit=1)
n = int(n)
*a, r = r.split(maxsplit=n)
a = list(map(int, a))
q, *bc = list(map(int, r.split()))
d = {}
for x in a:
if x in d:
d[x] += 1
else:
d[x] = 1
ret = sum(a)
for i in range(0, min(q*2, len(bc)), 2):
b = bc[i]
c = bc[i+1]
... | p02630 |
n, r = open(0).read().split(maxsplit=1)
n = int(n)
*a, r = r.split(maxsplit=n)
a = list(map(int, a))
q, *bc = list(map(int, r.split()))
d = {}
for x in a:
if x in d:
d[x] += 1
else:
d[x] = 1
ret = sum(a)
for i in range(0, min(q*2, len(bc)), 2):
b = bc[i]
c = bc[i+1]
... | n, *r = list(map(int, open(0).read().split()))
a = r[:n]
q = r[n]
bc = r[n+1:]
d = {}
for x in a:
if x in d:
d[x] += 1
else:
d[x] = 1
ret = sum(a)
for i in range(0, min(q*2, len(bc)), 2):
b = bc[i]
c = bc[i+1]
if b in d:
v = d.pop(b)
if c in d:
... | p02630 |
from collections import deque
from bisect import bisect_left
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
sus=deque([sum(a)])
q=int(eval(input()))
for i in range(q):
count=0
b,c=list(map(int,input().split()))
idx=bisect_left(a,b)
while True:
if idx>=n:break
if a[idx]==b:
... | n=int(eval(input()))
a=[0]*(10**5)
A=list(map(int,input().split()))
su=0
for i in range(n):
su+=A[i]
a[A[i]-1]+=1
q=int(eval(input()))
sus=[su]
for i in range(q):
b,c=[int(x)-1 for x in input().split()]
sus.append(sus[-1]+(c-b)*a[b])
a[c]+=a[b]
a[b]-=a[b]
print((sus[-1]))
| p02630 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.