input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, m = map(int, input().split())
s = input()
s = s[::-1]
if s[0] == "1":
print(-1)
exit()
pre = [-1] * (n + 1)
stack = [0]
while stack:
now = stack.pop()
if now == n:
break
for i in range(1, m + 1):
tsugi = now + i
if tsugi > n:
continue
if... | n, m = map(int, input().split())
s = input()
out_s='1'*(m)
if out_s in s:
print(-1)
exit()
s = s[::-1]
if s[0] == "1":
print(-1)
exit()
pre = [-1] * (n + 1)
stack = [0]
while stack:
now = stack.pop()
if now == n:
break
for i in range(1, m + 1):
tsugi = now + ... | p02852 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
print((S+'es' if S[-1] == 's' else S+'s'))
| p02546 |
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip(... | import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionli... | p02546 |
temp = list(input().split())
print(((temp[0][0]+temp[1][0]+temp[2][0]).upper())) | a, b, c = input().split()
print(((a[0]+b[0]+c[0]).upper())) | p03737 |
s = list(input().split())
print(((s[0][0] + s[1][0] + s[2][0]).upper())) | s = list(input().split())
#print((s[0][0] + s[1][0] + s[2][0]).upper())
print((''.join([x[0].upper() for x in s])))
| p03737 |
a,b,c=input().split()
print((a[0].upper()+b[0].upper()+c[0].upper())) | a,b,c=input().split()
print(((a[0]+b[0]+c[0]).upper())) | p03737 |
a,b,c = input().split()
ans = a[0]+b[0]+c[0]
print((ans.upper())) | a,b,c = input().split()
print(((a[0] + b[0] + c[0]).upper()))
| p03737 |
s1,s2,s3=list(map(str,input().upper().split())) #文字列
print((s1[0]+s2[0]+s3[0])) | s1,s2,s3=input().upper().split() #文字列
print((s1[0]+s2[0]+s3[0])) | p03737 |
s1,s2,s3 = input().split()
print(((s1[0]+s2[0]+s3[0]).upper())) | a,b,c=input().upper().split();print((a[0]+b[0]+c[0])) | p03737 |
s1,s2,s3 = list(map(str,input().split()))
s = s1[0] + s2[0] + s3[0]
s = s.upper()
print(s) | a,b,c = input().split()
print(((a[0]+b[0]+c[0]).upper())) | p03737 |
s1,s2,s3 = input().strip().split()
print((s1[0].upper()+s2[0].upper()+s3[0].upper())) | s1,s2,s3 = input().split()
s1 = s1.upper()
s2 = s2.upper()
s3 = s3.upper()
print((s1[0]+s2[0]+s3[0])) | p03737 |
a,b,c=input().upper().split();print((''.join([a[0],b[0],c[0]]))) | a,*_=zip(*input().upper().split());print(*a,sep='')
| p03737 |
a,b,c = list(map(str,input().split()))
A = list(a)[0].upper()
B = list(b)[0].upper()
C = list(c)[0].upper()
print((A+B+C))
| s = input().split()
for i in range(3):
print(s[i][0].upper(), end = "")
print()
| p03737 |
s = input().split()
print(''.join([w[0] for w in s]).upper())
| print(''.join([w[0] for w in input().split()]).upper()) | p03737 |
def main():
S_1 , S_2 , S_3 = list(map(str, input().split(' ')))
print((S_1[0].upper() + S_2[0].upper() + S_3[0].upper()))
if __name__ == '__main__':
main()
|
if __name__ == "__main__":
S = input().split()
print(((S[0][0] + S[1][0] + S[2][0]).upper()))
| p03737 |
import bisect
INF = 10 ** 10
N = int(input())
As = list(map(int, input().split()))
edges = [tuple(map(int, input().split())) for _ in range(N-1)]
dfs_stack = [1]
ans = [-1] * N
lis = [INF] * (N+1)
rewinder = []
while dfs_stack:
pos = dfs_stack.pop()
for u, v in edges:
if u == pos:
... | from bisect import bisect_left
INF = 10 ** 9
N = int(input())
As = list(map(int, input().split()))
adj = [[] for _ in range(N)]
for _ in range(N-1):
u, v = map(int, input().split())
adj[u-1].append(v-1)
adj[v-1].append(u-1)
ans = [0] * N
LIS = [INF] * (N+1)
rewinder = []
parent = [-1] ... | p02698 |
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import combinations
def run():
N = int(eval(input()))
A = [0] + list(map(int, sy... | # coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import combinations
def run():
N = int(eval(input()))
A = [0] + list(map(int, sy... | p02698 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
import math
import bisect
def solve(seq):
dp = [math.inf] * (len(seq) + 1)
dp[0] = -1 * math.inf
for value in seq:
key = bisect.bis... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
import math
import bisect
class Tree:
"""
node id starts from 1
"""
DUMMY = 0 # used as dummy_node_id and dummy_node_value
def... | p02698 |
n=int(eval(input()))
l=[0]+list(map(int,input().split()))
edge=[[] for i in range(n+1)]
for i in range(n-1):
a,b=list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
s=1
ans=[0 for i in range(n+1)]
from bisect import bisect_left, bisect_right
INF=float('inf')
import sys
sys.set... | n=int(eval(input()))
l=[0]+list(map(int,input().split()))
edge=[[] for i in range(n+1)]
for i in range(n-1):
a,b=list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
s=1
ans=[0 for i in range(n+1)]
from bisect import bisect_left, bisect_right
INF=float('inf')
import sys
sys.set... | p02698 |
class Tree():
def __init__(self, n, edge):
self.n = n
self.tree = [[] for _ in range(n)]
for e in edge:
self.tree[e[0] - 1].append(e[1] - 1)
self.tree[e[1] - 1].append(e[0] - 1)
def setroot(self, root):
self.root = root
self.parent = [No... | class Tree():
def __init__(self, n, edge):
self.n = n
self.tree = [[] for _ in range(n)]
for e in edge:
self.tree[e[0] - 1].append(e[1] - 1)
self.tree[e[1] - 1].append(e[0] - 1)
def setroot(self, root):
self.root = root
self.parent = [No... | p02698 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
from bisect import bisect_left
n = int(readline())
a = list(map(int,readline().split()))
g = [[] * n for i in range(n)]
for i in range(n-1):
u, v = map(int, r... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
from bisect import bisect_left
n = int(readline())
A = list(map(int,readline().split()))
g = [[] * n for i in range(n)]
for i in range(n-1):
u, v = map(int, r... | p02698 |
import sys
from collections import deque
from bisect import bisect_left as bisect
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
def main():
N = int(eval(input()))
A = inpl()
edges = [[] for _ in range(N + 1)]
for _ i... | import sys
from bisect import bisect_left as bisect
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
class solve:
def __init__(self, N):
self.ans = [0] * N
self.DP = []
def recur(self, i, pi=-1):
# DPテ... | p02698 |
import sys
import bisect
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
UV = [[int(x) for x in input().split()] for _ in range(N - 1)]
T = [[] for j in range(N + 1)]
for u, v ... | import sys
import bisect
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
UV = [[int(x) for x in input().split()] for _ in range(N - 1)]
T = [[] for j in range(N + 1)]
for u, v ... | p02698 |
import sys
import bisect
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
UV = [[int(x) for x in input().split()] for _ in range(N - 1)]
T = [[] for j in range(N + 1)]
for u, v ... | import sys
import bisect
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
UV = [[int(x) for x in input().split()] for _ in range(N - 1)]
T = [[] for j in range(N + 1)]
for u, v ... | p02698 |
import sys
import bisect
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
UV = [[int(x) for x in input().split()] for _ in range(N - 1)]
T = [[] for j in range(N + 1)]
for u, v ... | import sys
import bisect
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
UV = [[int(x) for x in input().split()] for _ in range(N - 1)]
T = [[] for j in range(N + 1)]
for u, v ... | p02698 |
import sys
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
repn = [[] for _ in range(N)]
for _ in range(N - 1):
u, v = list(map(int, inpu... | import sys
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(2*10**5)
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
repn = [[] for _ in range(N)]
for _ in range(N - 1):
u, v = list(map(int, in... | p02698 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
a = na()
g = []
for i in range(n):
g.append([])
for i in range(n-1):
x, y = na()
g[x-1].append(y-1)
g[y-1... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
a = na()
g = []
for i in range(n):
g.append([])
for i in range(n-1):
x, y = na()
g[x-1].append(y-1)
g[y-1... | p02698 |
from collections import deque
import sys
import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
n = int(eval(input()))
a = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n-1):
u, v = list(map(int, input().split()))
edges[u-1].append(v-1)
edges[v-1].... | from collections import deque
import sys
import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
n = int(eval(input()))
a = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n-1):
u, v = list(map(int, input().split()))
edges[u-1].append(v-1)
edges[v-1].... | p02698 |
from bisect import bisect_left
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N-1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
G[u].append(v)
G[v].append(u... | from bisect import bisect_left
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N-1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
G[u].append(v)
G[v].append(u... | p02698 |
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | p02698 |
from bisect import bisect_left
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
adj = [set() for _ in range(N)]
for i in range(N-1):
u, v = list(map(int, input().split()))
adj[u-1].add(v-1)
adj[v-1].add(u-1)
ans = [0] * N
q = [(0, -1, [... | from bisect import bisect_left
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
adj = [set() for _ in range(N)]
for i in range(N-1):
u, v = list(map(int, input().split()))
adj[u-1].add(v-1)
adj[v-1].add(u-1)
ans = [0] * N
q = [(0, -1, [... | p02698 |
import bisect
import sys
sys.setrecursionlimit(10**7)
def dfs(v,l,tr):
ans[v]=l
for u in g[v]:
if checked[u]==0:
checked[u]=1
pos=bisect.bisect_left(tr,arr[u])
if pos==l:
dfs(u,l+1,tr+[arr[u]])
elif tr[pos]==arr[u]:
dfs(u,l,tr)
else:
dfs(u,l,... | import bisect
import sys
sys.setrecursionlimit(10**7)
def dfs(v):
pos=bisect.bisect_left(dp,arr[v])
changes.append((pos,dp[pos]))
dp[pos]=arr[v]
ans[v]=bisect.bisect_left(dp,10**18)
for u in g[v]:
if checked[u]==0:
checked[u]=1
dfs(u)
pos,val=changes.pop()
dp[pos]=val
n=i... | p02698 |
import queue
n = int(eval(input()))
a = list(map(int,input().split()))
way = [[] for i in range(n)]
for i in range(n-1):
u,v = list(map(int,input().split()))
u,v = u-1,v-1
way[u].append(v)
way[v].append(u)
stst = [[] for i in range(n)]
stst[0] = [a[0]]
q = queue.Queue()
for i in way[0]:
... | import queue
inf = 10**18
n = int(eval(input()))
a = list(map(int,input().split()))
way = [[] for i in range(n)]
for i in range(n-1):
u,v = list(map(int,input().split()))
u,v = u-1,v-1
way[u].append(v)
way[v].append(u)
def Mnsr(ni,mns):
mnsi = mns + [inf]
l = 0
r = len(mns)
... | p02698 |
import sys
sys.setrecursionlimit(10**9)
from collections import defaultdict,deque
import bisect
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int,input().split()))
g = defaultdict(list)
for i in range(N-1):
u, v = list(map(int,input().split()))
g[u].append(v)
g[v].append(u)
... | import sys
sys.setrecursionlimit(10**9)
from collections import defaultdict,deque
import bisect
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int,input().split()))
g = defaultdict(list)
for i in range(N-1):
u, v = list(map(int,input().split()))
g[u].append(v)
g[v].append(u)
... | p02698 |
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
... | # 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x):
return int(x) - 1
def read_ints(mina=False):
if mina:
return list(map(mina1, read().split()))
else:
return list(map(int,... | p02698 |
# 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x):
return int(x) - 1
def read_ints(mina=False):
if mina:
return list(map(mina1, read().split()))
else:
return list(map(int,... | # 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x):
return int(x) - 1
def read_ints(mina=False):
if mina:
return list(map(mina1, read().split()))
else:
return list(map(int,... | p02698 |
# 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x):
return int(x) - 1
def read_ints(mina=None):
ret = map(int, read().split())
if mina == None:
return list(ret)
else:
... | # 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x):
return int(x) - 1
def read_ints(mina=None):
ret = map(int, read().split())
if mina == None:
return list(ret)
else:
... | p02698 |
# 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x):
return int(x) - 1
def read_ints(mina=None):
ret = map(int, read().split())
if mina == None:
return list(ret)
else:
... | # 木によってLISを作り、dfsで抜けるときにLISをその前の状態まで復元する
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina1(x): return int(x) - 1
def read_ints(tozero=False):
if tozero == False:
return list(map(int, read().split()))
else:
return list(ma... | p02698 |
#!/usr/bin/env python3
#F
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
... | #!/usr/bin/env python3
#F
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
... | p02698 |
import sys
sys.setrecursionlimit(10 ** 9)
from bisect import bisect_left
N = int(input())
A = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].append(v)
G[v].append(u)
root = 0
stack = [root]
... | def main():
import sys
input = sys.stdin.readline
from bisect import bisect_left
N = int(input())
A = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].appen... | p02698 |
# -*- 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_repla... | # -*- coding: utf-8 -*-
import bisect
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.buffer.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n()... | p02698 |
def main():
import sys
input = sys.stdin.readline
import bisect
from collections import deque
from copy import deepcopy
n = int(eval(input()))
l = list(map(int,input().split()))
e = [[] for i in range(n)]
for i in range(n-1):
a,b = list(map(int,input().split()))
... |
import sys
input = sys.stdin.readline
import bisect
sys.setrecursionlimit(10**7)
n = int(eval(input()))
l = list(map(int,input().split()))
e = [[] for i in range(n)]
for i in range(n-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
e[a].append(b)
e[b].append(a)
ans = [0]*n... | p02698 |
import bisect
import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n-1):
from_, to = list(map(int, input().split()))
edges[from_-1].append(to-1)
edges[to-1].append(from_-1)
DP = [10**9+7] * (n+1)
... | import bisect
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(n-1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9+7] * (n+1)
limit = 10**9 + 1
DP[0] = 0
olds = [None] * (... | p02698 |
import bisect
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(n-1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9+7] * (n+1)
limit = 10**9 + 1
DP[0] = 0
olds = [None] * (... | import bisect
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(n-1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9+7] * (n+1)
limit =... | p02698 |
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.st... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.st... | p02698 |
#!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = list(map(int, input().split()))
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].append... | #!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = list(map(int, input().split()))
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].append... | p02698 |
#!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = list(map(int, input().split()))
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].append... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
from bisect import bisect_left
N = int(eval(input()))
a = [int(i) for i in input().split()]
vec = [[] for _ in range(N)]
for _ in range(N - 1) :
u, v = list(map(int, input().split()))
vec[u - 1].append(v - 1)
vec[v - 1].append(u - 1... | p02698 |
#!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = [int(i) for i in input().split()]
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].appe... | #!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = [int(i) for i in input().split()]
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].appe... | p02698 |
#!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = [int(i) for i in input().split()]
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].appe... | #!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = [int(i) for i in input().split()]
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].appe... | p02698 |
#!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = [int(i) for i in input().split()]
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].appe... | #!/usr/bin/python3
import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
n = int(eval(input()))
a = [int(i) for i in input().split()]
nbs = [ [] for _ in range(n) ]
for _ in range(n - 1):
(u, v) = list(map(int, input().split()))
nbs[u - 1].append(v - 1)
nbs[v - 1].appe... | p02698 |
from bisect import bisect_left
import sys
sys.setrecursionlimit(10 ** 7)
N = int(input())
A = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(N - 1):
fr, to = map(lambda a: int(a) - 1, input().split())
edges[fr].append(to)
edges[to].append(fr)
ans = [0] * N
L =... | from bisect import bisect_left
N = int(input())
A = list(map(int, input().split()))
edges = [[] for _ in range(N + 1)]
for _ in range(N - 1):
fr, to = map(int, input().split())
edges[fr].append(to)
edges[to].append(fr)
order = []
parent = [-1] * (N + 1)
st = [1]
while st:
now = st.pop(... | p02698 |
from bisect import bisect_left
N=int(input())
*A,=map(int,input().split())
G=[[] for _ in range(N)]
ab = [tuple(map(int,input().split())) for _ in range(N-1)]
for a,b in ab:
G[a-1].append(b-1)
G[b-1].append(a-1)
def bfs():
from collections import deque
dp = [[] for _ in range(N)]
dp[0] ... | from bisect import bisect_left
N=int(input())
*A,=map(int,input().split())
INF=10**20
G=[[] for _ in range(N)]
ab = [tuple(map(int,input().split())) for _ in range(N-1)]
for a,b in ab:
G[a-1].append(b-1)
G[b-1].append(a-1)
def dfs(a0):
seen =[0]*len(G)
todo = [~a0, a0]
while todo:
... | p02698 |
from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
# input = sys.stdin.readline
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999999999
n = int(inpu... | from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999999999
n = int(input(... | p02698 |
from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999999999
n = int(input(... | from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999... | p02698 |
from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
# def input(): return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 9999999999999999... | from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
INF = 999999999999999999... | p02698 |
import bisect
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for _ in range(n - 1):
u, v = list(map(int, input().split()))
tree[u - 1].append(v - 1)
tree[v - 1].append(u - 1)
ans... | import bisect
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for _ in range(n - 1):
u, v = list(map(int, input().split()))
tree[u - 1].append(v - 1)
tree[v - 1].append(u - 1)
ans... | p02698 |
from collections import deque
from bisect import bisect_left, bisect_right
n = int(eval(input()))
a = list(map(int, input().split()))
result = [-1 for _ in range(n)]
tree = [[] for _ in range(n)]
for _i in range(n-1):
u, v = list(map(int, input().split()))
u, v = u-1, v-1
tree[u].append(v)
t... | from bisect import bisect_left
n = int(eval(input()))
a = list(map(int, input().split()))
result = [-1 for _ in range(n)]
tree = [[] for _ in range(n)]
for _i in range(n-1):
u, v = list(map(int, input().split()))
u, v = u-1, v-1
tree[u].append(v)
tree[v].append(u)
INF = float('inf')
dp = [I... | p02698 |
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#l=deque(l), pop(), appe... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#l=deque(l), pop(), appe... | p02698 |
n = int(eval(input()))
a = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(n - 1)]
import sys
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
g = defaultdict(list)
for i in range(n - 1):
u = uv[i][0] - 1
v = uv[i][1] - 1
g[u].append(v)
... | n = int(eval(input()))
a = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(n - 1)]
from collections import defaultdict
g = defaultdict(list)
for i in range(n - 1):
u = uv[i][0] - 1
v = uv[i][1] - 1
g[u].append(v)
g[v].append(u)
from bisect import bisect... | p02698 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | p02698 |
import sys
from copy import copy
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
n = int(input())
a = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for _ in range(n - 1):
u, v = map(int, input().split())
u -= 1
v -= 1
... | import sys
from copy import copy
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
n = int(input())
a = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for _ in range(n - 1):
u, v = map(int, input().split())
u -= 1
v -= 1
... | p02698 |
def main():
from bisect import bisect_left
from collections import deque
import sys
input = sys.stdin.readline
inf = 1 << 30
N = int(input())
*a, = map(int, input().split())
g = tuple(set() for _ in range(N))
for _ in range(N - 1):
u, v = (int(x) - 1 for x in ... | def main():
from bisect import bisect_left
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
inf = 1 << 30
N = int(input())
*a, = map(int, input().split())
g = tuple(set() for _ in range(N))
for _ in range(N - 1):
u, v = (int(x) - 1 for x in... | p02698 |
n=int(eval(input()))
a=list(map(int,input().split()))
g = [[]for _ in range(n)]
for i in range(n-1):
u,v=list(map(int,input().split()))
g[u-1].append(v-1)
g[v-1].append(u-1)
import copy
import queue
import bisect
check = [False]*n
check[0] = True
li = [a[0]]
q= queue.Queue()
q.put([0,li])
ans... | from bisect import bisect_left
import sys
sys.setrecursionlimit(10**6)
n=int(eval(input()))
a=list(map(int,input().split()))
g = [[]for _ in range(n)]
for i in range(n-1):
u,v=list(map(int,input().split()))
g[u-1].append(v-1)
g[v-1].append(u-1)
lis = [float('inf')]*n
ans = [0]*n
def dfs(no... | p02698 |
import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n = int(eval(input()))
aa = {}
j = 0
for i in [int(i) for i in input().split()]:
if i in aa:
aa[i].append(j)
else:
aa[i] = [j]
j += 1
a = [0] * n
k = 1
for i in sorted(list(aa)):
... | import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n = int(eval(input()))
aa = {}
for j,i in enumerate(map(int,input().split())):
if i in aa:
aa[i].append(j)
else:
aa[i] = [j]
a = [0] * n
for k,i in enumerate(sorted(list(aa))):
for j i... | p02698 |
import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n = int(eval(input()))
aa = [int(i) for i in input().split()]
e = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
dp = [10 ** 1... | import sys
sys.setrecursionlimit(1000000)
def input():
return sys.stdin.readline()
n = int(eval(input()))
aa = [int(i) for i in input().split()]
e = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = [int(i) - 1 for i in input().split()]
e[a].append(b)
e[b].append(a)
dp = [10 ** 9... | p02698 |
from bisect import bisect_left as bl
import sys
sys.setrecursionlimit(10**6)
n=int(eval(input()))
a=list(map(int,input().split()))
t=[[]for i in range(n)]
for i in range(n-1):
u,v=list(map(int,input().split()))
t[u-1].append(v-1)
t[v-1].append(u-1)
b=[0]*n
dp=[float("inf")]*n
def f(c,d,dp):
... | from bisect import bisect_left as bl
import sys
sys.setrecursionlimit(10**6)
n=int(eval(input()))
a=list(map(int,input().split()))
t=[[]for i in range(n)]
for i in range(n-1):
u,v=list(map(int,input().split()))
t[u-1].append(v-1)
t[v-1].append(u-1)
b=[0]*n
dp=[float("inf")]*n
def f(c,d):
h=... | p02698 |
import sys
sys.setrecursionlimit(10**8)
from bisect import bisect_left, bisect_right
from copy import copy, deepcopy
N = int(input())
A = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
a,b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
... | import sys
sys.setrecursionlimit(10**8)
from bisect import bisect_left, bisect_right
N = int(input())
A = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
a,b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
def dfs(v,LIS):
if len(edg... | p02698 |
import sys
sys.setrecursionlimit(10**7)
import sys
input = sys.stdin.readline
n = int(eval(input()))
al = list(map(int,input().split()))
from collections import defaultdict
G = defaultdict(list)
for _ in range(n-1):
u,v = list(map(int,input().split()))
G[u-1].append(v-1)
G[v-1].append(u-1... | import sys
sys.setrecursionlimit(10**7)
import sys
input = sys.stdin.readline
n = int(eval(input()))
al = list(map(int,input().split()))
from collections import defaultdict
G = defaultdict(list)
for _ in range(n-1):
u,v = list(map(int,input().split()))
G[u-1].append(v-1)
G[v-1].append(u-1... | p02698 |
# -*- coding: utf-8 -*-
import sys
from bisect import bisect_left,bisect_right
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(... | # -*- coding: utf-8 -*-
import sys
from bisect import bisect_left,bisect_right
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(... | p02698 |
import sys
import bisect
from collections import deque
sys.setrecursionlimit(4100000)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
u, v = list(map(int, input().split()))
... | import sys
import bisect
from collections import deque
sys.setrecursionlimit(4100000)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
u, v = list(map(int, input().split()))
... | p02698 |
import sys
import bisect
from collections import deque
sys.setrecursionlimit(4100000)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
u, v = list(map(int, input().split()))
... | import sys
import bisect
from collections import deque
sys.setrecursionlimit(4100000)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
u, v = list(map(int, input().split()))
u... | p02698 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
N = int(eval(input()))
As = list(map(int, input().split()))
query = (list(map(int, readline().strip().split())) for _ in range(N-1))
tree = [[] for _ in range(N)]
for u, v in query:
tree[u-1]... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
N = int(eval(input()))
As = list(map(int, input().split()))
query = (list(map(int, readline().strip().split())) for _ in range(N-1))
tree = [[] for _ in range(N)]
for u, v in query:
tree[u-1]... | p02698 |
from collections import deque
import bisect
from copy import copy
n = int(input())
a = list(map(int, input().split()))
to=[list() for _ in range(n)]
for i in range(n-1):
u,v = map(int, input().split())
u-=1
v-=1
to[u].append(v)
to[v].append(u)
d= deque()
INF=10010001001
dpinit = ... | from collections import deque
import bisect
import sys
sys.setrecursionlimit(500000)
n = int(input())
a = list(map(int, input().split()))
to=[list() for _ in range(n)]
for i in range(n-1):
u,v = map(int, input().split())
u-=1
v-=1
to[u].append(v)
to[v].append(u)
INF=1001001001
dp... | p02698 |
from collections import deque
import bisect
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(input())
graph = [[] for _ in range(n+1)]
A = [0]+list(map(int, input().split()))
for i in range(n-1):
a, b = map(int, input().split())
graph[a]... | from collections import deque
import sys
import bisect
def input(): return sys.stdin.readline().rstrip()
n=int(input())
A=[0]+list(map(int, input().split()))
graph = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
visite... | p02698 |
import bisect
import sys
N = int(eval(input()))
a = list(map(int, input().split()))
to = [[] for _ in range(N)]
for _ in range(N - 1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
to[u].append(v)
to[v].append(u)
del u, v
ans = [-1] * N
def dfs(v, dp):
# dp は参照渡し
... | import bisect
import sys
N = int(eval(input()))
a = list(map(int, input().split()))
to = [[] for _ in range(N)]
for _ in range(N - 1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
to[u].append(v)
to[v].append(u)
del u, v
def dfs(v):
if len(dp) == 0 or a[v] > dp[-1]:
... | p02698 |
#MLE注意！0や1のケースに注意
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left... | #MLE注意！0や1のケースに注意
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left... | p02698 |
import bisect
from collections import deque
import copy
N = int(eval(input()))
a_array = list(map(int, input().split()))
node_dic = {}
for _ in range(N - 1):
u, v = list(map(int, input().split()))
if u in node_dic:
node_dic[u].append(v)
else:
node_dic[u] = [v]
if v in n... | import sys
import bisect
def dfs(edge):
insert = bisect.bisect_left(lis_array, a_array[edge - 1])
old = lis_array[insert]
lis_array[insert] = a_array[edge - 1]
ans = bisect.bisect_left(lis_array, INF)
ans_array[edge - 1] = ans
for next_edge in node_dic[edge]:
if use_array[ne... | p02698 |
import sys
sys.setrecursionlimit(10 ** 7)
from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(n - 1)]
adj = [[] for _ in range(n)]
for u, v in uv:
u -= 1
v -= 1
adj[u].append(v)
adj[v].append(u)
arri... | import sys
sys.setrecursionlimit(10 ** 7)
from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(n - 1)]
INF = 10 ** 10
adj = [[] for _ in range(n)]
for u, v in uv:
u -= 1
v -= 1
adj[u].append(v)
adj[v]... | p02698 |
import bisect
import sys
sys.setrecursionlimit(10**9)
N = int(input())
A = list(map(int, input().split()))
tree = [[] for i in range(N)]
for i in range(N-1):
u, v = map(int, input().split())
tree[u-1].append(v-1); tree[v-1].append(u-1)
ans = [0] * N
ans[0] = 1
INF = 10**10
dp = [INF] * N
dp[0] ... | import bisect
import sys
sys.setrecursionlimit(10**9)
N = int(input())
A = list(map(int, input().split()))
tree = [[] for i in range(N)]
for i in range(N-1):
u, v = map(int, input().split())
tree[u-1].append(v-1); tree[v-1].append(u-1)
ans = [0] * N
ans[0] = 1
INF = 10**10
dp = [INF] * N
dp[0] ... | p02698 |
import bisect
import sys
sys.setrecursionlimit(10**9)
N = int(input())
A = list(map(int, input().split()))
tree = [[] for i in range(N)]
for i in range(N-1):
u, v = map(int, input().split())
tree[u-1].append(v-1); tree[v-1].append(u-1)
ans = [0] * N
ans[0] = 1
INF = 10**10
dp = [INF] * N
dp[0] ... | import bisect
import sys
sys.setrecursionlimit(10**9)
N = int(input())
A = list(map(int, input().split()))
tree = [[] for i in range(N)]
for i in range(N-1):
u, v = map(int, input().split())
tree[u-1].append(v-1); tree[v-1].append(u-1)
ans = [0] * N
ans[0] = 1
INF = 10**10
dp = [INF] * N
dp[0] ... | p02698 |
import sys, bisect, copy
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
g = [[] for _ in range(n)]
for _ in range(n-1):
p,q = list(map(int,input().split()))
p -= 1
... | import sys, bisect, copy
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
g = [[] for _ in range(n)]
for _ in range(n-1):
p,q = list(map(int,input().split()))
p -= 1
... | p02698 |
class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.seg=[self.ide_ele]*2*self.num
for i in range(n):
self.seg[i+self.num-1]=init_val[i]
for i in... | class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.seg=[self.ide_ele]*2*self.num
for i in range(n):
self.seg[i+self.num-1]=init_val[i]
for i in... | p02698 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
from bisect import bisect_left
INF = float("inf")
from collections import defaultdict
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defaultdict(list)
def add_edge(self, f, t, w=1):
self.... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
from bisect import bisect_left
INF = float("inf")
from collections import defaultdict
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defaultdict(list)
def add_edge(self, f, t, w=1):
self.... | p02698 |
import bisect
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
A = tuple(map(int, input().split()))
edge = [[] for _ in range(N + 1)]
for _ in range(N - 1):
x, y = map(int, input().split())
edge[x].append(y)
edge[y].append(x)
ans = [-1] * (N + 1)
... | import bisect
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
A = tuple(map(int, input().split()))
edge = [[] for _ in range(N + 1)]
for _ in range(N - 1):
x, y = map(int, input().split())
edge[x].append(y)
edge[y].append(x)
ans = [-1] * (N + 1)
i... | p02698 |
import sys
from itertools import combinations
def solve(n, pairs):
survivors = {v: {v} for v in range(1, n + 1)}
for x, y in reversed(pairs):
for v, srv in list(survivors.copy().items()):
if x in srv:
if y in srv:
del survivors[v]
... | import sys
from itertools import combinations
def solve(n, pairs):
survivors = {v: {v} for v in range(1, n + 1)}
for x, y in reversed(pairs):
for v, srv in list(survivors.copy().items()):
if x in srv:
if y in srv:
del survivors[v]
... | p03691 |
ring = input() * 2
word = input()
if ring.find(word) != -1:
print("Yes")
else:
print("No") | ring = input() * 2
word = input()
if word in ring:
print("Yes")
else:
print("No") | p02418 |
s=input()
target=input()
ring=s*2
f=0
for i in range(len(s)):
if ring[i:i+len(target)]==target:
f=1
break
if f==1:
print("Yes")
else:
print("No") | s=input()
target=input()
ring=s*2
ans="No"
for i in range(len(s)):
if ring[i:i+len(target)]==target:
ans="Yes"
break
print(ans) | p02418 |
a = input()
b = input()
a = a+a
if 0 < a.count(b):
print('Yes')
else:
print('No') | a = input()
b = input()
a = a+a
if 0 <= a.find(b):
print('Yes')
else:
print('No') | p02418 |
from collections import deque
N = int(eval(input()))
M = N - 1
graph = [[] for _ in range(N + 1)]
dis_f = []
dis_s = []
#フェネックの距離
for i in range(M):
a,b = list(map(int,input().rstrip().split(" ")))
graph[a].append(b)
graph[b].append(a)
dist = [-1] * (N + 1)
dist[0] = 0
dist[1] = 0
d = dequ... | from collections import deque
N = int(eval(input()))
M = N - 1
graph = [[] for _ in range(N + 1)]
dis_f = []
dis_s = []
#フェネックの距離
for i in range(M):
a,b = list(map(int,input().rstrip().split(" ")))
graph[a].append(b)
graph[b].append(a)
dist_f = [-1] * (N + 1)
dist_f[0] = 0
dist_f[1] = 0
d ... | p03660 |
def bfs(v):
distance=[-1]*n
distance[v]=0
next=connection[v]
next2=set()
visited=[-1]*n
visited[v]=1
visitct=1
ct=0
while visitct!=n:
ct+=1
for i in range(len(next)):
distance[next[i]]=ct
visited[next[i]]=1
visitct+=1
for j in range(len(connection[next[i]... | def bfs(v):
distance=[-1]*n
distance[v]=0
next=connection[v]
next2=set()
visited=[-1]*n
visited[v]=1
visitct=1
ct=0
while len(next)!=0 or visitct!=n:
ct+=1
for i in range(len(next)):
distance[next[i]]=ct
visited[next[i]]=1
visitct+=1
for j in range(len(co... | p03660 |
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
e = [[] for _ in range(n)]
for i in range(n-1):
a, b = [int(item) for item in input().split()]
e[a-1].append(b-1)
e[b-1].append(a-1)
shortest = []
def get_path(start, end, par, path):
global shortest
if end in e[start]:
... | import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
e = [[] for _ in range(n)]
for i in range(n-1):
a, b = [int(item) for item in input().split()]
e[a-1].append(b-1)
e[b-1].append(a-1)
shortest = []
def get_path(start, end, par):
if end in e[start]:
shortest.append(en... | p03660 |
import heapq
N = int(eval(input()))
T = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
T[a].append([b, 1])
T[b].append([a, 1])
def dijkstra(x):
d = [float('inf')] * N
d[x] = 0
visited = {x}
# d, u
hq = [(0, ... | import sys
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
T = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
T[a].append([b, 1])
T[b].append([a, 1])
def dfs(n):
dist = [-1] * N
dist[n] = 0
stack = [n]
w... | p03660 |
# ABC067D - Fennec VS. Snuke (ARC078D)
from collections import deque
def bfs(s: int, d: "List[int]") -> None:
q = deque([s])
while q:
v = q.popleft()
for u in G[v]:
if not d[u]:
q.append(u)
d[u] = d[v] + 1
def main():
global G, D... | # ARC078D - Fennec VS. Snuke (ABC067D)
from collections import deque
def bfs(s: int, d: "List[int]") -> None:
q = deque([s])
while q:
v = q.popleft()
for u in G[v]:
if not d[u]:
q.append(u)
d[u] = d[v] + 1
def main():
global G, D... | p03660 |
#067-D
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(eval(input()))
def S(): return eval(input())
n=I()
prev=[-1 for i in range(n)]
nl=[[] for i in range(n)]
q=[0]
vis=[False for i in range(n)]
for i in range(n-1):
a,b=IL()
nl[a-1].append(b-... | #067-D
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(eval(input()))
def S(): return eval(input())
n=I()
nl=[[] for i in range(n)]
distfen=[-1 for i in range(n)]
distsnu=[-1 for i in range(n)]
for i in range(n-1):
a,b=IL()
nl[a-1].append(b-1)
... | p03660 |
def resolve():
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N-1)]
adjlist = {}
for a, b in AB:
adjlist.setdefault(a-1, [])
adjlist.setdefault(b-1, [])
adjlist[a-1].append(b-1)
adjlist[b-1].append(a-1)
import collections
q =... | def resolve():
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N-1)]
adjlist = {}
for a, b in AB:
adjlist.setdefault(a-1, [])
adjlist.setdefault(b-1, [])
adjlist[a-1].append(b-1)
adjlist[b-1].append(a-1)
import collections
q =... | p03660 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = [int(x)-1 for x in input().split()]
G[a].append(b)
G[b].append(a)
visited = [False] * N
visited[0] = True
def dfs(v):
if v == N-1:
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = [int(x)-1 for x in input().split()]
G[a].append(b)
G[b].append(a)
def dfs(v, dist):
for u in G[v]:
if dist[u] != -1:
co... | p03660 |
from collections import defaultdict
import queue
N = int(eval(input()))
edge = defaultdict(list)
for i in range(N-1):
a,b = list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
def bfs(s):
dist = defaultdict(lambda:float('inf'))
dist[s] = 0
que = queue.Queue()
que... | from collections import defaultdict
from heapq import heappop, heappush
from math import ceil
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, From, To, cost=1):
self.graph[From].appe... | p03660 |
from collections import defaultdict
from heapq import heappop, heappush
from math import ceil
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, From, To, cost=1):
self.graph[From].appe... | from heapq import heappush, heappop
def dijkstra(graph:list, node:int, start:int) -> list:
# graph[node] = [(cost, to)]
inf = float('inf')
dist = [inf]*node
dist[start] = 0
heap = [(0,start)]
while heap:
cost,thisNode = heappop(heap)
for NextCost,NextNode in graph[this... | p03660 |
import sys
input=sys.stdin.readline
N=int(eval(input()))
from collections import defaultdict
from collections import deque
branch=defaultdict(set)
for i in range(N-1):
a,b=list(map(int,input().split()))
branch[a]|={b,}
branch[b]|={a,}
brack=[float('inf')]*(N+1)
brack[1]=0
check=deque([(1,{1,N})]... | import sys
input=sys.stdin.readline
N=int(eval(input()))
from collections import defaultdict
from collections import deque
branch=defaultdict(set)
for i in range(N-1):
a,b=list(map(int,input().split()))
branch[a]|={b,}
branch[b]|={a,}
brack=[float('inf')]*(N+1)
brack[1]=0
brack[N]=0
check=deque... | p03660 |
n = int(eval(input()))
g = [set() for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
g[a-1].add(b-1)
g[b-1].add(a-1)
def dfs(s, e, flag):
visited = [-1]*n
visited[0] = 0
cnt = 1
if flag: temp = [[s, [[0]]]]
else: temp = [[s]]
lst = []
... | n = int(eval(input()))
g = [set() for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
g[a-1].add(b-1)
g[b-1].add(a-1)
def dfs(s):
visited = [-1]*n
visited[s] = 0
temp = [s]
lst = []
while temp:
p = temp.pop()
for a in g[p]:
... | p03660 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.