input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [False] * (10 ** 5 + 10)
for i in range(1, K+1):
dp[i] = not all(dp[i-a] if i-a >= 0 else True for a in A)
print(("First" if dp[K] else "Second"))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [False] * (10 ** 5 + 10)
for i in range(1, K+1):
# dp[i-a]の中でどこか一つでもFalseになるdp[i]があればTrueを設定する
# dp[i-a]がFalseということは、次の手番の相手を負かす取り方が存在するということになるので、この手番でa個取って相手の順番に回してしまえば勝ちが確定する
# お互いが交互に数字を言っていって、最後に30を言ったほうの負け（最大+3）まで
... | p03170 |
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
dp = [False] * (k + 1)
for i in range(1, k+1):
for a in arr:
if i - a >= 0 and not dp[i - a]:
dp[i] = True
print(("First" if dp[k] else "Second"))
| n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
dp = [False] * (k + 1)
for i in range(k + 1):
if not dp[i]:
for a in arr:
if i + a > k:
break
dp[i + a] = True
print(("First" if dp[k] else "Second"))
| p03170 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
from bisect import bisect_left... | def main():
N, K, *A = list(map(int, open(0).read().split()))
dp = [0] * (K + 1)
for i in range(K):
if dp[i]:
continue
for a in A:
if i + a > K:
break
dp[i + a] = 1
print(("First" if dp[-1] else "Second"))
if __name__ == "__m... | p03170 |
import sys
sys.setrecursionlimit(10**7)
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
def func():
for i in range(1, K+1):
for j in range(N):
if i - A[j] >= 0:
dp[i] |= ~dp[i - A[j]]
dp = [0 for i in range(K+1)]
fu... | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
dp = [0 for i in range(K+1)]
for i in range(K+1):
if not dp[i]:
for j in range(N):
if i + A[j] < K + 1:
dp[i+A[j]] = 1
if dp[K]: print("First")
else... | p03170 |
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [False] * (K+1)
for i in range(1, K+1):
for j in range(N):
if 0 <= i - a[j] and not dp[i-a[j]]:
dp[i] = True
print(("First" if dp[K] else "Second")) | N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [False] * (K+1)
for i in range(1, K+1):
for j in range(N):
if 0 <= i - a[j] and not dp[i-a[j]]:
dp[i] = True
break
print(("First" if dp[K] else "Second")) | p03170 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
dp = [False]*(k+1)
for i in range(1,k+1):
for j in range(n):
if i-a[j]<0:
break
if dp[i-a[j]]==False:
dp[i] = True
if dp[k]==True:
print("First")
else:
print("Second")
| n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
dp = [False]*(k+1)
for i in range(1,k+1):
for j in range(n):
if i-a[j]<0:
break
if dp[i-a[j]]==False:
dp[i] = True
break
if dp[k]==True:
print("First")
else:
print("Second... | p03170 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[False]*(k+1)
for i in range(k+1):
for j in range(n):
if i-a[j]>=0:
dp[i]|=not dp[i-a[j]]
if dp[k]:
print('First')
else:
print('Second') | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[False]*(2*k+1)
for i in range(k+1):
for j in a:dp[i+j]|=not dp[i]
if dp[k]:
print('First')
else:
print('Second') | p03170 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[0]*(2*k+1)
for i in range(k+1):
for j in a:dp[i+j]|=~dp[i]
if dp[k]:
print('First')
else:
print('Second') | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[False]*(2*k+1)
for i in range(k+1):
for j in a:dp[i+j]|=not dp[i]
if dp[k]:
print('First')
else:
print('Second')
| p03170 |
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * (K + 1)
for i in range(1, K + 1):
for j in range(N):
if i - a[j] >= 0 and dp[i - a[j]] == 0:
dp[i] = 1
print(('First' if dp[K] else 'Second'))
| N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * (K + 1)
for i in range(1, K + 1):
for j in a:
if i - j >= 0 and dp[i - j] == 0:
dp[i] = 1
print(('First' if dp[K] else 'Second'))
| p03170 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
mini=min(a)
dp1=[-1 for i in range(k+1)]
dp2=[-1 for i in range(k+1)]
for x in range(k+1):
if x == 0 or mini > x:
dp1[x]=False
dp2[x]=False
continue
dp1[x]=False
dp2[x]=False
for v in a:
if v>x:
continue
dp1[x]=dp1[x] or... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
mini=min(a)
dp=[-1 for i in range(k+1)]
for x in range(k+1):
if x == 0 or mini > x:
dp[x]=False
continue
dp[x]=False
for v in a:
if v>x:
continue
dp[x]=dp[x] or not dp[x-v]
if dp[k]:
print("First")
else:
print("Secon... | p03170 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[False]*(k+1)
for i in range(1,len(dp)):
for x in a:
if i-x>=0:
dp[i]|=not dp[i-x]
print((("Second","First")[dp[k]])) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[False]*(k+1+max(a))
for i in range(1+k):
if not dp[i]:
for x in a:
dp[i+x]=True
print((("Second","First")[dp[k]]))
| p03170 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p03170 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * (k+1)
for i in range(k+1):
dp[i] = 0
for j in a:
if j > i:
break
dp[i] = dp[i] or (1 - dp[i-j])
print((['Second', 'First'][dp[k]])) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * (k+1) #残りの石iで回ってきたときの勝敗
for i in range(k+1):
dp[i] = 0
for j in a:
if j > i:
break
if 1 - dp[i-j]:
dp[i] = 1
break
print((['Second', 'First'][dp[k]])) | p03170 |
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
dp = [False]*(k+1)
for i in range(1,k+1):
for j in range(n):
if i-a_list[j] >= 0:
dp[i] |= not(dp[i-a_list[j]])
if dp[k]:
print('First')
else:
print('Second') | import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
dp = [False]*(k+1)
for i in range(1,k+1):
for j in range(n):
if i-a_list[j] >= 0:
dp[i] |= not(dp[i-a_list[j]])
if dp[k]:
print('First')
... | p03170 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
S = [ord(c) for c in input().rstrip()]
Q = int(eval(input()))
k = list(map(int, input().split()))
dd = ord('D')
mm = ord('M')
cc = ord('C')
for l in k:
D = M = tmp = ans = 0
for i in range(N):
if i >= l:
if S[i-l... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
S = input().rstrip()
Q = int(eval(input()))
k = list(map(int, input().split()))
for l in k:
D = 0
M = 0
tmp = 0
ans = 0
for i in range(N):
if i >= l:
... | p03216 |
import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print(('\n'.join(m... | import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print(('\n'.join(m... | p03216 |
import sys
rl = sys.stdin.readline
N = int(rl())
S = rl()
Q = int(rl())
ks = list(map(int,rl().split()))
ans = []
for k in ks:
d = m = 0
dm = dmc = 0
for i in range(N):
if i >= k:
if S[i-k] == 'D':
d -= 1
dm -= m
elif S[i-k] ==... | import sys
input = sys.stdin.readline
N = int(input())
S = input()
Q = int(input())
K = list(map(int,input().split()))
ans = []
for k in K:
d = m = dm = dmc = 0
for i in range(N):
if i >= k:
if S[i-k] == 'D':
d -= 1
dm -= m
elif S[i... | p03216 |
N = int(eval(input()))
S = input().strip()
qn = int(eval(input()))
qs = list(map(int, input().split()))
dp = [[0,0,0]]
As = [0]*qn
d=m=dm=0
for i, w in enumerate(S):
i += 1
if w=="D":
d+=1
elif w == "M":
m+=1
dm+=d
elif w == "C":
for j, q in enumerate(qs):
... | N = int(eval(input()))
S = input().strip()
qn = int(eval(input()))
qs = list(map(int, input().split()))
dd,mm,cc = [0],[0],[0]
As = [0]*qn
d=m=dm=0
for i, w in enumerate(S):
i += 1
if w=="D":
d+=1
elif w == "M":
m+=1
dm+=d
elif w == "C":
for j, q in enumera... | p03216 |
N = int(eval(input()))
S = input().strip()
qn = int(eval(input()))
qs = list(map(int, input().split()))
dp = [[0,0,0]]
As = [0]*qn
d=m=dm=0
for i, w in enumerate(S):
i += 1
if w=="D":
d+=1
elif w == "M":
m+=1
dm+=d
elif w == "C":
for j, q in enumerate(qs):
... | N = int(eval(input()))
S = input().strip()
qn = int(eval(input()))
qs = list(map(int, input().split()))
dd,mm,cc = [0],[0],[0]
As = [0]*qn
d=m=dm=0
for i, w in enumerate(S):
i += 1
if w=="D":
d+=1
elif w == "M":
m+=1
dm+=d
elif w == "C":
for j, q in enumera... | p03216 |
# -*- coding: utf-8 -*-
s = input().strip()
#----------
loc_A=len(s)+1
loc_Z=-1
for i in range(len(s)):
if s[i] == "Z" and loc_Z < i:
loc_Z = i
elif s[i] == "A" and i < loc_A:
loc_A = i
print(( loc_Z - (loc_A - 1) ))
| # -*- coding: utf-8 -*-
s=input().strip()
for i,word in enumerate(s):
if word == "A":
start = i
break
for i,word in enumerate( reversed(s) ):
if word == "Z":
end = len(s)-1-i
break
print(( end-start+1 ))
| p03814 |
import sys
sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
# import fractions
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda... | import sys
sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
# import fractions
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda... | p03814 |
string = input().rstrip("\n")
string_r = "".join(reversed(string))
print((len(string) - string_r.index("Z") - string.index("A"))) | [print(len(string) - string[::-1].index("Z") - string.index("A")) for string in [input()]]
| p03814 |
prime = [False] * (10 ** 6)
prime[0] = True
prime[1] = True
for i in range(2, 10 ** 6):
if prime[i] == False:
for j in range(i * 2, 10 ** 6, i):
prime[j] = True
while True:
a, d, n = list(map(int, input().split()))
if a == 0:
break
cnt = 0
for i in ran... | import math
prime = [False] * (10 ** 6)
prime[0] = True
prime[1] = True
limit = int(math.sqrt(10 ** 6) + 1)
for i in range(2, limit):
if prime[i] == False:
for j in range(i * 2, 10 ** 6, i):
prime[j] = True
while True:
a, d, n = list(map(int, input().split()))
if a =... | p00722 |
def shuffle(deck,x,y):
cnter = 0
i = 0
sectiona = []
while (cnter < x):
nextsize = deck[i][1] - deck[i][0] + 1
if(x-cnter >= nextsize):
sectiona.append(deck[i])
cnter += nextsize
i += 1
else:
sectiona.append([deck[i][0],d... | def shuffle(deck,x,y):
cnter = 0
i = 0
sectiona = sectionb = []
while (cnter < x):
nextsize = deck[i][1] - deck[i][0] + 1
if(x-cnter >= nextsize):
cnter += nextsize
i += 1
else:
sectiona = [[deck[i][0],deck[i][0] + x-cnter - 1]]
... | p00459 |
import sys
N = int(sys.stdin.readline().strip())
T = list(map(int, sys.stdin.readline().strip().split()))
A = list(map(int, sys.stdin.readline().strip().split()))
# i番目の山が取りうる高さの下限、上限
cand = [[1, float("inf")] for _ in range(N)]
l_max = 0
for i in range(N):
if l_max < T[i]:
l_max = T[i]
... | import sys
input = sys.stdin.readline
N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
if N == 1:
if T[0] == A[0]:
print((1))
else:
print((0))
sys.exit()
mod = 10**9 + 7
ans = 1
for i in range(N):
if i == 0:
if ... | p03959 |
# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists
from bisect import bisect_left as bs
def main():
"""
/----\ <- xi (= yi)
/ \--\
/ \
xi yi
0 ~ xi / xi ~ yi / yi+1 ~ N-1
"""
N = int(eval(input()))
T = tuple(map(int, input().split()))
... | # code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists
def main():
"""
/----\ <- x = y
/ \--\
/ \
xi yi
0 ~ xi / xi ~ yi / yi+1 ~ N-1
"""
N = int(eval(input()))
T = tuple(map(int, input().split()))
A = tuple(map(int, input().split()))
x, ... | p03959 |
#!/usr/bin/env python3
#CODEFESTIVAL2016 qualC C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from colle... | #!/usr/bin/env python3
#CODEFESTIVAL2016 qualC C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from colle... | p03959 |
n = int(eval(input()))
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
ans, l, r = 1, 0, n - 1
for i in range(1, n):
if t[i] == t[i - 1]:
ans = ans * t[i] % mod
if t[i] == a[i]:
l = i
break
for i in range(n - 1)[::-1]:
if a[i] =... | n = int(eval(input()))
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 1
if n == 1:
print((int(t == a)))
exit()
for i in range(1, n - 1):
ht, ha = 0, 0
if t[i - 1] < t[i] and a[i] > a[i + 1]:
if t[i] != a[i]:
print((0))
... | p03959 |
n = int(eval(input()))
T = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
B = [10**9] * n
if max(T) != max(A):
print((0))
exit()
h = 0
for i, t in enumerate(T):
if h < t:
B[i] = 1
h = t
else:
B[i] = h
h = 0
for ... | n = int(eval(input()))
T = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
B = [10**9] * n
if max(T) != max(A):
print((0))
exit()
h = 0
for i, t in enumerate(T):
if h < t:
B[i] = 1
h = t
else:
B[i] = h
h = 0
for ... | p03959 |
from itertools import groupby
from functools import reduce
MOD = 1000000007
def max_t():
i, t_max = 0, 0
for j, v in enumerate(t):
if v < t_max:
print((0))
quit(0)
if v > t_max:
t_max = v
i = j
return i, t_max
def validate_... | from itertools import groupby
from functools import reduce
MOD = 1000000007
def mod_pow(x, k):
ret = 1
while k > 0:
if k & 1:
ret *= x
ret %= MOD
k >>= 1
x *= x
x %= MOD
return ret
def max_t():
i, t_max = 0, 0
for j, v in... | p03959 |
N = int(eval(input()))
T = list(map(int,input().split()))
A = list(map(int,input().split()))
A.append(1)
count = 0
Tmax = 1
Amax = 1
T2 = [0] * N
A2 = [0] * N
ans = 1
for i in range(N):
if T[i] > Tmax and A[i] > A[i+1] and T[i] != A[i]:
ans = 0
break
elif T[i] > Tmax and A[i] > A... | N = int(eval(input()))
T = list(map(int,input().split()))
A = list(map(int,input().split()))
A.append(1)
count = 0
Tmax = 1
Amax = 1
T2 = [0] * N
A2 = [0] * N
ans = 1
for i in range(N):
if T[i] > Tmax:
Tmax = T[i]
if A[i] > A[i+1]:
Amax = A[i+1]
if T[i] == A[... | p03959 |
#import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(eval(input()))
mod = 10**9+7
def factorial(n):
fact = 1
for integer in range(1... | import sys
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(eval(input()))
mod = 10**9+7
def factorial(n):
fact = 1
for integer in range(1, n + 1):
fact *= integer
return fact
def serch(x, cou... | p03959 |
def inpl(): return [int(i) for i in input().split()]
mod = 10**9+7
N = int(eval(input()))
T = inpl()
A = inpl()
summit = T[-1]
S = [i == j == summit for i, j in zip(A, T)]
ans, pre = 1, 0
if A[0] != summit:
ans = 0
if not any(S):
ans = 0
k = sum([min(i, j) == summit for i, j in zip(A, T)])
for ... | import sys
mod = 10**9 + 7
def nai():
print((0))
sys.exit()
N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
M = max(A)
if M != max(T):
nai()
iT = T.index(M)
iA = N - 1 - A[::-1].index(M)
if iA < iT:
nai()
ans = pow(M, max(0, iA - iT -... | p03959 |
N=int(eval(input()))
*T, = list(map(int,input().split()))
*A, = list(map(int,input().split()))
mod = 10**9+7
mT = [T[0]]*N
MT = [T[0]]*N
for i,t in enumerate(T[1:],1):
if t>T[i-1]:
mT[i] = t
MT[i] = t
else:
mT[i] = 1
MT[i] = t
mA = [A[-1]]*N
MA = [A[-1]]*N
for i,... | N=int(eval(input()))
*T, = [0] + list(map(int,input().split())) + [0]
*A, = [0] + list(map(int,input().split())) + [0]
mod = 10**9+7
M = list(map(min,list(zip(A,T))))[1:-1]
m = [max(T[i] if T[i]>T[i-1] else 1, A[i] if A[i]>A[i+1] else 1) for i in range(1,N+1)]
ans = 1
for a,b in zip(m,M): ans = ans * max(0,b-a+1... | p03959 |
def read():
return [int(i) for i in input().split(" ")]
N = int(eval(input()))
T = read()
A = read()
t = [(i != j, i) for i, j in zip(T, [None] + T)]
a = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]
P = 1
for p, q in zip(t, a):
if(p[0]):
if(q[0]):
if(p[1] != q[1]):
print((0))
exit()
... | def read():
return [int(i) for i in input().split(" ")]
N = int(eval(input()))
T = read()
A = read()
T = [(i != j, i) for i, j in zip(T, [None] + T)]
A = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]
P = 1
for p, q in zip(T, A):
if(p[0]):
if(q[0]):
if(p[1] != q[1]):
print((0))
exit()
... | p03959 |
mod = 10 ** 9 + 7
N = int(eval(input()))
T = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
HT = [False] * N
for i in range(1, N):
if T[i - 1] < T[i]:
HT[i] = True
HT[0] = True
HA = [False] * N
for i in range(N - 1):
if A[i] > A[i + 1]:
HA[i] = True
HA... | mod = 10 ** 9 + 7
N = int(eval(input()))
T = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
HT = [False] * N
for i in range(1, N):
if T[i - 1] < T[i]:
HT[i] = True
HT[0] = True
HA = [False] * N
for i in range(N - 1):
if A[i] > A[i + 1]:
HA[i] = True
HA... | p03959 |
N = int(eval(input()))
T = [int(t) for t in input().split()]
A = [int(a) for a in input().split()]
mod = 7 + 10**9
TS, AS = [None for i in range(N)], [None for j in range(N)] #山の高さが一意に決まるならTrue
TS[0], AS[-1] = True, True
for i in range(1, N):
if T[i] > T[i-1]: TS[i] = True
else: TS[i] = False
if ... | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
T = [int(t) for t in input().split()]
A = [int(a) for a in input().split()]
mod = 7 + 10 ** 9
Ans = 1
H = [-1] * N
H[0] = T[0]
for i in range(1, N):
if T[i] > T[i-1]: H[i] = T[i]
if H[... | p03959 |
n=int(eval(input()))
a=[0]+list(map(int,input().split()))
b=list(map(int,input().split()))+[0]
c=[[0,0]for i in range(n)]
p=0
mod=10**9+7
for i in range(n,0,-1):
if a[i-1]!=a[i]:
c[i-1]=[1,a[i]]
else:
c[i-1]=[0,a[i]]
for i in range(n):
if b[i]!=b[i+1]:
if c[i][0]==1:
... | n=int(eval(input()))
a=[0]+list(map(int,input().split()))
b=list(map(int,input().split()))+[0]
c=[[0,0]for i in range(n)]
p=0
mod=10**9+7
d=1
for i in range(n,0,-1):
if a[i-1]!=a[i]:
c[i-1]=[1,a[i]]
else:
c[i-1]=[0,a[i]]
for i in range(n):
if b[i]!=b[i+1]:
if c[i][0]==1... | p03959 |
p = 10**9+7
N = int(eval(input()))
T = list(map(int,input().split()))
A = list(map(int,input().split()))
H = [0 for _ in range(N)]
cnt = 1
H[0] = T[0]
for i in range(1,N):
if T[i]>T[i-1]:
H[i] = T[i]
if H[-1]>0 and H[-1]!=A[-1]:
cnt = 0
else:
H[-1] = A[-1]
for i in range(-2,-N-1,-1... | p = 10**9+7
N = int(eval(input()))
T = list(map(int,input().split()))
A = list(map(int,input().split()))
H = [0 for _ in range(N)]
flag = 0
if T[N-1]!=A[0]:
flag = 1
hmax = A[0]
if flag==0:
indmaxT=0
H[0] = T[0]
for i in range(1,N):
if T[i]>T[i-1]:
H[i] = T[i]
... | p03959 |
MOD = 1000000007
def union(x,y):
if len(x)==1:
if len(y)==1:
return (1 if x[0]==y[0] else 0)
else:
return (1 if y[-1]>=x[0] else 0)
if len(x)>1:
if len(y)==1:
return (1 if x[-1]>=y[0] else 0)
else:
return min(len(x),len... | import sys
MOD = 1000000007
def union(x,y):
if len(x)==1:
if len(y)==1:
return (1 if x[0]==y[0] else 0)
else:
return (1 if y[-1]>=x[0] else 0)
if len(x)>1:
if len(y)==1:
return (1 if x[-1]>=y[0] else 0)
else:
return ... | p03959 |
import sys
n = int(eval(input()))
t = list(map(int, input().split()))
a = list(map(int, input().split()))
h = [min(t[i],a[i]) for i in range(n)]
fixed = [False] * n
fixed[0] = True; fixed[n-1] = True
if a[n-1] > t[n-1] or t[0] > a[0]:
print((0))
sys.exit(0)
# takahashi check
for i in range(1,n):
... | n = int(eval(input()))
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
yama = [0] * n
# tは、t[i] == t[i + 1]だったら左の以外全部ありうる
yama[0] = t[0]
if t[0] > a[0]:
print((0))
exit()
for i in range(n - 1):
if t[i] < t[i + 1]:
# i + 1の高さ確定
yama... | p03959 |
mod=10**9+7
n=int(eval(input()))
T=[int(i) for i in input().split()]
A=[int(i) for i in input().split()]
Tres=[0]*n
Ares=[0]*n
Tres[0]=[0,T[0]]
Ares[-1]=[0,A[-1]]
for i in range(1,n):
if T[i]!=T[i-1]:
Tres[i]=[0,T[i]]
else:
Tres[i]=[1,T[i]]
if A[-i-1]!=A[-i]:
Ares[-i-1]=[0,A[-i-1]]
el... | mod=10**9+7
n=int(eval(input()))
T=[int(i) for i in input().split()]
A=[int(i) for i in input().split()]
Tres=[0]*n
Ares=[0]*n
Tres[0]=[0,T[0]]
Ares[-1]=[0,A[-1]]
for i in range(1,n):
if T[i]>T[i-1]:
Tres[i]=[0,T[i]]
else:
Tres[i]=[1,T[i]]
if A[-i-1]>A[-i]:
Ares[-i-1]=[0,A[-i-1]]
else... | p03959 |
from collections import defaultdict, deque
import sys
N, M = list(map(int, input().split()))
edges = [list(range(N)) for i in range(N)]
for i in range(N):
edges[i].remove(i)
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a-1].remove(b-1)
edges[b-1].remove(a-1)
size = defaultdi... | from collections import defaultdict, deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
edges = [list(range(N)) for i in range(N)]
for i in range(N):
edges[i].remove(i)
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a-1].remove(b-1)
edges[b-1].r... | p03321 |
from collections import defaultdict, deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
edges = [list(range(N)) for i in range(N)]
for i in range(N):
edges[i].remove(i)
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a-1].remove(b-1)
edges[b-1].r... | from collections import defaultdict, deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
edges = [set(range(N)) for i in range(N)]
for i in range(N):
edges[i].remove(i)
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a-1].remove(b-1)
edges[b-1].re... | p03321 |
from itertools import product
def dfs(links, fixed, s):
q = [(s, 0)]
cnt = [0, 0]
while q:
v, c = q.pop()
if fixed[v] > -1:
if fixed[v] != c:
return False
continue
fixed[v] = c
cnt[c] += 1
for u in links[v]:
... | def dfs(links, fixed, s):
q = [(s, 0)]
cnt = [0, 0]
while q:
v, c = q.pop()
if fixed[v] > -1:
if fixed[v] != c:
return False
continue
fixed[v] = c
cnt[c] += 1
for u in links[v]:
q.append((u, c ^ 1))
... | p03321 |
N, M = list(map(int, input().split()))
E = [[] for _ in range(N+1)]
E_mat = [[0]*(N+1) for _ in range(N+1)]
for _ in range(M):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
E_mat[a][b] = 1
E_mat[b][a] = 1
E_inv = [[] for _ in range(N+1)]
for v, e_mat in enumerate(E_m... | def main():
N, M = list(map(int, input().split()))
E_mat = [[0]*(N+1) for _ in range(N+1)]
for _ in range(M):
a, b = list(map(int, input().split()))
E_mat[a][b] = 1
E_mat[b][a] = 1
E_inv = [[] for _ in range(N+1)]
for v, e_mat in enumerate(E_mat[1:], 1):
for ... | p03321 |
# import math
# n,k = list(map(int,input().split()))
# print(math.ceil((n-1)/(k-1)))
n,m = list(map(int,input().split()))
road = {}
whole = []
for i in range(1,n+1):
whole.append(i)
road[i] = []
whole = set(whole)
for i in range(m):
a,b = list(map(int, input().split()))
road[a].append(b)... | # import math
# n,k = list(map(int,input().split()))
# print(math.ceil((n-1)/(k-1)))
n,m = list(map(int,input().split()))
road = {}
whole = []
for i in range(1,n+1):
whole.append(i)
road[i] = set()
whole = set(whole)
for i in range(m):
a,b = list(map(int, input().split()))
road[a].add(b)... | p03321 |
N,M=list(map(int,input().split()))
edge=[set([]) for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
edge[a-1].add(b-1)
edge[b-1].add(a-1)
cedge=[[] for i in range(N)]
for i in range(N):
for j in range(N):
if j not in edge[i] and j!=i:
cedge[i].append... | N,M=list(map(int,input().split()))
edge=[set([]) for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
edge[a-1].add(b-1)
edge[b-1].add(a-1)
cedge=[[] for i in range(N)]
for i in range(N):
for j in range(N):
if j not in edge[i] and j!=i:
cedge[i].append... | p03321 |
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, ... | p03321 |
def main():
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in [0]*m]
n_hozon = n
g = [set() for _ in [0]*n]
[g[a-1].add(b-1) for a, b in ab]
[g[b-1].add(a-1) for a, b in ab]
s = set([i for i in range(n)])
# 題意：できるだけ辺が少なくなるように2つの完全グラフに分けたい
... | # 問題の趣旨：できるだけ辺が少なくなるように2つの完全グラフに分けたい
# まず、2つの完全グラフに分けられるのかを調べる必要がある。
# これが不可能であれば-1を出力して即座に終了。
# 分けられる場合は、できるだけ街の数を均等にしたい。
# 以下のアルゴリズムを考える。
# まずお互い繋がっていない都市の組A,Bを選ぶ。
# すると、Aにしか繋がっていない街、Bにしか繋がっていない街、
# 両方に繋がっている街の3グループに分かれる。
# 最初の2グループについてはグループのサイズを保存しておく。
# 最後のグループが空でない場合は、このグループに対してまた同様の処理を行う。
# 街がなくなるか、両方... | p03321 |
from collections import deque
n, m = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(m)]
matrix = [[0]*n for i in range(n)]
for i in range(m):
a, b = info[i]
a -= 1
b -= 1
matrix[a][b] = 1
matrix[b][a] = 1
graph = [[] for i in range(n)]
for i... | import sys
input = sys.stdin.readline
def is_bipartite(graph, s):
"""二部グラフ判定する"""
n = len(graph)
col = [-1] * n
col[s] = 0
stack = [s]
used[s] = True
while stack:
v = stack.pop()
for nxt_v in graph[v]:
used[nxt_v] = True
if col[nxt_v] ... | p03321 |
n,m=list(map(int,input().split()))
a=[False]*n
g=[[] for _ in [0]*n]
for _ in range(m):
l,r,d=list(map(int,input().split()))
g[l-1].append((r-1,d))
g[r-1].append((l-1,-d))
for i in range(n):
if not(a[i]):
a[i]=0
q=[i]
while q:
j=q.pop()
for x,e in g[j]:
... | n,m=list(map(int,input().split()))
a=[None]*n
g=[[] for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
g[l-1].append((r-1,d))
g[r-1].append((l-1,-d))
for i in range(n):
if a[i]==None:
a[i]=0
q=[i]
while q:
j=q.pop()
for x,e in g[j]... | p03450 |
class WeightedUnionFind():
def __init__(self,n):
self.n = n
self.parents = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.weight = [0 for _ in range(n)]
def find(self,x):
root = x
stack = [root]
while self.parents[root] != root:
... | class DSUWeighted():
def __init__(self, n):
self.n = n
self.par_size = [-1] * n
self.wt = [0] * n
def leader(self, a):
#assert 0 <= a < self.n
x = a
order = [x]
while self.par_size[x] >= 0:
x = self.par_size[x]
order.ap... | p03450 |
#重み付きUnion-Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
return px
#xの根から距離
def weight(x):
find(x)
return wei[x]
#w[y]=w[x]+wとなるようにxとyを併合
def unite(x,y,w):
w += wei[x]-wei[y... | #重み付きUnion-Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
return px
#xの根から距離
def weight(x):
find(x)
return wei[x]
#w[y]=w[x]+wとなるようにxとyを併合
def unite(x,y,w):
w += wei[x]-wei[y... | p03450 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
lrds = tuple(tuple(map(int, line.split())) for line in sys.stdin.readlines())
g = tuple([] for _ in range(n))
x = [None] * n
for l, r, d in lrds:
l -= 1
... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
lrds = ((list(map(int, line.split()))) for line in sys.stdin.readlines())
g = tuple([] for _ in range(n))
x = [None] * n
for l, r, d in lrds:
l -= 1
... | p03450 |
from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
graph[r].append((l, i, -d))
graph[l].append((r, i, d))
check_v = [False for _ in range(n)]
check_e = [False for... | from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
graph[r].append((l, r, -d))
graph[l].append((r, l, d))
max_int = 10 ** 10
point = [None for _ in range(n)]
f... | p03450 |
def topo_sort(g):
from collections import deque
V = len(g)
deg = [0]*V
for src in range(V):
for dst in g[src]:
deg[dst] += 1
ans = list(v for v in range(V) if deg[v]==0)
deq = deque(ans)
used = [0]*V
while deq:
v = deq.popleft()
for t in ... | def resolve():
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
adj_list = [[] for _ in range(N)]
for lrd in LRD:
l, r, d = lrd
adj_list[l-1].append((l-1, r-1, d))
adj_list[r-1].append((r-1, l-1, -d))
X = [None]*N
... | p03450 |
import collections
def main():
N, M = list(map(int, input().split()))
graph = collections.defaultdict(dict)
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L][R] = D
graph[R][L] = -D
visited = set()
for i in range(1, N+1):
if i not in vi... | import collections
def main():
N, M = list(map(int, input().split()))
graph = collections.defaultdict(dict)
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L][R] = D
graph[R][L] = -D
visited = set()
used = set()
for i in range(1, N+1):
... | p03450 |
from collections import deque
def sol():
n,m=list(map(int,input().split()))
t,w={},{}
p,q=set(),set()
for i in range(m):
l,r,d=[int(i) for i in input().split()]
t[(l,r)]=d
if l in w:
w[l].add((r,d))
else:
w[l]={(r,d)}
p.add(l)
... | def sol():
n,m=list(map(int,input().split()))
t,w={},{}
p,q=set(),set()
for i in range(m):
l,r,d=[int(i) for i in input().split()]
if l in w: w[l].add((r,d))
else: w[l]={(r,d)}
p.add(l)
q.add(r)
s=p-q
chk=set()
if len(s)==0:
print(... | p03450 |
N, M = list(map(int, input().split()))
LRDi = []
for _ in range(M):
a = list(map(int, input().split()))
LRDi.append(a)
tree = [None] * (N + 1)
def parent(n):
if tree[n] is None:
return [n, 0]
d = distance_to_root(n)
p = parent(tree[n][0])
tree[n][0] = p[0]
tree[n][1... | N, M = list(map(int, input().split()))
LRDi = []
for _ in range(M):
a = list(map(int, input().split()))
LRDi.append(a)
tree = [None] * (N + 1)
def parent(n):
if tree[n] is None:
return [n, 0]
p = parent(tree[n][0])
if p[0] == tree[n][0]:
return tree[n]
d = dista... | p03450 |
#!/usr/bin/env python3
def main():
na = list(map(int, input().split()))
N = na[0]
M = na[1]
lrd_list = []
for i in range(M):
na = list(map(int, input().split()))
lrd_list.append((na[0], na[1], na[2]))
tpl_list = []
for lrd in lrd_list:
l = lrd[0]
... | #!/usr/bin/env python3
def main():
na = list(map(int, input().split()))
N = na[0]
M = na[1]
lrd_list = []
for i in range(M):
na = list(map(int, input().split()))
lrd_list.append((na[0], na[1], na[2]))
l_list = [None for i in range(N+1)]
r_list = [None for i in r... | p03450 |
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])
N, M = list(map(int, input().split()))
G = [[float('inf')] * N for _ i... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
has_parent = [False] * N
LRD = [None] * M
for i in range(M):
L, R, D = list(map(int, input().split()))
L -= 1
R -= 1
G[L].append((R, D))
G[R].append((L, ... | p03450 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
has_parent = [False] * N
LRD = [None] * M
for i in range(M):
L, R, D = list(map(int, input().split()))
L -= 1
R -= 1
G[L].append((R, D))
G[R].append((L, ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
has_parent = [False] * N
for i in range(M):
L, R, D = list(map(int, input().split()))
L -= 1
R -= 1
G[L].append((R, D))
has_parent[R] = True
def dfs(... | p03450 |
def main():
N, M = list(map(int,input().split()))
INF = 10**9+7
if M == 0:
print("Yes")
return
x = [[INF for _ in range(N)] for _ in range(N)]
for i in range(M):
l, r, d = list(map(int, input().split()))
l, r = l-1, r-1
x[l][r] = d
x[r][l] = -d
ans_exist = True
for k in range(N):
for ... | def main():
N, M = list(map(int,input().split()))
if M == 0:
print("Yes")
return
x = [[] for _ in range(N)]
ans = [0 for _ in range(N)]
for i in range(M):
l, r, d = list(map(int, input().split()))
l, r = l-1, r-1
x[l].append([r, d])
x[r].append([l, -d])
visited = [False for _ in range(N)... | p03450 |
N,M = list(map(int,input().split()))
Dlist = [[0 for i in range(N+1)] for j in range(N+1)]
L2Rdic = {i:[] for i in range(N+1)}
R2Ldic = {i:[] for i in range(N+1)}
flag=True
for _ in range(M):
L,R,D=list(map(int,input().split()))
if Dlist[L][R]==0:
Dlist[L][R]=D
L2Rdic[L].appen... | N,M = list(map(int,input().split()))
L2R = {i:[] for i in range(N+1)}
R2L = {i:[] for i in range(N+1)}
for _ in range(M):
L,R,D=list(map(int,input().split()))
L2R[L].append((R,D,L))
R2L[R].append((L,-D,R))
x = [0 for i in range(N+1)]
f = [True for i in range(N+1)]
for i in range(1,N+1):
... | p03450 |
# ABC087D
# https://atcoder.jp/contests/abc087/tasks/arc090_b
def Find(x, par, diff_weight):
if par[x] < 0:
return x
else:
px = Find(par[x], par, diff_weight)
diff_weight[x] += diff_weight[par[x]]
par[x] = px
return px
def Unite(x, y, par, rank, diff_weight,... | def Find(x, par, diff_weight):
if par[x] < 0:
return x
else:
px = Find(par[x], par, diff_weight)
diff_weight[x] += diff_weight[par[x]]
par[x] = px
return px
def Unite(x, y, par, rank, diff_weight, w):
w += diff_weight[x] - diff_weight[y]
x = Find(x, pa... | p03450 |
import sys
from collections import deque
sys.setrecursionlimit(10**7)
n, m = [int(i) for i in sys.stdin.readline().split()]
parent = [i for i in range(n)]
graph = {j:[] for j in range(n)}
for i in range(m):
l, r, d = [int(i) for i in sys.stdin.readline().split()]
l -= 1
r -= 1
graph[l].app... | import sys
sys.setrecursionlimit(10**7)
n, m = [int(i) for i in sys.stdin.readline().split()]
parent = [i for i in range(n)]
graph = {j:[] for j in range(n)}
for i in range(m):
l, r, d = [int(i) for i in sys.stdin.readline().split()]
l -= 1
r -= 1
graph[l].append((r, d))
graph[r].appen... | p03450 |
import sys
from itertools import accumulate as acc
sys.setrecursionlimit(10**6)
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつけ... |
import sys
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0]*(n+1)
self.poten... | p03450 |
import sys
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0]*(n+1)
self.potenti... | import sys
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0]*(n+1)
self.potenti... | p03450 |
import collections, sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
graph = [[] for i in range(n + 1)]
for i in range(m):
l, r, d = list(map(int, input().split()))
graph[l].append([r, d])
graph[r].append([l, -d])
flags = [False for i in range(n + 1)]
place = [0 for i in rang... | import collections, sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
graph = [[] for i in range(n + 1)]
for i in range(m):
l, r, d = list(map(int, input().split()))
graph[l].append([r, d])
graph[r].append([l, -d])
place = [None for i in range(n + 1)]
num = 0
flag = True
w... | p03450 |
# 解説みたよ
import sys
sys.setrecursionlimit(10000000)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
es = [[] for i in range(n)]
l, r, d = [0] * m, [0] * m, [0] * m
for i in range(m):
l[i], r[i], d[i] = list(map(int, input().split()))
l[i] -= 1
r[i] -= 1
es[l[i]].append((r[i],... | # 解説みたよ
import sys
sys.setrecursionlimit(10000000)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
es = [[] for i in range(n)]
l, r, d = [0] * m, [0] * m, [0] * m
for i in range(m):
l[i], r[i], d[i] = list(map(int, input().split()))
l[i] -= 1
r[i] -= 1
es[l[i]].append((r[i],... | p03450 |
n,m=list(map(int,input().split()))
ans=[10**10]*n
edge=[[]for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
l-=1
r-=1
edge[l].append([r,d])
edge[r].append([l,-d])
for i in range(n):
if ans[i]==10**10:
ans[i]=0
Q=[i]
while Q:
P=[]
for i in Q:
for j,d in edge... | n,m=list(map(int,input().split()))
ans=[10**10]*n
edge=[[]for _ in range(n)]
for _ in range(m):
l,r,d=list(map(int,input().split()))
l-=1;r-=1
edge[l].append((r,d))
edge[r].append((l,-d))
for i in range(n):
if ans[i]==10**10:
ans[i]=0
Q=[i]
while Q:
P=[]
for j in Q:
... | p03450 |
class WeightsUnionfind:
def __init__(self,n):
self.Tree=[i for i in range(n)]
self.dWeights=[0]*n
self.wrong=0
def find(self,x):
if x==self.Tree[x]:
return x
else:
root=self.find(self.Tree[x])
self.dWeights[x]=self.weigh(x)
self.Tree[x]=root
return roo... | class WeightsUnionfind:
def __init__(self,n):
self.Tree=[i for i in range(n)]
self.dWeights=[0]*n
self.rank=[0]*n
self.wrong=0
def find(self,x):
if x==self.Tree[x]:
return x
else:
root=self.find(self.Tree[x])
self.dWeights[x]=self.weigh(x)
self.Tree[x]=r... | p03450 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
def dfs(u, cost):
visited[u] = True
for v, w in edge[u]:
if costs.get(v) and costs[v] != cost + w:
print("No")
sys.exi... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
from collections import defaultdict, deque
n, m = list(map(int, readline().split()))
edge = defaultdict(list)
for _ in range(m):
l, r, d = list(map(int, read... | p03450 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L].append((R, D))
graph[R].append((L, -D))
d = ['a'] * (N + 1)
def calc(start): #startからの連結成分をチェックする
d[star... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L].append((R, D))
graph[R].append((L, -D))
d = [None] * (N + 1)
def calc(start): #startからの連結成分をチェックする
d[sta... | p03450 |
from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
G[l].append((r, -d))
G[r].append((l, d))
MIN = -10 ** 18
lst = [MIN] * (N + 1)
que =... | from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
G[l].append((r, -d))
G[r].append((l, d))
MIN = -10 ** 18
lst = [MIN] * (N + 1)
que =... | p03450 |
from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
G[l].append((r, -d))
G[r].append((l, d))
MIN = -10 ** 18
lst = [MIN] * (N + 1)
que =... | def main():
from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(M):
l, r, d = list(map(int, input().split()))
G[l].append((r, -d))
G[r].append((l, d))
... | p03450 |
from collections import deque
N, M = map(int, input().split())
L = []
R = []
D = []
for i in range(M):
l, r, d = map(int, input().split())
L.append(l)
R.append(r)
D.append(d)
inf = float("inf")
class WDG(): # 重み付き有向グラフ(隣接リスト表現)
class node():
def __init__(self, index=0, we... | from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for i in range(M):
l, r, d = list(map(int, input().split()))
G[l - 1].append((r - 1, d))
G[r - 1].append((l - 1, -d))
q = deque()
x = [None] * N
def _BFS(start):
q.append(start)
while len... | p03450 |
from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, input().split()))
graph[l-1].append((r-1, d))
graph[r-1].append((l-1, -d))
for i in range(n):
x = [-1 for i in range(n)]
if x[i] == -1:
x... | n, m = list(map(int, input().split()))
par = [i for i in range(n)]
rank = [0 for i in range(n)]
diff_weight = [0 for i in range(n)]
def root(x):
if par[x] == x:
return x
r = root(par[x])
diff_weight[x] += diff_weight[par[x]]
par[x] = r
return par[x]
def issame(x, y):
... | p03450 |
from bisect import bisect_left
from copy import deepcopy
from operator import itemgetter
n, m = (int(x) for x in input().split())
LRD = [tuple(int(x) for x in input().split()) for _ in range(m)]
LRD.sort(key=itemgetter(0, 1))
INF = 10**18
while LRD:
X = [INF] * n
TBD = [] # To be determined
X... | n, m = (int(x) for x in input().split())
LRD = [tuple(int(x) for x in input().split()) for _ in range(m)]
G = [[] for _ in range(n)]
dist = dict()
for l, r, d in LRD:
l -= 1
r -= 1
G[l].append(r)
G[r].append(l)
dist[(l, r)] = d
dist[(r, l)] = -d
INF = 10**18
X = [INF] * n
for i ... | p03450 |
#重み付きUnion-Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
return px
#xの根から距離
def weight(x):
find(x)
return wei[x]
#w[y]=w[x]+wとなるようにxとyを併合
def unite(x,y,w):
w += wei[x]-wei[y... | def main():
import sys
input = sys.stdin.readline
#重み付きUnion-Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
px = find(par[x])
wei[x] += wei[par[x]]
par[x] = px
return px
#xの根から距離
def weigh... | p03450 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | p03450 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | p03450 |
from collections import deque
N, M = list(map(int, input().split()))
L = []
R = []
D = []
G = [[] for _ in range(N+1)]
for _ in range(M):
tmpl, tmpr, tmpd = list(map(int, input().split()))
# if tmpl > tmpr:
# tmpl, tmpr = tmpr, tmpl
# tmpd *= -1
L.append(tmpl)
R.append(tmpr)
... | from collections import deque
N, M = list(map(int, input().split()))
#L = []
#R = []
#D = []
G = [[] for _ in range(N+1)]
for _ in range(M):
tmpl, tmpr, tmpd = list(map(int, input().split()))
# L.append(tmpl)
# R.append(tmpr)
# D.append(tmpd)
G[tmpl].append((tmpr, tmpd))
G[tmpr].appe... | p03450 |
from collections import deque
N, M = list(map(int, input().split()))
#L = []
#R = []
#D = []
G = [[] for _ in range(N+1)]
for _ in range(M):
tmpl, tmpr, tmpd = list(map(int, input().split()))
# L.append(tmpl)
# R.append(tmpr)
# D.append(tmpd)
G[tmpl].append((tmpr, tmpd))
G[tmpr].appe... | from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N+1)]
for _ in range(M):
tmpl, tmpr, tmpd = list(map(int, input().split()))
G[tmpl].append((tmpr, tmpd))
G[tmpr].append((tmpl, -tmpd))
field = [None] * (N+1)
def dfs(i):
q = deque()
q.append(i... | p03450 |
def main():
import sys
input = sys.stdin.buffer.readline
N, M = (int(i) for i in input().split())
par = [i for i in range(N)]
rank = [1]*N
weight = [0]*N
def find_root(x):
if par[x] == x:
return x
else:
r = find_root(par[x])
... | class WeightedUnionFind:
""" あっとさんありがとうございます """
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# 根への距離を管理
self.weight = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
... | p03450 |
N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
roots = [(i,0) for i in range(N+1)] #(root, distance_to_root)
def find_root(a, roots=roots):
if roots[a][0] == a:
return (a,0)
else:
r, d = find_root(roots[a][0])
roots[a] = (r, roots[a][1] + d)
... | N, M = list(map(int, input().split()))
LRD = [list(map(int, input().split())) for _ in range(M)]
roots = [(i,0) for i in range(N+1)] #(root, distance_from_i_to_root)
def find_root(a, roots=roots):
if roots[a][0] == a:
return (a,0)
else:
r, d = find_root(roots[a][0])
roots[a] = (r, roots[a][1... | p03450 |
from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for _ in range(m):
l, r, d = list(map(int, input().split()))
graph[l-1].append((r-1, d))
graph[r-1].append((l-1, -d))
seen = [False]*n
dist = [None]*n
for i in range(n):
if seen[i]:
con... | from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for _ in range(m):
l, r, d = list(map(int, input().split()))
graph[l-1].append((r-1, d))
graph[r-1].append((l-1, -d))
seen = [False]*n
dist = [None]*n
for i in range(n):
if seen[i]:
con... | p03450 |
import heapq
INF = float('inf')
class UnionFind:
def __init__(self, size: int):
self.__size = size
self.__root = [-1] * size
def find(self, u: int)->int:
if self.__root[u] < 0:
return u
self.__root[u] = self.find(self.__root[u])
return self._... | class WeightenedUnionFind:
def __init__(self, size: int):
self.__size = size
self.__root = [-1] * size
self.__diff_weight = [0] * size
def find(self, u: int)->int:
if self.__root[u] < 0:
return u
r = self.find(self.__root[u])
self.__diff_wei... | p03450 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | p03450 |
# Union Find 木
from sys import setrecursionlimit
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(parent, dif... | # Union Find 木
from sys import setrecursionlimit, stdin
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(pare... | p03450 |
# Union Find 木
from sys import setrecursionlimit, stdin
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(pare... | # 深さ優先探索
from sys import stdin
N, M = list(map(int, stdin.readline().split()))
links = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, stdin.readline().split()))
links[L].append((R, D))
links[R].append((L, -D))
t = [None] * (N + 1)
for i in range(1, N + 1):
if t[i] ... | p03450 |
def main():
from collections import deque
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
e = [[] for i in range(n)]
for i in range(m):
a,b,c = list(map(int,input().split()))
a -= 1
b -= 1
e[a].append([b,c])
e[b]... | def main():
from collections import deque
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
e = [[] for i in range(n)]
for i in range(m):
a,b,c = list(map(int,input().split()))
a -= 1
b -= 1
e[a].append([b,c])
e[b]... | p03450 |
from collections import defaultdict
import sys
input = sys.stdin.readline
inf = float('INF')
n, m = list(map(int, input().split()))
if m == 0:
print('Yes')
exit()
edges = defaultdict(list)
for i in range(m):
left, right, dist = list(map(int, input().split()))
edges[left-1].append([right-1... | from collections import defaultdict
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
if m == 0:
print('Yes')
exit()
edges = defaultdict(list)
for i in range(m):
left, right, dist = list(map(int, input().split()))
edges[left-1].append((right-1, dist))
edge... | p03450 |
import sys
sys.setrecursionlimit(10000)
INF = float('inf')
class WeightedUnionFind:
def __init__(self, nodes):
"""
:param collections.Iterable nodes:
"""
self._parents = {k: k for k in nodes}
self._ranks = {k: 0 for k in nodes}
self._sizes = {k: 1 for ... | import sys
import time
sys.setrecursionlimit(10000)
INF = float('inf')
class WeightedUnionFind:
def __init__(self, nodes):
"""
:param collections.Iterable nodes:
"""
self._parents = {k: k for k in nodes}
self._ranks = {k: 0 for k in nodes}
self._sizes... | p03450 |
import sys
import time
sys.setrecursionlimit(10000)
INF = float('inf')
class WeightedUnionFind:
def __init__(self, nodes):
"""
:param collections.Iterable nodes:
"""
self._parents = {k: k for k in nodes}
self._ranks = {k: 0 for k in nodes}
self._sizes... | import sys
sys.setrecursionlimit(10000)
INF = float('inf')
class WeightedUnionFind:
def __init__(self, size):
"""
:param collections.Iterable nodes:
"""
self._parents = [i for i in range(size)]
self._ranks = [0 for _ in range(size)]
self._sizes = [1 fo... | p03450 |
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
indeg = [0] * n
for _ in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
G[r].append((l, d))
indeg[r] += 1
from collections import deque
ng = False
visited = [0] * n
for start, deg in enumerate(indeg)... | n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
indeg = [0] * n
for _ in range(m):
l, r, d = list(map(int, input().split()))
l -= 1
r -= 1
G[l].append((r, d))
G[r].append((l, -d))
from collections import deque
ng = False
visited = [0] * n
visited_cost = [0] * n
f... | p03450 |
N,M = list(map(int,input().split()))
LRD = [(lambda x: [int(x[0])-1,int(x[1])-1,int(x[2])])(input().split()) for _ in [0]*M]
connect = [[] for _ in range(N)]
for L,R,D in LRD:
connect[L].append([R,D])
connect[R].append([L,-D])
ans = True
n = [None] * N
q = []
n0 = 0
while ans:
n[n0] = 0
... | N,M = list(map(int,input().split()))
LRD = [(lambda x: [int(x[0])-1,int(x[1])-1,int(x[2])])(input().split()) for _ in [0]*M]
connect = [[] for _ in range(N)]
for L,R,D in LRD:
connect[L].append([R,D])
connect[R].append([L,-D])
ans = True
n = [None] * N
n0 = 0
while ans:
q = [n0]
n[n0] = 0... | p03450 |
N,M = list(map(int,input().split()))
LRD = [list(map(int,input().split())) for _ in [0]*M]
E = [{} for _ in [0]*N]
for L,R,D in LRD:
E[L-1][R-1] = D
E[R-1][L-1] = -D
V = [-1]*N
breakFlg = False
for i in range(N):
if V[i]!=-1:continue
V[0] = 0
q = [i]
while q:
j = q.pop()... | N,M = list(map(int,input().split()))
LRD = [list(map(int,input().split())) for _ in [0]*M]
E = [{} for _ in [0]*N]
for L,R,D in LRD:
E[L-1][R-1] = D
E[R-1][L-1] = -D
V = [None]*N
breakFlg = False
for i in range(N):
if V[i]!=None:continue
V[i] = 0
q = [i]
while q:
j = q.p... | p03450 |
class UnionFind:
def __init__(self, size):
self.parent = list(range(size))
self.height = [0] * size
self.size = [1] * size
self.component = size
def root(self, index):
if self.parent[index] == index: # 根の場合
return index
rootIndex = self.roo... | class UnionFind:
def __init__(self, size):
self.parent = list(range(size))
self.height = [0] * size
self.size = [1] * size
self.component = size
def root(self, index):
if self.parent[index] == index: # 根の場合
return index
rootIndex = self.roo... | p03450 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.