input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p02913 |
#!/usr/bin/env python3
def Z(S):
n = len(S)
LCP = [0]*n
i = 1
j = c = 0
# c : 最も末尾側までLCPを求めたインデックス
for i in range(1, n):
# i番目からのLCPが以前計算したcからのLCPに含まれている場合
if i+LCP[i-c] < c+LCP[c]:
LCP[i] = LCP[i-c]
else:
j = max(0, c+LCP[c]-i)
... | def Z(S):
n = len(S)
LCP = [0]*n
i = 1
j = c = 0
# c : 最も末尾側までLCPを求めたインデックス
for i in range(1, n):
# i番目からのLCPが以前計算したcからのLCPに含まれている場合
if i+LCP[i-c] < c+LCP[c]:
LCP[i] = LCP[i-c]
else:
j = max(0, c+LCP[c]-i)
while i+j < n and ... | p02913 |
import sys
from collections import defaultdict
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map... | import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
de... | p02913 |
import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
de... | import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
de... | p02913 |
import sys
n = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()
dp = [[0 for i in range(n)] for j in range(n)]
#初期条件
for j in range(n):
if S[0] == S[j]:
dp[0][j] = 1
else:
dp[0][j] = 0
#print(dp)
for i in range(n):
for j in range(n):
if S[i] ==S[j]:
... | import sys
n = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()
dp = [[0 for i in range(n)] for j in range(n)]
#初期条件
for j in range(1, n):
if S[0] == S[j]:
dp[0][j] = 1
#print(dp)
for i in range(1, n-1):
for j in range(i+1, n):
if S[i] ==S[j]:
dp[i][j] ... | p02913 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | p02913 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | p02913 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | p02913 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p02913 |
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
S = rs()
def get_max(i):
ok, ng = i, len(S)
while ng-ok > 1:
c = (ok+ng)//2
if S[i:c] in S[c:]:
ok = c
else:
ng ... | import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
S = rs()
dp = [[0] * (N+1) for _ in range(N+1)]
ans = 0
for i in range(N):
for j in range(i+1,N):
if S[i] == S[j]:
if i+... | p02913 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
#二分探索
N = ir()
S = sr()
def check(x):
# x 文字
bl = False
for i in range(N):
for j in range(i+x, N):
if S[i:i+x] == S[j:j+x]:
bl = True
... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
#二分探索
N = ir()
S = sr()
def check(x):
# x文字右側にずらした場所を調べる
candidate = set()
for i in range(N - 2*x + 1):
candidate.add(S[i:i+x])
if S[i+x:i+2*x] in candidat... | p02913 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
s = input().rstrip()
strings = [[] for _ in range(n // 2 + 1)]
for i in range(n):
string = [s[i]]
strings[1].append(s[i])
for j in range(i + 1, n):
string.append(s[j])
if j - i + 1 < 1 + n // 2:
strings... | import sys
input = sys.stdin.readline
n = int(eval(input()))
s = input().rstrip()
def z_algo(S):
N = len(S)
A = [0]*N
i = 1; j = 0
A[0] = l = len(S)
while i < l:
while i+j < l and S[j] == S[i+j]:
j += 1
if not j:
i += 1
continue
... | p02913 |
# -*- coding: utf-8 -*-
import sys
N=int(sys.stdin.readline().strip())
S=sys.stdin.readline().strip()
ans=0 #文字列一致が存在しない場合は0を返す
for i in range(N):
s=S[i]
for j in range(i+1,N):
while j<N: #jが文字列からはみ出さない間はループを回す
t=S[j]
if s==t: #文字が一致したら、jを1つ進める
... | # -*- coding: utf-8 -*-
import sys
N=int(sys.stdin.readline().strip())
S=sys.stdin.readline().strip()
ans=0
for d in range(1,N):
cnt=0
for s,t in zip(S[d:N],S[:N-d]):
if s==t:
cnt+=1
else:
ans=max(ans,min(d,cnt)) #最大の文字列一致はd以下
cnt=0
else:
... | p02913 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
return int(input())
def MI():
return map(int,input().split())
... | from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
return int(input())
def MI():
return map(int,input().split())
... | p02913 |
import sys
import copy
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline(... | import sys
import copy
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline(... | p02913 |
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... | p02913 |
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... | p02913 |
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... | p02913 |
from itertools import combinations
N = int(eval(input()))
S = input().strip()
G = {chr(i):[] for i in range(97,123)}
for i in range(N):
G[S[i]].append(i)
cmax = 0
for a in G:
for x in combinations(G[a],2):
i,j = x[0],x[1]
if i>j:
i,j = j,i
cnt = 0
for k i... | N = int(eval(input()))
S = input().strip()
cmax = 0
for k in range(1,N):
X = S[:N-k]
Y = S[k:]
cur = 0
cnt = 0
for i in range(N-k):
if X[i]!=Y[i]:
cmax = max(cmax,min(cnt,k))
cur = i
cnt = 0
else:
cnt += 1
cmax = max(... | p02913 |
n,s=open(0)
n=int(n)
a=0
for i in range(n):
t=0
for v,w in zip(s,s[i:n]):
t=-~t*(v==w)
if t>i:break
if t>a:a=t
print(a) | n,s=open(0)
n=int(n)
a=0
for i in range(n):
t=0
for v,w in zip(s,s[i:n]):
t=-~t*(v==w)
a=max(a,min(t,i))
print(a) | p02913 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
S = list(input().strip())
dp = [0] * N
max_leng = 0
for i in range(0, N):
leng = 0
idx_i = i
sta_j = -1
j = i - 1
while j > -1:
if sta_j == idx_i:
leng = 0
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
S = list(input().strip())
dp = [[0] * N for i in range(N)]
max_leng2 = 0
for i in range(0, N):
leng2 = 0
j = i - 1
while j > -1:
if S[i] == S[j]:
sta_j = j
if j != ... | p02913 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
mt = 0
for i in range(0, n):
zs = s[i:]
zln = len(zs)
zl = [0] * zln
zi = 1
zj = 0
whil... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
mt = 0
for i in range(n):
zs = s[i:]
zln = len(zs)
zl = [0] * zln
zi = 1
zj = 0
while z... | p02913 |
#!/usr/bin/env python3
import sys
def z_algo(N, S):
end = 1
start = 0
max_length = 0
while start < N:
while end-start > N-end:
break
subword = S[start:end]
if subword in S[end:]:
max_length = max(max_length, len(subword))
end ... | #!/usr/bin/env python3
import sys
def two_pointers(N, S):
end = 1
start = 0
max_length = 0
while start < N:
if end-start > N-end:
break
subword = S[start:end]
if subword in S[end:]:
max_length = max(max_length, len(subword))
e... | p02913 |
import sys
import math
import copy
import random
import itertools
from heapq import heappush, heappop, heapify
from functools import cmp_to_key
from bisect import bisect_left, bisect_right
from collections import defaultdict, deque, Counter
sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.r... | import sys
import math
import copy
import random
import itertools
from heapq import heappush, heappop, heapify
from functools import cmp_to_key
from bisect import bisect_left, bisect_right
from collections import defaultdict, deque, Counter
sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.r... | p02913 |
import collections
class RollingHashSingle:
def __init__(self, s, base, mod):
self.base = base
self.mod = mod
self.hash = [0]
self.power = [1]
for c in s:
self.hash.append((self.hash[-1] * base + ord(c)) % mod)
self.power.append(self.pow... | n = int(eval(input()))
s = input().rstrip()
def check(length):
d = set()
for i in range(n - 2 * length + 1):
d.add(s[i:i + length])
if s[i + length:i + 2 * length] in d:
return True
return False
lo = 0
hi = n // 2 + 1
while lo + 1 < hi:
mid = (lo + hi) // ... | p02913 |
import random
from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
n = int(eval(input()))
s = input().rstrip()
mod = (1<<61)-1
base = 1000+random.randint(0,100)
power = [1]
for i in range(1,n):
power.append((power[-1]*base)%mod)
hvalue = [0]
for i in r... | import random
from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
n = int(eval(input()))
s = input().rstrip()
mod = (1<<61)-1
base = 1000+random.randint(0,100)
power = [1]
for i in range(1,n):
power.append((power[-1]*base)%mod)
hvalue = [0]
for i in ... | p02913 |
import sys
import collections
def main():
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
# s = 'strangeorange'
index_sets = [set() for _ in range(26)]
pointers = []
longest = 0
for i in range(len(s)):
c = s[i]
order = ord(c) - ord('a... |
import sys
import collections
def main():
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
# s = 'strangeorange'
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = 1
res = 0
for i in range(n-1, -1, -1):
for j in range(n-1... | p02913 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
S = readline().strip()
dp = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N - 1, -1, -1):... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
S = readline().strip()
dp = [[0] * (N + 1) for _ in range(N + 1)]
ans = 0
for i in range(... | p02913 |
import heapq
a, b = list(map(int, input().split()))
print((sum(heapq.nlargest(2, [a, a-1, b, b-1]))))
| a, b = list(map(int, input().split()))
print((max([a+b, 2*a-1, 2*b-1])))
| p03071 |
a,b = list(map(int, input().split()))
ans = 0
for i in range(2):
if a >= b:
ans += a
a -= 1
else:
ans += b
b -= 1
print(ans)
| a,b = list(map(int, input().split()))
if abs(a-b) > 0:
print((max(a,b) * 2 - 1))
else:
print((a+b)) | p03071 |
a, b = list(map(int, input().split()))
val1 = a + (a-1)
val2 = b + (b-1)
val3 = a + b
print((max([val1, val2, val3]))) | A, B = list(map(int, input().split()))
large = max(A, B)
if A == B:
print((large + large))
else:
print((large + (large-1))) | p03071 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p03071 |
A, B = list(map(int, input().split()))
if A - B > 1:
x = 2 * A - 1
elif B - A > 1:
x = 2 * B - 1
else:
x = A + B
print(x) | A, B = list(map(int, input().split()))
if A - B >= 2:
print((2 * A - 1))
elif B - A >= 2:
print((2 * B - 1))
else:
print((A + B)) | p03071 |
A,B=list(map(int,input().split()))
if A>B:
print((A+max(A-1,B)))
else:
print((B+max(A,B-1))) | A,B=list(map(int,input().split()))
print((max(A+B,2*A-1,2*B-1))) | p03071 |
# -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))
if A == B:
print((A * 2))
else:
print((max(A, B) * 2 - 1))
| # -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))
print((A * 2 if A == B else max(A, B) * 2 - 1))
| p03071 |
from sys import stdin
input = lambda: stdin.readline().rstrip()
a, b = list(map(int, input().split()))
if a > b:
ans = a + a - 1
elif a < b:
ans = b + b - 1
else:
ans = a + b
print(ans)
| a, b = list(map(int, input().split()))
if a > b:
ans = a + a - 1
elif a < b:
ans = b + b - 1
else:
ans = a + b
print(ans)
| p03071 |
a, b = list(map(int, input().split()))
ans=0
for i in range(2):
ans += max(a,b)
if a>b:
a -=1
else:
b -=1
print(ans) | a, b = list(map(int, input().split()))
preans = max(a*2-1,b*2-1)
ans=max(preans,a+b)
print(ans) | p03071 |
a,b = list(map(int,input().split()))
#押すのはa-a,b-b,a-bのうちのいずれか
print((max(2*a-1,2*b-1,a+b))) | a,b = list(map(int,input().split()))
print((max(2*a-1,2*b-1,a+b)))
| p03071 |
a,b=list(map(int,input().split()))
print((2*max(a,b)-1 if abs(a-b)>1 else a+b)) | a,b=list(map(int,input().split()))
print((max(2*a-1,2*b-1,a+b))) | p03071 |
a,b=list(map(int,input().split()))
print((max(2*a-1,2*b-1,a+b))) | A, B = list(map(int, input().split()))
print((max(2*A-1, 2*B-1, A+B))) | p03071 |
k = input().split()
a = int(k[0])
b = int(k[1])
s = 0
if(a>=b):
s+=a
a-=1
else:
s+=b
b-=1
print((s+max(a,b))) | k = input().split()
a = int(k[0])
b = int(k[1])
print((max(2*a-1,2*b-1,a+b))) | p03071 |
a,b=list(map(int,input().split()))
print((max(a,b)*2-1+int(a==b))) | a,b=list(map(int,input().split()))
print((max(2*a-1,2*b-1,a+b))) | p03071 |
def recur(ba,bb):
if(ba <= 0 and bb <= 0):
return 0
if(ba <= 0):
#only b twice
return (bb*2)-1
elif(bb<=0):
return (ba*2)-1
else:
tb = max(bb+bb-1,recur(ba,bb-2))
ta = max(ba+ba-1,recur(ba-2,bb))
bt = max(ba+bb,recur(ba-1,bb-2))
... | def recur(ba,bb):
tb = (2*bb)-1
ta = (2*ba)-1
bt = ba+bb
return max(max(tb,ta),bt)
a,b = [int(i) for i in input().split()]
print((recur(a,b)))
| p03071 |
A,B = list(map(int,input().split()))
count = 0
for _ in range(2):
if A > B:
count += A
A -= 1
else:
count += B
B -= 1
print(count) | a,b = list(map(int,input().split()))
print((a+max(a-1,b) if a>b else b+max(a,b-1))) | p03071 |
import heapq
import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N, M = list(map(int, sys.stdin.buffer.readline().split()))
S = sys.s... | import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N, M = list(map(int, sys.stdin.buffer.readline().split()))
S = sys.stdin.buffer.re... | p03256 |
N, M = [int(i) for i in input().split(' ')]
import sys
from collections import defaultdict
sys.setrecursionlimit(100000)
s = input().strip()
d = {}
starts = set()
for s1 in 'AB':
d[s1] = {}
for s2 in 'AB':
d[s1][s2] = defaultdict(set)
for ll in sys.stdin:
i, j = ll.strip().split(' ')
... | N, M = [int(i) for i in input().split(' ')]
import sys
from collections import defaultdict
sys.setrecursionlimit(100000)
s = input().strip()
d = {}
starts = set()
for s1 in 'AB':
d[s1] = {}
for s2 in 'AB':
d[s1][s2] = defaultdict(set)
for ll in sys.stdin:
i, j = ll.strip().split(' ')
... | p03256 |
import sys
def solve1(s, cache={}):
n = len(s)
if n == 1:
return 1
r = n
while 1:
i = 1
while i < n:
if s[i] != s[0]:
for k in range(i):
s[k] = s[i]
break
if s[-i-1] != s[-1]:
... | import sys
def solve1(s):
n = len(s)
i = 0
while i <= n // 2:
if s[n // 2] != s[n // 2 - i]:
break
if s[(n - 1) // 2] != s[(n - 1) // 2 + i]:
break
i += 1
return (n - 1) // 2 + i
line = sys.stdin.readline().strip()
print((solve1(list(line... | p03480 |
n,q=list(map(int,input().split()))
ans=[0]*n
for i in range(q):
a,v=list(map(int,input().split()))
ans[a-1]+=v
t=ans.index(max(ans))
print(t+1,ans[t])
exit() | n,q=list(map(int,input().split()))
ans=[0]*n
t=-1
for i in range(q):
a,v=list(map(int,input().split()))
ans[a-1]+=v
if v<0:
t=-1
if t==-1:
t=ans.index(max(ans))
elif ans[t]<ans[a-1] or (ans[t]==ans[a-1] and t>a-1):
t=a-1
print(t+1,ans[t])
exit() | p00099 |
n,q=list(map(int,input().split()))
ans={}
t=-1
for i in range(q):
a,v=list(map(int,input().split()))
if a in ans:
ans[a]+=v
else:
ans[a]=v
if t==-1:
t=a
elif ans[a]>ans[t] or (ans[a]==ans[t] and a<t):
t=a
if v<0:
t=-1
if t==-1:
... | n,q=list(map(int,input().split()))
ans=[0]*n
key=value=0
for i in range(q):
a,v=list(map(int,input().split()))
a-=1
ans[a]+=v
if a==key and v<0:
value=max(ans)
key=ans.index(value)
elif ans[a]>value:
key=a
value=ans[a]
elif ans[a]==value and a<key:
... | p00099 |
from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
while 1:
v, k, p = heappop(que)
... | from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
v, k, p = que[0]
while T[k]!=p:
... | p00099 |
n, q = list(map(int, input().split()))
s = [0]*n
for i in range(q):
a,v = list(map(int, input().split()))
s[a-1] += v
ss = sorted(s,reverse=True)
print(s.index(ss[0])+1,ss[0]) | n, q = list(map(int, input().split()))
s = [0]*n
mx,mxa = 0, 0
for i in range(q):
a,v = list(map(int, input().split()))
s[a-1] += v
if v > 0:
if s[a-1] > mx:
mx = s[a-1]
mxa = a-1
elif s[a-1] == mx:
if a-1 < mxa:
mxa = a-1
elif v < 0:
if a-1 == mxa:
mx = max(s)
mxa = s.index... | p00099 |
n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -1
mx = [0, -1]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if... | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a]... | p00099 |
#!/usr/bin/env python
from sys import stdin, exit, maxsize
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [(1, -maxsize)] * (n//1000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
a -= 1
... | #!/usr/bin/env python
from sys import stdin, exit, maxsize
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [(1, -maxsize)] * (n//10000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
a -= 1
... | p00099 |
#!/usr/bin/env python
from sys import stdin, exit
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
#assert 1 <= n <= 1000000
#assert 1 <= q <= 100000
base = [0] * n
for _ in range(q):
a, v = (int(s) for s in readline().split())
#assert... | #!/usr/bin/env python
from sys import stdin, exit
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [0] * (n//1000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
a -= 1
base[a] += v
... | p00099 |
#!/usr/bin/env python
from sys import stdin, exit
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [0] * (n//1000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
a -= 1
base[a] += v
... | #!/usr/bin/env python
from sys import stdin, exit
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [0] * (n//1000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
a -= 1
base[a] += v
... | p00099 |
#!/usr/bin/env python
from sys import stdin, exit
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [0] * (n//1000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
a -= 1
base[a] += v
... | #!/usr/bin/env python
from sys import stdin, exit
def main(readline=stdin.readline):
n, q = (int(s) for s in readline().split())
base = [0] * n
midway = [0] * (n//100 + 1)
last = [0] * (n//10000 + 1)
for _ in range(q):
a, v = (int(s) for s in readline().split())
... | p00099 |
def f(): return list(map(int,input().split()))
n,q=f()
A=[0]*(n+1)
a0,b0=0,0
for _ in range(q):
a,b=f()
A[a]+=b
if A[a]>b0: a0,b0=a,A[a]
else:
b0=max(A)
a0=A.index(b0)
print(a0,b0) | def f(): return list(map(int,input().split()))
n,q=f()
A=[[0,-i] for i in range(n+1)]
for _ in range(q):
a,b=f()
A[a][0]+=b
m0,m1=sorted(A,key=lambda A:[A[0],A[1]])[-1]
print(-m1,m0) | p00099 |
def f(): return list(map(int,input().split()))
n,q=f()
a0,v0=0,0
A=[0]*(n+1)
for _ in range(q):
a,v=f()
A[a]+=v
c=A[a]
if a==a0 and c<v0:
v0=max(A)
a0=A.index(v0)
elif c>v0: a0,v0=a,c
elif c==v0 and a<a0: a0=a
print(a0,v0) | def f(): return list(map(int,input().split()))
n,q=f()
a0,v0=0,0
A=[0]*(n+1)
for _ in range(q):
a,v=f()
A[a]+=v
if a==a0 and A[a]<v0:
v0=max(A)
a0=A.index(v0)
elif A[a]>v0:
v0=A[a]
a0=a
elif A[a]==v0 and a<a0: a0=a
print(a0,v0) | p00099 |
for _ in range(int(eval(input()))):
a=sorted(map(int,input().split()))
print(('YES' if a[0]**2+a[1]**2==a[2]**2 else'NO')) | for _ in[0]*int(eval(input())):a,b,c=sorted(map(int,input().split()));print((['NO','YES'][a*a+b*b==c*c])) | p00003 |
for _ in[0]*int(eval(input())):
a,b,c=sorted(map(int,input().split()))
print((['NO','YES'][a*a+b*b==c*c]))
| import sys
eval(input())
for e in sys.stdin:
a,b,c=sorted(map(int,e.split()))
print((['NO','YES'][a*a+b*b==c*c]))
| p00003 |
for _ in[0]*int(eval(input())):
a,b,c=sorted(map(int,input().split()))
print((['NO','YES'][a*a+b*b==c*c]))
| import sys
eval(input())
for a,b,c in [sorted(map(int,x.split())) for x in sys.stdin]:
print((['NO','YES'][a*a+b*b==c*c]))
| p00003 |
for i in range(0, int(eval(input()))):
sidelen = [int(j) for j in input().split(" ")]
sidelen.sort(reverse=True)
if(sidelen[0]**2 == sidelen[1]**2 + sidelen[2]**2):
print("YES")
else:
print("NO") | import sys
for i in sys.stdin:
try:
sidelen = [int(j) for j in i.split(" ")]
sidelen.sort(reverse=True)
if(sidelen[0]**2 == sidelen[1]**2 + sidelen[2]**2):
print("YES")
else:
print("NO")
except:
continue | p00003 |
N = int(eval(input()))
for _ in range(N):
a, b, c = sorted(list(map(int, input().split())))
print(("YES" if a*a + b*b == c*c else "NO")) | N = int(eval(input()))
for _ in range(N):
a, b, c = sorted(map(int, input().split()))
print(("YES" if a*a + b*b == c*c else "NO")) | p00003 |
for n in range(eval(input())):
a,b,c=sorted(map(int,input().split()))
s="YES" if a*a+b*b==c*c else "NO"
print(s) | for n in range(eval(input())):
a,b,c=sorted(map(int,input().split()))
print("YES" if a*a + b*b == c*c else "NO") | p00003 |
import sys
r = []
n = int(eval(input()))
l = sys.stdin.readlines()
for i in l:
x, y, z = sorted([x*x for x in list(map(int, i.split()))])
if x + y == z:
print("YES")
else:
print("NO") | import sys
n = int(input())
l = sys.stdin.readlines()
s = ""
for i in l:
x, y, z = sorted(map(lambda x:x*x,map(int, i.split())))
if x + y == z:
s += "YES\n"
else:
s += "NO\n"
print(s,end="")
| p00003 |
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
counter = {i: 0 for i in range(-1, 10)}
for i in range(H):
tmp = list(map(int, input().split()))
for j in range(W):
counter[tmp[j]] += 1
MAX = 10**4
INF = float("inf")
def f(start):
if start =... | """ABC079D Wall 別解
ワーシャルフロイドでやった場合
"""
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
counter = {i: 0 for i in range(-1, 10)}
for i in range(H):
tmp = list(map(int, input().split()))
for j in range(W):
counter[tmp[j]] += 1
dp = c.copy()
f... | p03546 |
h, w = list(map(int, input().split()))
c = [0]*10
for i in range(10):
c[i] = [int(x) for x in input().split()]
for _ in range(10):
for i in range(10):
for j in range(10):
for k in range(10):
c[i][j] = min([c[i][j], c[i][k]+c[k][j]])
ans = 0
for i in range(h):
a = [int(x) for x in ... | h, w = list(map(int, input().split()))
c = [0]*10
for i in range(10):
c[i] = [int(x) for x in input().split()]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min([c[i][j], c[i][k]+c[k][j]])
ans = 0
for i in range(h):
a = [int(x) for x in input().split()]
for j i... | p03546 |
H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
A = []
for _ in range(H):
A += list(map(int, input().split()))
for i in range(10):
for j in range(10):
for k in range(10):
C[j][k] = min(C[j][k], C[j][i]+C[i][k])
from collections i... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
from heapq import heappop, heappush
H, W = mapint()
Cs = [list(mapint()) for _ in range(10)]
lis = []
for h in range(H):
lis.extend(list(mapint()))
def dijkstra... | p03546 |
H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for i in range(10)]
G = [list(map(int, input().split())) for i in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for row in G:
for... | H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for h in range(H):... | p03546 |
#!/usr/bin/env python3
def main():
H, W = list(map(int, input().split()))
INF = 10**12
c = [None for _ in range(10)]
for i in range(10):
c[i] = list(map(int, input().split()))
for k in range(10):
for i in range(10):
for j in range(10):
c[i]... | from heapq import heappop, heappush
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
# Dijkstra法で1からの距離を求める
INF = 10**12
q = [(0,1)] # 始点のコストとindex
d = [INF] * 10
d[1] = 0
while len(q) > 0:
cost, u = heappop(q)
#print(u,c[u])
for v in range(10... | p03546 |
import heapq
import sys
H, W = list(map(int, input().split()))
a = [[] for i in range(10)]
for i in range(10):
c = [int(j) for j in input().split()]
for j in range(10):
a[i].append([c[j], j])
ans = 0
for i in range(H):
A = [int(j) for j in input().split()]
for j in A:
if j == -1:
continue
b... | H, W = list(map(int, input().split()))
c = [[int(j) for j in input().split()] for i in range(10)]
for i in range(10):
for j in range(10):
if i == j:
continue
for k in range(10):
if j == k:
continue
if c[i][k] + c[j][i] < c[j][k]:
c[j][k] = c[i][k] + c[j][i]
ans = 0
for i in range(H):
... | p03546 |
H, W = (int(i) for i in input().split())
#m = [[int(i) for i in input().split] for i in range(1)]
m = []
for i in range(10):
m.append(list(map(int, input().split())))
wall = []
for i in range(H):
wall.append(list(map(int, input().split())))
# wall = [[int(i) for i in input().split] for i in range(H)]
cost... | H, W = (int(i) for i in input().split())
#m = [[int(i) for i in input().split] for i in range(1)]
m = []
for i in range(10):
m.append(list(map(int, input().split())))
wall = []
for i in range(H):
wall.append(list(map(int, input().split())))
# wall = [[int(i) for i in input().split] for i in range(H)]
cost... | p03546 |
h,w=list(map(int,input().split()))
c=[]
for i in range(10):
l=[int(i) for i in input().split()]
c.append(l)
a=[]
for i in range(h):
l=[int(i) for i in input().split()]
a.append(l)
p=[0]*10
for i in range(10):
if i==1: continue
d=[1003]*10
d[i]=0
q=set([i])
while 1:
... | def sol():
h,w=list(map(int,input().split()))
c=[]
for i in range(10):
l=[int(i) for i in input().split()]
c.append(l)
a=[]
for i in range(h):
l=[int(i) for i in input().split()]
a.append(l)
p=[0]*10
for i in range(10):
if i==1: continue
... | p03546 |
def sol():
h,w=list(map(int,input().split()))
c=[]
for i in range(10):
l=[int(i) for i in input().split()]
c.append(l)
a=[]
for i in range(h):
l=[int(i) for i in input().split()]
a.append(l)
p=[0]*10
for i in range(10):
if i==1: continue
... | def sol():
h,w=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(10)]
a=[list(map(int,input().split())) for i in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
#if (c[i][k]!=0 and c[k][j]!=0): c[i][j]=min(c[i... | p03546 |
def main():
h, w, *ca = list(map(int, open(0).read().split()))
it = list(zip(*[iter(ca[:100])] * 10))
*c, = [list(i) for i in it]
a = ca[100:]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
an... | def main():
h, w, *ca = list(map(int, open(0).read().split()))
it = list(zip(*[iter(ca[:100])] * 10))
*c, = [list(i) for i in it]
a = ca[100:]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
an... | p03546 |
import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
a = [list(map(int, input().split())) for _ in range(H)]
res = 0
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][k] + c[k][j], c[i][j])... | import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
res = 0
for _ in range(H):
a = list(map(int, input().split()... | p03546 |
import sys
input = sys.stdin.readline
def floyd_warshall(dist):
v = len(dist)
for k in range(v):
for i in range(v):
for j in range(v):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())... | import sys
input = sys.stdin.readline
def floyd_warshall(dist):
v = len(dist)
for k in range(v):
for i in range(v):
for j in range(v):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())... | p03546 |
import itertools
h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
a = [list(map(int,input().split())) for _ in range(h)]
ans = 0
def bfs(x):
if x[-1]==1:
global s
buf = 0
for i in range(len(x)-1):
buf += c[x[i]][x[i+1]]
... | import itertools
import collections
h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
a = [list(map(int,input().split())) for _ in range(h)]
a = list(itertools.chain.from_iterable(a))
b = collections.Counter(a)
ans = 0
def bfs(x):
if x[-1]==1:
global s
... | p03546 |
import itertools
import collections
h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
a = [list(map(int,input().split())) for _ in range(h)]
a = list(itertools.chain.from_iterable(a))
b = collections.Counter(a)
ans = 0
def bfs(x):
if x[-1]==1:
global s
... | h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
a = [list(map(int,input().split())) for _ in range(h)]
n = 10
for k in range(n):
for i in range(n):
for j in range(n):
c[i][j] = min(c[i][j],c[i][k]+c[k][j])
ans = 0
for i in a:
for j in i:... | p03546 |
from queue import Queue
import heapq
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(x): print(x, fi... | from queue import Queue
import heapq
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(x): print(x, fi... | p03546 |
H,W = list(map(int,input().split()))
c = [list(map(int,input().split())) for i in range(10)]
import queue
def dist(i):
res = c[i][1]
que = queue.Queue()
path = []
for j in range(10):
if j != i and j != 1:
path.append(j)
for j in range(10):
if j != 1 and j != ... | H,W = list(map(int,input().split()))
c = [list(map(int,input().split())) for i in range(10)]
import queue
d = c.copy()
for k in range(10):
for i in range(10):
for j in range(10):
if d[i][j] > d[i][k]+d[k][j]:
d[i][j] = d[i][k]+d[k][j]
cost = []
for i in range(10... | p03546 |
h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
a = [list(map(int,input().split())) for _ in range(h)]
def dfs(nv,vl,cost):
if nv==1:
return cost
vl_ = vl.copy()
vl_.append(nv)
ret = []
for i in range(10):
if not i in vl_:
... | h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
a = [list(map(int,input().split())) for _ in range(h)]
memo = {}
def dfs(nv,vl,cost):
if nv==1:
return cost
if nv in list(memo.keys()):
return cost+memo[nv]
vl_ = vl.copy()
vl_.append(n... | p03546 |
H,W=list(map(int,input().split()))
S=[list(map(int, input().split())) for i in range(10)]
l=[None]*10
for i in range(10):
l[i]=S[i][1]
for i in range(8):
for j in range(10):
for k in range(10):
if l[j]>l[k]+S[j][k]:
l[j]=l[k]+S[j][k]
l.append(0)
a=0
for i in range... | H,W=list(map(int,input().split()))
S=[list(map(int, input().split())) for i in range(10)]
l=[None]*10
for i in range(10):
l[i]=S[i][1]
for i in range(7):
for j in range(10):
for k in range(10):
if l[j]>l[k]+S[j][k]:
l[j]=l[k]+S[j][k]
l.append(0)
a=0
for i in range... | p03546 |
H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(10)]
a=[list(map(int,input().split())) for i in range(H)]
INF=10**10
tmp=[[INF]*10 for i in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
tmp[i][j]=min(c[i][k]+c[k][j] for k in ... | H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(10)]
INF=10**10
tmp=[[INF]*10 for i in range(10)]
for k in range(9):
for i in range(10):
for j in range(10):
tmp[i][j]=min(c[i][k]+c[k][j] for k in range(10))
c[i][j]=min(tmp[i][j],c[i][j])
... | p03546 |
H, W=list(map(int,input().strip().split(' ')))
cost=[]
for i in range(10):
cost.append(list(map(int,input().strip().split(' '))))
for k in range(10):
for i in range(10):
for j in range(10):
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j])
ans=0
for i in range(H):
a=list(map... | H, W=list(map(int,input().strip().split(' ')))
def w_f():
cost=[]
for i in range(10):
cost.append(list(map(int,input().strip().split(' '))))
for k in range(10):
for i in range(10):
for j in range(10):
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j])
... | p03546 |
H, W = list(map(int, input().split()))
c = [[0]*10 for i in range(10)]
for i in range(10):
a = list(map(int, input().split()))
for j in range(10):
c[i][j] = a[j]
A = [[0]*W for i in range(H)]
for i in range(H):
a = list(map(int, input().split()))
for j in range(W):
A[i][j] ... | H, W = list(map(int, input().split()))
c = [[0]*10 for i in range(10)]
for i in range(10):
a = list(map(int, input().split()))
for j in range(10):
c[i][j] = a[j]
A = [[0]*W for i in range(H)]
for i in range(H):
a = list(map(int, input().split()))
for j in range(W):
A[i][j... | p03546 |
def dijkstra(graph,src):
if graph is None:
return None
nodes = [i for i in range(len(graph))]
visited=[]
if src in nodes:
visited.append(src)
nodes.remove(src)
else:
return None
distance={src:0}
for i in nodes:
distance[i]=int(graph[src][i]... | def dijkstra(graph,src):
if graph is None:
return None
nodes = [i for i in range(len(graph))]
visited=[]
if src in nodes:
visited.append(src)
nodes.remove(src)
else:
return None
distance={src:0}
for i in nodes:
distance[i]=int(graph[src][i]... | p03546 |
def dijkstra(graph,src):
if graph is None:
return None
nodes = [i for i in range(len(graph))]
visited=[]
if src in nodes:
visited.append(src)
nodes.remove(src)
else:
return None
distance={src:0}
for i in nodes:
distance[i]=int(graph[src][i]... | if __name__=="__main__":
sum = 0
x,y = list(map(int,input().split()))
c = [list(map(int,input().split())) for n in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
if c[i][j]>c[i][k]+c[k][j]:
c[i][j] = c[i][k]+c[k][j]
... | p03546 |
h,w=list(map(int,input().split()))
b=[list(map(int,input().split()))for _ in range(10)]
for i in range(10):
for j in range(10):
for k in range(10):b[j][k]=min(b[j][k],b[j][i]+b[i][k])
c=[b[i][1]for i in range(10)]+[0]
a=0
for i in range(h):
for j in input().split():a+=c[int(j)]
print(a) | h,w=list(map(int,input().split()))
c=[list(map(int,input().split()))for _ in range(10)]
for i in range(10):
for j in range(10):
for k in range(10):c[j][k]=min(c[j][k],c[j][i]+c[i][k])
co=[c[i][1] for i in range(10)]
ans=0
for _ in range(h):
for i in list(map(int,input().split())):
if i!=-1:ans+=co[i]
pr... | p03546 |
from itertools import permutations
h,w=list(map(int,input().split()))
C=[list(map(int,input().split())) for i in range(10)]
cost=[C[i][1] for i in range(10)]
for i in range(10):
if i!=1:
keiyu=[x for x in range(10) if x!=1 and x!=i]
for j in range(9):
perm=permutations(keiyu,r=... | from itertools import permutations
h,w=list(map(int,input().split()))
es=[[] for i in range(10)]
for i in range(10):
e=list(map(int,input().split()))
for j in range(10):
if i!=j:
es[i].append([e[j], j])
n=10
import heapq
def dijkstra_heap(s):
d = [float("inf")] * n
... | p03546 |
import collections
h,w = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
a = [list(map(int, input().split())) for _ in range(h)]
result = [0]*10
def way(n,e,i,p): #現在の数字、現在の必要魔力、始点、暫定最低魔力
for j in range(0,10):
if (n == j):
continue
... | h,w = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
a = [list(map(int, input().split())) for _ in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k]+c[k][j])
ans = 0
for i in rang... | p03546 |
def minindex(arrived,costs):
mindex = "end"
curmin = 100000000
for i in range(10):
if arrived[i]:continue
if curmin>costs[i]:
mindex = i
curmin = costs[i]
return mindex
H,W = list(map(int,input().split()))
C = [[int(j) for j in input().split()] for i i... | inf = 1000000000
H,W = list(map(int,input().split()))
C = [[int(j) for j in input().split()] for i in range(10)]
#C[i][j]はiをjにするコスト
#各ノードから１への最短距離
for m in range(10):
for s in range(10):
for g in range(10):
C[s][g] = min(C[s][g],C[s][m] + C[m][g])
def maryoku(x):
if x == -1:r... | p03546 |
h,w = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(10)]
A = [list(map(int,input().split())) for i in range(h)]
inf = float('inf')
cost = 0
D = [[inf]*10 for i in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
D[i][j] = min(C[i... | h,w = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(10)]
A = [list(map(int,input().split())) for i in range(h)]
INF = float('inf')
cost = 0
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j],C[i][k]+C[k][j])
for y in r... | p03546 |
inf = float("inf")
H, W = list(map(int, input().split()))
C = []
for _ in range(10):
c = [int(s) for s in input().split()]
C.append(c)
A = []
for _ in range(H):
a = [int(s) for s in input().split()]
for ai in a:
if ai != -1:
A.append(ai)
for _ in range(9):
for i in... | H, W = list(map(int, input().split()))
C = []
for _ in range(10):
c = [int(s) for s in input().split()]
C.append(c)
A = []
for _ in range(H):
a = [int(s) for s in input().split()]
for ai in a:
if ai != -1:
A.append(ai)
for k in range(10):
for i in range(10):
... | p03546 |
from itertools import permutations
h, w = list(map(int, input().split()))
c = []
for _ in range(10):
c.append(list(map(int, input().split())))
a = [0]*10
for _ in range(h):
for i in map(int, input().split()):
if i<0:
continue
a[i] += 1
ans = 0
for i in range(10):
... | from itertools import permutations
h, w = list(map(int, input().split()))
c = []
for _ in range(10):
c.append(list(map(int, input().split())))
a = [0]*10
for _ in range(h):
for i in map(int, input().split()):
if i<0:
continue
a[i] += 1
INF = 10**10
q = list(range(10))
di... | p03546 |
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
flag = True
while flag:
flag = False
for i in range(10):
for j in range(10):
for k in range(10):
if c[i][k] + c[k... | def main():
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
flag = True
while flag:
flag = False
for i in range(10):
for j in range(10):
for ... | p03546 |
import sys
H, W = list(map(int, input().split()))
C = [list(map(int, sys.stdin.readline().rsplit())) for _ in range(10)]
A = [list(map(int, sys.stdin.readline().rsplit())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
if C[i][j] > C[i][k] + C[k][j]:
... | import sys
def warshall_floyd():
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
H, W = list(map(int, input().split()))
inf = float("inf")
C = [list(map(int, sys.stdin.readline().rsplit())) for _ in range(10)]
A =... | p03546 |
import heapq
H, W = list(map(int, input().split()))
C = []
for _ in range(10):
c = list(map(int, input().split()))
C.append(c)
A = []
for _ in range(H):
a = list(map(int, input().split()))
A.append(a)
def dijkstra(start, goal, n, edge):
d = [float("inf")] * n
d[start] = 0
... | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
H, W = list(map(int, input().split()))
C = []
for _ in range(10):
c = list(map(int, input().split()))
C.append(c)
A = []... | p03546 |
H,W = list(map(int,input().split()))
C = []
for i in range(10):
c = list(map(int,input().split()))
C.append(c)
A = []
for i in range(H):
a = list(map(int,input().split()))
A.append(a)
#最短距離 (V:頂点数,E:辺数)
#BFS : コスト1 O(E)
#Dijkstra : コスト任意 O(ElogE)
#Floyd Warshall O(V^3) → 今回 V=10 → OK
#「「「Flo... | H,W = list(map(int,input().split()))
C = []
for i in range(10):
c = list(map(int,input().split()))
C.append(c)
A = []
for i in range(H):
a = list(map(int,input().split()))
A.append(a)
for i in range(10):
for j in range(10):
for k in range(10):
C[j][k] = min(C[j][k],C[j][i]+C[i][k])... | p03546 |
def rec_cost(x,acc,plist,clist):
if x == 1:
return acc
else:
minimum = -1
for next in plist:
nextplist = plist.copy()
nextplist.remove(next)
candidate = rec_cost(next,acc+clist[x][next],nextplist,clist)
if minimum == -1:
minimum = candidate
elif candidate... | def cost(n,clist):
k = 0
while k < 10:
i = 0
while i < 10:
j = 0
while j < 10:
clist[i][j] = min(clist[i][j],clist[i][k]+clist[k][j])
j += 1
i += 1
k += 1
return clist[n][1]
def joisino(a,clist):
note = [-1,0,-1,-1,-1,-1,-1,-1,-1,-1]
answer = 0
... | p03546 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.