input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
from collections import Counter
from collections import deque
def main():
N = int(eval(input()))
C = []
T = [[] for j in range(N + 1)]
for i in range(N - 1):
a, b = [int(x) for x in input().split()]
T[a].append([b, i])
T[b].app... | import sys
input = sys.stdin.readline
from collections import deque
def main():
N = int(eval(input()))
C = []
T = [[] for j in range(N + 1)]
for i in range(N - 1):
a, b = [int(x) for x in input().split()]
T[a].append([b, i])
T[b].append([a, i])
C.append(a)
... | p02850 |
def resolve():
N = int(eval(input()))
g = {}
edges = []
for _ in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append(b-1)
g.setdefault(b-1, [])
g[b-1].append(a-1)
edges.append((a-1, b-1))
nodes = [(None, ... | def resolve():
N = int(eval(input()))
g = {}
edges_to_idx = {}
edges = []
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append(b-1)
g.setdefault(b-1, [])
g[b-1].append(a-1)
edges_to_idx.setdefault("... | p02850 |
def resolve():
N = int(eval(input()))
g = {}
edges_to_idx = {}
edges = []
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append(b-1)
g.setdefault(b-1, [])
g[b-1].append(a-1)
edges_to_idx.setdefault("... | def resolve():
N = int(eval(input()))
g = {}
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append((b-1, i))
g.setdefault(b-1, [])
g[b-1].append((a-1, i))
nodes = [(None, 0)]
colors = [None for _ in... | p02850 |
import sys
from collections import defaultdict
from copy import deepcopy
input = sys.stdin.readline
N = int(eval(input()))
edge = []
color_dict = {}
repn = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
edge.append((a, b))
color_dict[(... | import sys
from collections import defaultdict
from copy import deepcopy
input = sys.stdin.readline
N = int(eval(input()))
edge = []
color_dict = {}
repn = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
edge.append((a, b))
color_dict[(... | p02850 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
from collections import deque
def main():
N = int(eval(input()))
Node = [set() for _ in range(N)]
Edge = {}
for i in range(N-1):
a , b = list(map(int, input().split()))
a-=1
b-=1
if b<a:
a, b = b, a
... | #!/usr/bin python3
# -*- coding: utf-8 -*-
from collections import deque
def main():
N = int(eval(input()))
Node = [set() for _ in range(N)]
Edge = {}
for i in range(N-1):
a , b = list(map(int, input().split()))
a-=1
b-=1
if b<a:
a, b = b, a
... | p02850 |
N = int(input().strip())
#n_list = [[] for i in range(N)]
d = [0] * N
connect = [[-1 for i in range(N)] for j in range(N)]
for i in range(N-1):
a, b = list(map(int, input().strip().split()))
a -= 1
b -= 1
connect[a][b] = i
connect[b][a] = i
d[a] += 1
d[b] += 1
max_index = -1
... | import sys
N = int(input().strip())
n_list = [[] for i in range(N)]
d = [0] * N
for i in range(N-1):
a, b = list(map(int, input().strip().split()))
a -= 1
b -= 1
n_list[a].append([b,i])
n_list[b].append([a,i])
d[a] += 1
d[b] += 1
#print(n_list)
#print(d)
d_dict = {}
... | p02850 |
import sys
n=int(eval(input()))
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=list(map(int,sys.stdin.readline().split()))
g[a-1].append([b-1,i])
g[b-1].append([a-1,i])
print((max(len(v) for v in g)))
from collections import deque
l=[0]*(n-1)
q=deque([0])
b=[1]+[0]*(n-1)
while q:
v=q.pop()
c=... | import sys
sys.setrecursionlimit(10**6)
n=int(eval(input()))
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
g[a-1]+=[(b-1,i)]
g[b-1]+=[(a-1,i)]
l=[0]*(n-1)
def dfs(v,p=-1,s=-1):
t=1
for c,i in g[v]:
if c==p: continue
if t==s: t+=1
l[i]=t
dfs(c,v... | p02850 |
from collections import deque
from heapq import heappop
import sys
input = sys.stdin.readline
N = int(eval(input()))
T = []
D = [0]*N
V = [[] for _ in range(N)]
argmax = 0
for i in range(N-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
D[a] += 1
D[b] += 1
if D[argmax] < ... | from collections import deque
import sys
input = sys.stdin.readline
N = int(eval(input()))
T = []
D = [0]*N
V = [[] for _ in range(N)]
argmax = 0
for i in range(N-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
D[a] += 1
D[b] += 1
if D[argmax] < D[a]:
argmax = a
... | p02850 |
import sys
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict as dd
input = sys.stdin.readline
N = int(eval(input()))
e = dd(list)
for i in range(N - 1):
a, b = tuple(map(int, input().split()))
e[a].append((b, i))
e[b].append((a, i))
res = [0] * (N - 1)
vis = set()
def dfs(x):
globa... | import sys
from collections import defaultdict as dd
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
N = int(eval(input()))
e = dd(list)
for i in range(N - 1):
u, v = list(map(int, input().split()))
e[u].append((v, i))
e[v].append((u, i))
res = [0] * (N - 1)
def dfs(x):
global res
c = 1... | p02850 |
# D - Coloring Edges on Tree
n = int(eval(input()))
A = []
B = []
# 2次元配列で辺（頂点,遷移先の頂点）を管理する
D = [[] for _ in range(n)]
# 2次元配列で塗る色（頂点,遷移先の頂点）を管理する
C = [[0]*n for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
D[a].append(b)
D[b].append(a... | # D - Coloring Edges on Tree
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
A = []
B = []
# 2次元配列で辺（頂点,遷移先の頂点）を管理する
D = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
D[a].append(b)
D[b].append(a)
A.append(a)
... | p02850 |
import sys
sys.setrecursionlimit(1000000)
n = int(eval(input()))
g = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a].append([b, i])
g[b].append([a, i])
ans = [0]*(n-1)
def dfs(v, c=-1, p=-1):
k = 1
for u, ei in g[v]:
if u ==... | import sys
input = sys.stdin.readline
n = int(eval(input()))
g = [[] for _ in range(n)]
e = []
for i in range(n-1):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a].append(b)
g[b].append(a)
e.append((a, b))
# topological順序の計算
s = []
s.append(0)
parent = [-1]*n
order = [... | p02850 |
import sys
from collections import deque
sys.setrecursionlimit(10**7)
n = int(eval(input()))
graph = {i : [] for i in range(n)}
ls = []
for i in range(n-1):
a, b = [int(i) for i in sys.stdin.readline().split()]
a -= 1
b -= 1
ls.append((a,b))
graph[a].append(b)
graph[b].append(a)
_... | import sys
from collections import deque
sys.setrecursionlimit(10**7)
n = int(eval(input()))
graph = {i : [] for i in range(n)}
ls = []
for i in range(n-1):
a, b = [int(i) for i in sys.stdin.readline().split()]
a -= 1
b -= 1
ls.append((a,b))
graph[a].append(b)
graph[b].append(a)
_... | p02850 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
Graph = [[] for _ in range(N)]
edges = []
for _ in range(N - 1):
a, b = [int(x) - 1 for x in input().split()]
edges.append((a, b))
for a, b in edges:
Graph[a].append(b)
Graph[b].append(a)
k = max(len(edges) for edges in Grap... | import sys
input = sys.stdin.readline
N = int(eval(input()))
Graph = [[] for _ in range(N)]
edges = []
for _ in range(N - 1):
a, b = [int(x) - 1 for x in input().split()]
edges.append((a, b))
for a, b in edges:
Graph[a].append(b)
Graph[b].append(a)
k = max(len(edges) for edges in Grap... | p02850 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02850 |
import sys
import math
def func(s):
return int(s)-1
N=int(eval(input()))
e=[list(map(func,input().split()))+[i] for i in range(N-1)]
e.sort()
x=[0 for i in range(N)]
for i in range(N-1):
x[e[i][0]]+=1
x[e[i][1]]+=1
print((max(x)))
e2=[[0 for j in range(x[i])]for i in range(N)]
ans=[0 ... | import sys
import math
def func(s):
return int(s)-1
N=int(eval(input()))
e=[list(map(func,input().split()))+[i] for i in range(N-1)]
e.sort()
x=[0 for i in range(N)]
for i in range(N-1):
x[e[i][0]]+=1
x[e[i][1]]+=1
print((max(x)))
e2=[[0 for j in range(x[i])]for i in range(N)]
ans=[0 ... | p02850 |
from collections import deque
n = int(eval(input()))
edges = {}
lst = [set()for i in range(n)]
vert = [set() for i in range(n)]
ans = [0 for i in range(n-1)]
for i in range(n-1):
a,b = list(map(int,input().split()))
lst[a-1].add(b)
lst[b-1].add(a)
if a > b:
a,b = b,a
edges[(a,b)]... | n = int(eval(input()))
graph = [[] for _ in range(n+1)]
for i in range(1,n):
a,b = list(map(int,input().split()))
graph[a].append((i,b))
graph[b].append((i,a))
colors = [0 for _ in range(n)]
parents = [0]*(n+1)
stack = [(1,0)]
while stack:
x,c = stack.pop()
color = 1
for i,y in graph... | p02850 |
from collections import deque
N = int(eval(input()))
node = [[]for i in range(N)]
side = []
ans = [0]*(N-1)
watch = [0]*N
watch[0] = 1
for i in range(N-1):
a,b = list(map(int,input().split()))
side.append([a-1,b-1])
node[a-1].append(i)
node[b-1].append(i)
K = max(len(i) for i in node)
pri... | from collections import deque
N = int(eval(input()))
node = [[]for i in range(N)]
side = []
count = [0]*N
ans = [0]*(N-1)
closed = [0]*N
for i in range(N-1):
a,b = list(map(int,input().split()))
side.append([a-1, b-1])
node[a-1].append(i)
node[b-1].append(i)
count[a-1] += 1
count[b-... | p02850 |
from collections import deque
N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N-1)]
con = [set() for _ in range(N+1)]
res = {}
for ab in AB:
con[ab[0]].add(ab[1])
con[ab[1]].add(ab[0])
res[tuple(ab)] = 0
max_len = 0
for i, c in enumerate(con):
if max_len <= l... | N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N-1)]
sortedAB = sorted(AB)
con = {i: [] for i in range(1, N+1)}
color = [0] * (N + 1)
for a, b in sortedAB:
con[a].append(b)
for i in range(1, N + 1):
now_c = 1
for c in con[i]:
if color[i] == now_c:
... | p02850 |
import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n=int(eval(input()))
es=[[] for i in range(n)]
l=[list(map(int,input().split())) for i in range(n-1)]
for i in range(n-1):
l[i][0]-=1
l[i][1]-=1
l[i][0],l[i][1]=min(l[i][0],l[i][1]),max(l[i][0],l[i][1])
es[l[i][0]].append(l[i]... | import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n=int(eval(input()))
es=[[] for i in range(n)]
l=[list(map(int,input().split())) for i in range(n-1)]
for i in range(n-1):
l[i][0]-=1
l[i][1]-=1
es[l[i][0]].append(l[i][1])
es[l[i][1]].append(l[i][0])
dic={}
use=[1]*n
def d... | p02850 |
from collections import deque
import copy
n = int(eval(input()))
Adj_dict = {x:[] for x in range(1,n+1)}
AB = []
for _ in range(n-1):
a, b = list(map(int, input().split()))
Adj_dict[a].append(b)
Adj_dict[b].append(a)
AB.append([a,b])
max_edges = 0
node_max_edges = 0
for key, value in lis... | from collections import deque
n = int(eval(input()))
Adj_dict = {x:[] for x in range(1,n+1)}
AB_dict = {}
AB = []
for _ in range(n-1):
a, b = list(map(int, input().split()))
Adj_dict[a].append(b)
Adj_dict[b].append(a)
AB.append([a,b])
AB_dict.update({str(a)+'_'+str(b):0})
max_edges = ... | p02850 |
import queue
n = int(eval(input()))
#ab = [[]*(n)]
ab = [[] for _ in range(n+1)]
#print(ab)
li = []
for i in range(n-1):
a,b = list(map(int,input().split()))
ab[a].append(b)
ab[b].append(a)
li.append([a,b])
ab_color = [[0 for _ in range(n+1)] for _ in range(n+1)]
#print(li)
... | import queue
n = int(eval(input()))
#ab = [[]*(n)]
ab = [[] for _ in range(n+1)]
#print(ab)
li = []
for i in range(n-1):
a,b = list(map(int,input().split()))
ab[a].append([b,i])
ab[b].append([a,i])
#li.append([a,b])
#ab_color = [[None for _ in range(n+1)] for _ in range(n+1)]
ans =... | p02850 |
if __name__ == "__main__":
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
edges = [[] for _ in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
edges[a].append((b,i))
e... | if __name__ == "__main__":
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
edges = [[] for _ in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
edges[a].append((b,i))
e... | p02850 |
n=int(eval(input()))
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
g[a-1].append((b-1,i))
vc=[[] for _ in range(n)]
ec=[-1]*(n-1)
for p,ci in enumerate(g):
for c, i in ci:
color = 1
while True:
if color not in vc[p]:
... | n=int(eval(input()))
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
g[a-1].append((b-1,i))
vc=[0] * n
ec=[-1]*(n-1)
for p,ci in enumerate(g):
color = 1
for c, i in ci:
if vc[p] == color:
color += 1
vc[c] = color
ec[i] =... | p02850 |
import sys
from heapq import heappop as p
sys.setrecursionlimit(9**9)
n=int(eval(input()))
T=[[] for _ in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
T[a-1].append([b-1,i])
C=[0]*(n-1)
def f(Q):
R=[]
for q in Q:
H=list(range(1,n))
for t in T[q[0]]:
... | import sys
sys.setrecursionlimit(9**9)
n=int(eval(input()))
T=[[] for _ in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
T[a-1].append([b-1,i])
C=[0]*(n-1)
def f(i,r):
c=1
for (x,y) in T[i]:
c+=(c==r)
C[y]=c
f(x,c)
c+=1
f(0,0)
print((ma... | p02850 |
from collections import deque
def bfs(idx,k):
q = deque()
visited[idx] = True
q.append(idx)
color = 0
while q:
r = q.pop()
ver = set(graph[r].keys())
col = [i for i in range(k) if i not in set(graph[r].values())]
i = 0
for n in ver:
if not visited[n]:
graph[r][... | from collections import deque
def bfs(idx,k,colored):
q = deque()
visited[idx] = True
q.append(idx)
while q:
r = q.pop()
color = 0
for n in list(graph[r].keys()):
if not visited[n]:
if color == colored[r]: color+=1
colored[n] = color
graph[r][n] = color
... | p02850 |
from collections import deque
n = int(eval(input()))
node_list = []
nodes = [[] for _ in range(n)]
edges = dict()
for _ in range(n - 1):
a, b = list(map(int, input().split()))
node_list.append((a - 1, b - 1))
nodes[a - 1].append(b - 1)
nodes[b - 1].append(a - 1)
edges[(a - 1, b - 1)] = 0
used_colo... | from collections import deque
n = int(eval(input()))
nodes = [[] for _ in range(n)]
node_list = []
for _ in range(n - 1):
a, b = list(map(int, input().split()))
nodes[a - 1].append(b - 1)
node_list.append(b - 1)
que = deque([0])
ans = [0] * n
while len(que) > 0:
ni = que.pop()
color = 1
for node... | p02850 |
N = int(eval(input()))
A,B = [0]*(N-1),[0]*(N-1)
for i in range(N-1):
array = list(map(int,input().split()))
A[i] = array[0]
B[i] = array[1]
from collections import defaultdict as ddict
children = ddict(list)
for a,b in zip(A,B):
children[a].append(b)
ans = ddict(int)
for child in sorted(chil... | N = int(eval(input()))
AB = [[]]*(N-1)
for i in range(N-1):
AB[i] = list(map(int,input().split()))
from collections import defaultdict as ddict
from collections import deque
tree = ddict(list)
B = [0]*(N-1)
for i,ab in enumerate(AB):
tree[ab[0]].append(ab[1])
B[i] = ab[1]
# 各エッジの色を格納する変数の初期化
# C... | p02850 |
import sys
sys.setrecursionlimit(10**9)
N = int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1,i])
ans = [None]*(N-1)
# 引数：今回の基準頂点、前回の基準頂点と今回の頂点を結ぶ辺の色番号
def func(ver, color):
# 色番号。まずは最低の番号から始める。もし今回と前回の基準頂点の色番号1の場合は後で色番号変更
... | import sys
sys.setrecursionlimit(10**9)
N= int(eval(input()))
G = [[] for i in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt +... | p02850 |
import copy
n=int(eval(input()))
org=[i for i in range(1,10**5)]
org_set=set(org)
edges=[]
colors=[]
for i in range(n-1):
a,b=list(map(int,input().split(" ")))
edges.append([a,b])
colors.append([])
colors.append([])
colors.append([])
ans=[]
for i in edges:
color_sum=set(colors[i[0]]+co... | import copy
n=int(eval(input()))
org_set=set([i for i in range(1,10**5)])
edges=[]
relations={}
nodes=[]
for i in range(n-1):
a,b=list(map(int,input().split(" ")))
edges.append([a,b])
relations.setdefault(a,[]).append(b)
nodes.append([])
nodes.append([])
nodes.append([])
max_color=0
fo... | p02850 |
import copy
n=int(eval(input()))
org_set=set([i for i in range(1,10**5)])
edges=[]
relations={}
nodes=[]
for i in range(n-1):
a,b=list(map(int,input().split(" ")))
edges.append([a,b])
relations.setdefault(a,[]).append(b)
nodes.append([])
nodes.append([])
nodes.append([])
max_color=0
fo... | n=int(eval(input()))
edges=[]
relations={}
nodes=[0,0]
for i in range(n-1):
a,b=list(map(int,input().split(" ")))
edges.append([a,b])
relations.setdefault(a,[]).append(b)
nodes.append(0)
max_color=0
for start in range(1,n+1):
targets=relations.get(start,[])
color=1
for target ... | p02850 |
import sys
sys.setrecursionlimit(200000)
N = int(eval(input()))
ans = [0] * (N - 1)
AB = []
for i in range(N-1):
a,b = list(map(int,input().split()))
AB.append([a-1,b-1])
G = [list() for _ in range(N)]
for i in range(N-1):
G[AB[i][1]].append([AB[i][0],i])
G[AB[i][0]].append([AB[i][1],i])
d... | import sys
sys.setrecursionlimit(200000)
N = int(eval(input()))
ans = [0] * (N - 1)
G = [list() for _ in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
G[a].append([b,i])
G[b].append([a,i])
def dfs(v,c = -1,p = -1):
k = 1
for i in range(len... | p02850 |
# -*- coding: utf-8 -*-
from collections import deque
def main():
input_buffer = """
"""
#8
#1 2
#2 3
#2 4
#2 5
#4 7
#5 6
#6 8
INPUT = list(reversed(input_buffer.strip().splitlines()))
if INPUT:
n = int(INPUT.pop())
edges = [0] * ... | from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
B = AB[1::2]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
c = 0
for u in E[v]:
c += 1 + (c + 1 == C[... | p02850 |
from collections import deque
N = int(eval(input()))
EhasV = [set() for x in range(N)]
EE = [0] * (N-1)
for i in range(N-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
EE[i] = {a,b}
EhasV[a].add(i)
EhasV[b].add(i)
K = len(max(EhasV,key=len))
Vcolor = [set(range(1,K+1)) fo... | from collections import deque
N = int(input())
EhasV = [set() for x in range(N)]
EhasVnums = [0] * N
EE = [0] * (N-1)
for i in range(N-1):
a,b = map(int,input().split())
a -= 1
b -= 1
EE[i] = {a,b}
EhasV[a].add(i)
EhasV[b].add(i)
EhasVnums[a] += 1
EhasVnums[b] += 1
K = ... | p02850 |
import sys
from collections import deque
n = int(eval(input()))
G = [[] for _ in range(n + 1)]
G_order = []
# a<bが保証されている、aを親、bを子とする
for i in range(n - 1):
a, b = [int(x) - 1 for x in input().split()]
G[a].append(b)
G_order.append(b)
# どこでも良いが、ここでは0をrootとする
que = deque([0])
# 各頂点と「親」を結ぶ辺の色... | from collections import deque
N = int(eval(input()))
# 有向グラフと見る、G[親] = [子1, 子2, ...]
G = [[] for _ in range(N + 1)]
# 子ノードを記録、これで辺の番号を管理
G_order = []
# a<bが保証されている、aを親、bを子とする
for i in range(N - 1):
a, b = [int(x) - 1 for x in input().split()]
G[a].append(b)
G_order.append(b)
# どこでも良いが、ここでは0をr... | p02850 |
from collections import deque
N = int(eval(input()))
edges = [[] for _ in range(N)]
colors = [[-1 for _ in range(N)] for _ in range(N)]
visited = [False] * N
q = deque()
def bfs():
max_cnt = 0
while q:
u = q.popleft()
cnt = 1
visited[u] = True
for v in edges[u]:... | import sys
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
A = [[] for i in range(n)]
for i in range(n - 1):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
A[a].append([b, i])
ans = [0] * (n - 1)
def col(now, color):
c = 1
for (b, j) in A[now]:
if c ==... | p02850 |
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
adjL = [[] for _ in range(N)]
edges = []
for _ in range(N-1):
A, B = list(map(int, input().split()))
A, B = A-1, B-1
adjL[A].append(B)
adjL[B].append(A)
edges.append((A, B))
colors = dict()
def dfs(vNow, vPar, color):
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def solve():
N = int(eval(input()))
adjL = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
adjL[a].append((b, i))
adjL[b].append((a, i))
de... | p02850 |
def main():
from collections import deque
import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
N = int(readline())
R = [[int(i) for i in r.split()] for r in read().rstrip().split(b'\n')]
G = [[] for _ in range(N)]
edge = {}
ans_key = []
for a, b ... | def main():
import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
N = int(readline())
R = [[int(i) for i in r.split()] for r in read().rstrip().split(b'\n')]
G = [[] for _ in range(N)]
edge = {}
ans_key = []
for a, b in R:
G[a-1].append(b-1)
... | p02850 |
def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
edge = [-1] * (N-1)
for i in range(N-1):
a, b = (int(i)-1 for i in input().split())
G[a].append((b, i))
G[b].append((a, i))
max_deg = max(len(G[i]) for i in range(N))
from collections import deque
... | def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
edge = [-1] * (N-1)
for i in range(N-1):
a, b = (int(i)-1 for i in input().split())
G[a].append(b*N + i)
G[b].append(a*N + i)
max_deg = max(len(G[i]) for i in range(N))
from collections import dequ... | p02850 |
N = int(eval(input()))
a,b = [],[]
for _ in range(N-1):
at,bt = list(map(int,input().split()))
a.append(at)
b.append(bt)
E = [[] for _ in range(N+1)]
for i in range(N-1):
E[a[i]].append(b[i])
E[b[i]].append(a[i])
q = [[1,-1,0]]
ans = [[0 for _ in range(N+1)] for _ in range(N+1)]
cnt = 0
while ... | N = int(eval(input()))
E = sorted([list(map(int, input().split())) + [i] for i in range(N-1)], key = lambda x:x[1])
E.sort()
ans = [0 for _ in range(N-1)]
flg = [0 for _ in range(N+1)]
t = 0
cnt = 0
ans_a = 0
for i in range(N-1):
a,b,ind = E[i]
if t != a:
cnt = 1
t = a
if flg[a] == cnt:
cnt += ... | p02850 |
from collections import deque
n = int(input())
graph = [[] for _ in range(n)]
edge = []
for i in range(n-1):
a, b = map(lambda x:int(x)-1, input().split())
edge.append({a,b})
graph[a].append(b)
graph[b].append(a)
k = max(len(i) for i in graph)
que = deque()
seen = [False]*n
ans = [0]*(n-1)... | import sys
n = int(input())
sys.setrecursionlimit(2*n)
graph = [[] for _ in range(n)]
for i in range(n-1):
a, b = map(lambda x:int(x)-1, input().split())
graph[a].append((b, i))
graph[b].append((a, i))
def DFS(node, p_node=-1, p_color=-1):
color = 1
for c_node, edge in graph[node]:
... | p02850 |
N = int(eval(input()))
G = [[] for i in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a-1].append((b-1, i))
v_color = [0] * N
e_color = [0] * (N-1)
K = 1
for a, children in enumerate(G):
c = 1
for b, i in children:
if c == v_color[a]:
c += 1
... | def main():
n = int(eval(input()))
# G = [[0] * (n-1) for i in range(2)]
cnt = [0] * n
G = [[] for i in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
G[a-1].append((b-1, i))
cnt[a-1] += 1
cnt[b-1] += 1
# for i in range(n-1):
... | p02850 |
# 深さ優先探索
from sys import setrecursionlimit
def genid(a, b):
if b < a:
a, b = b, a
return a * 100000 + b
N = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(N - 1)]
edges = [[] for _ in range(N)]
for a, b in ab:
edges[a - 1].append(b - 1)
edges[b - 1].... | # 深さ優先探索
from sys import setrecursionlimit
def genid(a, b):
if b < a:
a, b = b, a
return a * 100000 + b
def paint(currentNode, usedColor, parentNode, edges, colors):
color = 1
for childNode in edges[currentNode]:
if childNode == parentNode:
continue
... | p02850 |
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
graph = [[] for i in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
graph[a-1].append((b,i))
graph[b-1].append((a,i))
ans = [0]*(N-1)
ten_col =[[] for i in range(N)]
... | import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
graph = [[] for i in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
graph[a-1].append((b,i))
graph[b-1].append((a,i))
ans = [0]*(N-1)
def dfs(past,now,edge_col):
new_col = 1
for (future,i) in... | p02850 |
# Problem D - Coloring Edges on Tree
from collections import deque
# input
N = int(eval(input()))
node_list = {} # 隣接リストの作成
color_count_list = [0]*(N+1)
ans_list = []
for i in range(N-1):
a, b = list(map(int, input().split()))
if a in node_list:
node_list[a].append(b)
else:
n... | from collections import deque
n=int(eval(input()))
G=[[]for _ in range(n)]
L=[]
ans=[0]*n
for i in range(n-1):
a,b=list(map(int,input().split()))
G[a-1].append(b-1)
L.append(b-1)
que=deque([0])
while que:
s=que.pop()
color=1
for ni in G[s]:
if ans[s]==color:
color+=1
... | p02850 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n = int(eval(input()))
edge = [[] for _ in [0]*n]
for i in range(~-n):
a, b = list(map(int, input().split()))
a -= 1;b -= 1
edge[a] += [[b, i]]
ans = [0] * ~-n
def dfs(now, color):
count = 1
fo... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n = int(eval(input()))
edge = [[] for _ in [0]*n]
for i in range(~-n):
a, b = list(map(int, input().split()))
a -= 1;b -= 1
edge[a] += [[b, i]]
ans = [0] * ~-n
def dfs(now, color):
count = 1
for to, i in edge[now]:
... | p02850 |
# 色の最大は辺が一番多い頂点
# 各頂点が現在持ってる色を覚える -> 2次元配列 : color_num = [[]*N]
# 答えを出力するための部分 -> 2次元配列 : ans = [[] * N for _ in range(N)]
# 答えの出し方はN-1ループでa[i], b[i]をansにいれる
from collections import deque
N = int(eval(input()))
graph = [[] for _ in range(N)]
AB = [[0] * 2 for _ in range(N-1)]
for i in range(N-1):
a, b = ... | # 色の最大は辺が一番多い頂点
# 各頂点が現在持ってる色を覚える -> 2次元配列 : color_num = [[]*N]
# 答えを出力するための部分 -> 2次元配列 : ans = [[] * N for _ in range(N)]
# 答えの出し方はN-1ループでa[i], b[i]をansにいれる
from collections import deque
N = int(eval(input()))
graph = {i:[] for i in range(N)}
AB = [[0] * 2 for _ in range(N-1)]
for i in range(N-1):
a, b ... | p02850 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
routes = []
ans = [[0]*n for i in range(n)]
edges = [[]for _ in range(n)]
used = [0]*n
for i in range(n-1):
a, b = list(map(int, input().split()))
routes.append([a-1, b-1])
edges[a-1].append(b-1)
sort_routes = sorted(routes)
... | import sys
input = sys.stdin.readline
n = int(eval(input()))
routes = []
dic = [{}] * n
edges = [[]for _ in range(n)]
used = [0]*n
for i in range(n-1):
a, b = list(map(int, input().split()))
routes.append([a-1, b-1])
edges[a-1].append(b-1)
for node in range(n):
unanle = used[node]
... | p02850 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(100000)
def main():
N = int(eval(input()))
sides = [[] for _ in range(N-1)]
for i in range(N-1):
a,b = list(map(int, input().split()))
sides[a-1].append((b-1,i))
ans = [[None] for _ in range(N-1)]
def dfs(f... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(100000)
def main():
N = int(eval(input()))
sides = [[] for _ in range(N-1)]
for i in range(N-1):
a,b = list(map(int, input().split()))
sides[a-1].append((b-1,i))
ans = [[None] for _ in range(N-1)]
def dfs(f... | p02850 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
degree = [ 0 for i in range(n) ]
connect_list = [ [] for i in range(n) ]
node_color = [0 for i in range(n)]
for i in range(n-1):
a, b = [ int(v)-1 for v in input().split() ]
connect_list[a].append([b,i])
degree[a] += 1
degree[b] += 1... | import sys
input = sys.stdin.readline
n = int(eval(input()))
degree = [ 0 for i in range(n) ]
connect_list = [ [] for i in range(n) ]
node_color = [0 for i in range(n)]
for i in range(n-1):
a, b = [ int(v)-1 for v in input().split() ]
connect_list[a].append([b,i])
degree[a] += 1
degree[b] += 1... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
D = [[0] * N for n in range(N)]
maxi = -1
AB = [0] * (N-1)
for n in range(N-1):
a, b = tuple([int(x) for x in input().strip().split()])
AB[n] = (a, b)
D[a-1][b-1] = '#'
D[b-1][a-1] = '#'
maxc = 0
... | import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
D = [deque([]) for _ in range(N)]
MAP = [[0] * N for n in range(N)]
maxi = -1
AB = [0] * (N-1)
for n in range(N-1):
a, b = [int(x) for x in input().strip().split()]
AB[n] = (a, b)
D[a-1].append(b-1)
D[... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
D = [deque([]) for _ in range(N)]
MAP = [[0] * N for n in range(N)]
maxi = -1
AB = [0] * (N-1)
for n in range(N-1):
a, b = [int(x) for x in input().strip().split()]
AB[n] = (a, b)
D[a-1].append(b-1)
D[... | import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(100000)
N = int(eval(input()))
D = [deque([]) for _ in range(N)]
cnt = 0
AB = [0] * (N-1)
dic = {}
for n in range(N-1):
a, b = [int(x) for x in input().strip().split()]
AB[n] = (a-1, b-1)
dic[(a, b)] = 0
... | p02850 |
from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
g = [[] for i in range(n)]
l = [0] * (n-1)
for _ in range(n-1):
a,b = list(map(int,input().split()))
a,b = a-1,b-1
l[_] = (min(a,b),max(a,b))
g[a].append(b)
g[b].append(a)
m = 0
for _ in range(n):
if len... | import sys
input = sys.stdin.readline
n = int(eval(input()))
g = [[] for i in range(n)]
l = [0] * (n-1)
for _ in range(n-1):
a,b = list(map(int,input().split()))
a,b = a-1,b-1
l[_] = (min(a,b),max(a,b))
g[a].append(b)
g[b].append(a)
m = 0
for _ in range(n):
if len(g[_]) > m:
m = len(g[_])
... | p02850 |
from collections import deque
def main():
n = int(eval(input()))
ab = []
colors = [[-1 for _ in range(n)] for _ in range(n)]
visit = [-1 for _ in range(n)]
tree = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int,input().split()))
ab.append([a-1, b-1])
... | from collections import deque
def main():
n = int(eval(input()))
ab = []
visit = [-1 for _ in range(n+1)]
tree = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = list(map(int,input().split()))
ab.append([a, b])
tree[a].append(b)
tree[b].append(a)
vi... | p02850 |
import sys
sys.setrecursionlimit(4100000)
N = int(eval(input()))
tree = [[] for _ in range(N+1) ]
already_make = [-1]*(N+1)
for i in range(1,N):
a,b = list(map(int,input().split(' ')))
tree[a].append([b,i])
last_color = 0
bfs_use_coler = [[] for _ in range(N+1)]
def solve(n,last_color):
'''
... | import sys
sys.setrecursionlimit(4100000)
N = int(eval(input()))
tree = [[] for _ in range(N+1) ]
already_make = [-1]*(N+1)
for i in range(1,N):
a,b = list(map(int,input().split(' ')))
tree[a].append([b,i])
last_color = 0
#bfs_use_coler = [[ -1 for _ in range(N+1) ] for _ in range(N+1) ]
def solv... | p02850 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n=int(input())
E=[[] for _ in range(n)]
idx={}
for i in range(n-1):
a,b=map(int,input().split())
a-=1; b-=1
E[a].append(b)
E[b... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(input())
E=[[] for _ in range(n)]
idx={}
for i in range(n-1):
a,b=map(int,input().split())
a-=1; b-=1
E[a].append(b)
E[b]... | p02850 |
from collections import Counter, defaultdict
from queue import Queue
G = defaultdict(list)
C = Counter()
N = int(eval(input()))
ans = {}
o = []
for i in range(N-1):
a, b = list(map(int, input().split()))
C[a] += 1
C[b] += 1
G[a].append(b)
G[b].append(a)
ans[(a, b)] = 0
o.appe... | from collections import Counter, defaultdict
from sys import getrecursionlimit,setrecursionlimit
setrecursionlimit(100*getrecursionlimit())
G = defaultdict(list)
C = Counter()
N = int(eval(input()))
ans = {}
o = []
for i in range(N-1):
a, b = list(map(int, input().split()))
C[a] += 1
C[b] += 1
... | p02850 |
# -*- coding: utf-8 -*-
from collections import deque
n = int(eval(input()))
edges = [list(map(int, input().split())) for i in range(n-1)]
# 使われていない色を保持する
nodes = [deque([i for i in range(1, n)]) for j in range(n)]
tree = {}
for edge in sorted(edges):
a = edge[0] # 頂点a
b = edge[1] # 頂点b
... | # -*- coding: utf-8 -*-
from collections import deque
n = int(eval(input()))
edges = [list(map(int, input().split())) for i in range(n-1)]
tree = {}
node_in = [0 for i in range(n)] # 頂点に入る辺は1つ
node_out = [[0] for i in range(n)] # 頂点から出る辺は1つ以上
for edge in sorted(edges):
a = edge[0] # 頂点a
b = edge[... | p02850 |
n=int(eval(input()))
l=[list(map(int,input().split()))+[i] for i in range(n-1)]
l.sort()
#print(l)
aa=[[] for _ in range(n)]
#aa[l[0][0]-1].append(1)
def bfs(v):
d=[-1]*n
d[v]=0
q=[v]
c=1
#print(d,q)
while q:
q1=[]
for i in q:
for j in pt[i]:
... | n = int(eval(input()))
l=[list(map(int,input().split()))+[i+1] for i in range(n-1)]
l.sort()
flg = [0 for _ in range(n+1)]
ans = [0 for _ in range(n)]
#print(l)
t=0
count=0
for i in range(n-1):
a,b,c=l[i]
if t!=a:
t=a
count=1
if flg[a]==count:
count+=1
flg[b]=count... | p02850 |
N=int(eval(input()))
edge=[tuple(i for i in list(map(int,input().split(" ")))) for i in range(N-1)]
graph=[set(i for i in range(1,N+1)) for j in range(N+1)]
a_list=[]
for i,j in edge:
ans = graph[i]&graph[j]
a_list.append(min(ans))
graph[i].remove(min(ans))
graph[j].remove(min(ans))
print((max(... | N=int(eval(input()))
edge=[tuple(i for i in list(map(int,input().split(" ")))) for i in range(N-1)]
graph=[[i for i in range(1,N+1)] for j in range(N+1)]
a_list=[]
for i,j in edge:
ans = set(graph[i])&set(graph[j])
tmp=min(ans)
a_list.append(tmp)
graph[i].remove(tmp)
graph[j].remove(tmp)
p... | p02850 |
N=int(eval(input()))
edge=[tuple(i for i in list(map(int,input().split(" ")))) for i in range(N-1)]
graph=[[i for i in range(1,N+1)] for j in range(N+1)]
a_list=[]
for i,j in edge:
ans = set(graph[i])&set(graph[j])
tmp=min(ans)
a_list.append(tmp)
graph[i][tmp-1]=N+1
graph[j][tmp-1]=N+1
pri... | import sys
sys.setrecursionlimit(500000)
N = int(eval(input()))
E = [[] for i in range(N + 1)]
for i in range(N - 1):
a, b = list(map(int, input().split(' ')))
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
ans = [-1] * (N - 1)
def dfs(v=1, p=0, p_col=-1):
co... | p02850 |
#!/usr/bin/env pypy3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.pop... | #!/usr/bin/env pypy3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.pop... | p02850 |
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
P = [[] for _ in range(N + 1)]
P2 = [[0] * (N + 1) for _ in range(N + 1)]
AB = []
for _ in range(N - 1):
a, b = [int(_) for _ in input().split()]
P[a].append(b)
P[b].append(a)
AB.append((a,b))
C = 0
for p in P:
if len(p)... | import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
P = [[] for _ in range(N + 1)]
AB = []
for _ in range(N - 1):
a, b = [int(_) for _ in input().split()]
P[a].append(b)
P[b].append(a)
AB.append((a,b))
C = 0
for p in P:
if len(p) > C:
C = len(p)
P2 = dict()
de... | p02850 |
'''catupper
'''
import sys
sys.setrecursionlimit(1000000)#DFSは再帰の上限回数に注意
n = int(eval(input()))
edge = [[] for i in range(n)]
a = [0] * n#頂点を格納しておく配列
b = [0] * n
color_dict = {}#色を覚えておく
k = 0
def dfs(x, last = -1, ban_color = -1):
#lastは、どこから来たか、逆走を防ぐ。使っちゃいけない色も引数
global k#グローバル変数
color =... | '''catupper
ポイントA.再帰DFSを使う。
ポイントB.入力に注意。
辺は頂点を結ぶので(a[i], b[i])で表現され、対応する色を
color_dict[(a[i], b[i])]としている。
配列が二重配列になっているので、注意。
ポイントC.色を頂点の順番で辺毎に出力する。辺の数は頂点-1個。
for i in range(n-1): if (a[i], b[i]) in color_dict:
'''
import sys
sys.setrecursionlimit(1000000)#DFSは再帰の上限回数に注意
n = int(eval(input()))
edge =... | p02850 |
#!/usr/bin/env pypy3
import itertools
UNDEF = 0
def mex(s):
for i in itertools.count(1):
if i not in s:
return i
def color_edges(n, edges):
adj_list = [set() for _ in range(n)]
for i, (a, b) in enumerate(edges):
adj_list[a].add(i)
adj_list[b].add(... | #!/usr/bin/env pypy3
import itertools
UNDEF = 0
def color_edges(n, edges):
adj_list = [set() for _ in range(n)]
for i, (a, b) in enumerate(edges):
adj_list[a].add(i)
adj_list[b].add(i)
colors = [UNDEF] * (n - 1)
for v in range(n):
adj_es = adj_list[v]
... | p02850 |
from collections import deque, OrderedDict
n = int(input())
edges = [tuple(map(int, input().split())) for _ in range(n-1)]
# print(edges)
tree = [[] for _ in range(n)]
# Zero-based index. グラフを陽に持つ。
edge_color = OrderedDict() # 辺のタプルをキーにした順序付き辞書
for e in edges:
a = e[0] - 1
b = e[1] - 1
tree[a].... | from collections import OrderedDict, deque
def main():
n = int(eval(input()))
edges = [tuple(map(int, input().split())) for _ in range(n - 1)]
tree = [[] for _ in range(n)] # こうしないとすべて同じリストObjになる.
coloring = OrderedDict()
for e in edges:
a, b = e[0] - 1, e[1] - 1
tree[a]... | p02850 |
n=int(eval(input()))
l=[[0 for i in range(n-1)]for j in range(n)]
m=[0]*n
t=[]
w=[]
for p in range(n-1):
e = list(map(int, input().split()))
w.append(e)
for i in range(n-1):
a=w[i][0]-1
b=w[i][1]-1
m[a] +=1
m[b] +=1
k=0
while True:
if l[a][k]==0 and l[b][k]==... | n=int(eval(input()))
l=[[] for j in range(n)]
m=[e for e in range(n-1)]
t=[]
for i in range(n-1):
a, b = list(map(int, input().split()))
a -=1
b -=1
buf = min(list(set(m)^set(l[a]+l[b])))
l[a].append(buf)
l[b].append(buf)
"""
while True:
if (k in l[a])==False a... | p02850 |
from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readline
def main():
N = int(input())
G = [[] for _ in range(N)]
dic = {}
for i in range(N-1):
a, b = map(lambda x: int(x)-1, input().spli... | from collections import deque
from sys import stdin
input = stdin.readline
def main():
N = int(input())
G = [[] for _ in range(N)]
dic = {}
for i in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
G[a].append(b)
G[b].append(a)
dic[(a, b)] = i
dic[(b, a)] = i
... | p02850 |
from collections import deque
N = int(eval(input()))
edges = [[] for i in range(N)]
e_list = []
for i in range(N-1):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
e_list.append((a,b))
edges[a].append((b,i))
edges[b].append((a,i))
ans = [0] * (N-1)
"""
bfs pattern
"""
q... | from collections import deque
N = int(eval(input()))
edges = [[] for i in range(N)]
e_list = []
for i in range(N-1):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
e_list.append((a,b))
edges[a].append((b,i))
edges[b].append((a,i))
ans = [0] * (N-1)
"""
bfs pattern
"""
q... | p02850 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(50000)
tree = {}
edges = []
colors = set()
N = 0
def readlines(n):
for _ in range(n):
a, b = list(map(int, input().split()))
yield a, b
def to_tree(edges_, n):
tree_ = {i:[] for i in range(1,n+1)}
for a, b in edge... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(50000)
tree = {}
edges = []
colors = set()
N = 0
def readlines(n):
for _ in range(n):
a, b = list(map(int, input().split()))
yield a, b
def to_tree(edges_, n):
tree_ = {i:[] for i in range(1,n+1)}
for a, b in edge... | p02850 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
AB = [[int(i) for i in input().split()] for _ in range(N-1)]
# graph[i]: 頂点iの親と子の集合
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
# 根
root = 1
# parent[i]: 頂点iの親
parent = [0]*(N+1)
# トポロジカル順序... | import sys
input = sys.stdin.readline
N = int(eval(input()))
AB = [[int(i) for i in input().split()] for _ in range(N-1)]
# graph[i]: 頂点iの親と子の集合
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
# 根
root = 1
# parent[i]: 頂点iの親
parent = [0]*(N+1)
# トポロジカル順序... | p02850 |
# input
n = int(eval(input()))
edge = [[0, 0, 0] for i in range(n-1)]
for i in range(n-1):
edge[i][0] ,edge[i][1] = list(map(int, list(input().split())))
# process
k = 0
pcolors = [0 for i in range(n)]
for i in range(n):
color = 0
for j in range(n-1):
if edge[j][0] == i+1:
... | import sys
sys.setrecursionlimit(10**7)
# input
n = int(eval(input()))
edges = [[] for i in range(n)]
for i in range(n-1):
a ,b = list(map(int, list(input().split())))
edges[a-1].append((b-1, i))
# process
ans = [0]*(n-1)
def f(a, c):
color = 1
for b, i in edges[a]:
if color... | p02850 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): retur... | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): retur... | p02850 |
n=int(eval(input()))
g = [[]for i in range(n)]
ab = [list(map(int,input().split()))for i in range(n-1)]
for i in range(n-1):
g[ab[i][0]-1].append(ab[i][1]-1)
ans = [[-1 for i in range(n)]for j in range(n)]
banColor = [-1]*n
from queue import deque
q = deque([])
q.append(0)
ma = 0
while q:
nord = q.p... | from queue import deque
n=int(eval(input()))
ab = [list(map(int,input().split()))for i in range(n-1)]
g = [[]for i in range(n)]
for i,j in ab:
g[i-1].append(j-1)
ans = {}
banColor = [-1]*n
q = deque([])
q.append(0)
ma = 0
while q:
nord = q.popleft()
offset = 0
for idx,value in enumer... | p02850 |
from collections import deque
n=int(eval(input()))
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=list(map(int,input().split()))
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.pop()
color=1
for ni in E[s]:
if color==ans[s]:
color+=1
... | from collections import deque
n=int(eval(input()))
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=list(map(int,input().split()))
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.popleft()
color=1
for ni in E[s]:
if color==ans[s]:
color... | p02850 |
from collections import deque
n=int(eval(input()))
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=list(map(int,input().split()))
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.popleft()
color=1
for ni in E[s]:
if color==ans[s]:
color... | from collections import deque
n=int(eval(input()))
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=list(map(int,input().split()))
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.pop()
color=1
for ni in E[s]:
if color==ans[s]:
color+=1
... | p02850 |
#!/usr/bin/env python3
import sys
import collections as cl
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
graph = [[] for i in range(N)]
prev ... | #!/usr/bin/env python3
import sys
import collections as cl
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
graph = [[] for i in range(N)]
prev ... | p02850 |
N = int(eval(input()))
V = [[] for _ in range(N)]
E = [[-1 for _ in range(N)] for _ in range(N)]
yobidasi = []
for i in range(N - 1):
a, b = list(map(int, input().split()))
V[a - 1].append(b - 1)
V[b - 1].append(a - 1)
yobidasi.append([a - 1, b - 1])
color_num = 0
for i in range(N):
color_num = max(c... | N = int(eval(input()))
V = [[] for _ in range(N)]
E = dict()
yobidasi = []
for i in range(N - 1):
a, b = list(map(int, input().split()))
V[a - 1].append(b - 1)
V[b - 1].append(a - 1)
yobidasi.append([a - 1, b - 1])
E[a - 1, b - 1] = -1
color_num = 0
for i in range(N):
color_num = max(color_num, len... | p02850 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02850 |
n = int(eval(input()))
g = [[] for x in range(n+1)]
s = []
for _ in range(n-1):
a,b = [int(x) for x in input().split()]
g[a].append(b)
g[b].append(a)
s.append([a,b])
from collections import deque
color = [[-1]*(n+1) for x in range(n+1)]
index = []
q = deque()
q.append([1,0])
ans = 0
whil... | n = int(eval(input()))
g = [[] for _ in range(n)]
z = []
for _ in range(n-1):
a,b = [int(x)-1 for x in input().split()]
g[a].append(b)
g[b].append(a)
if a<b:
z.append((a,b))
else:
z.append((b,a))
from collections import deque
parent = [0]*n
mc = 0
en = dict()
q =... | p02850 |
from collections import deque
def readinput():
n=int(eval(input()))
nList=[]
for _ in range(n+1):
nList.append([])
edges=[]
for _ in range(n-1):
a,b=list(map(int,input().split()))
edges.append((a,b))
nList[a].append(b)
nList[b].append(a)
return... | from collections import deque
def readinput():
n=int(eval(input()))
nList=[]
for _ in range(n+1):
nList.append([])
edges=[]
for _ in range(n-1):
a,b=list(map(int,input().split()))
edges.append((a,b))
nList[a].append(b)
nList[b].append(a)
return... | p02850 |
from collections import deque
def readinput():
n=int(eval(input()))
nList=[]
for _ in range(n+1):
nList.append([])
edges=[]
for _ in range(n-1):
a,b=list(map(int,input().split()))
edges.append((a,b))
nList[a].append(b)
nList[b].append(a)
return... | from collections import deque
def readinput():
n=int(eval(input()))
nList=[]
for _ in range(n+1):
nList.append([])
edges=[]
for _ in range(n-1):
a,b=list(map(int,input().split()))
edges.append((a,b))
nList[a].append(b)
#nList[b].append(a)
retur... | p02850 |
import sys
input = sys.stdin.buffer.readline
N=int(eval(input()))
val=[list(map(int, input().split())) for i in range(N-1)]
arr=[set() for i in range(N)]
col=[set() for i in range(N)]
colarr=[0]*(N-1)
alen=[0]*N
coldict={}
for i in range(N-1):
a=val[i][0]-1
b=val[i][1]-1
arr[a].add(b)
arr... | import sys
input = sys.stdin.buffer.readline
N=int(eval(input()))
val=[list(map(int, input().split())) for i in range(N-1)]
arr=[set() for i in range(N)]
col=[set() for i in range(N)]
colarr=[0]*(N-1)
coldict={}
for i in range(N-1):
a=val[i][0]-1
b=val[i][1]-1
arr[a].add(b)
arr[b].add(a)
... | p02850 |
from collections import deque
n = int(eval(input()))
tree = [[] for _ in range(n)]
edge = []
color = [set() for _ in range(n)]
ans = dict()
for i in range(n-1):
a,b = list(map(int,input().split()))
edge.append([a,b])
tree[a-1].append(b)
tree[b-1].append(a)
work_q = deque([])
visited = set(... | import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
n = int(input())
edge = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = map(int,input().split())
edge[a].append((b, i))
edge[b].append((a, i))
colors = 0
for i, line in enumerate(edge):
... | p02850 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
AB = [lr() for _ in range(N-1)] # 0-indexed
edges = [[] for _ in range(N+1)] # 1-indexed
for a, b in AB:
edges[a].append(b)
edges[b].append(a)
order = [] # 頂点１を根とした時、上か... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
AB = [lr() for _ in range(N-1)] # 0-indexed
edges = [[] for _ in range(N+1)] # 1-indexed
for a, b in AB:
edges[a].append(b)
edges[b].append(a)
order = [] # 頂点１を根とした時、上か... | p02850 |
import sys
from collections import defaultdict
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
AB = [lr() for _ in range(N-1)]
graph = [[] for _ in range(N+1)] # 1-indexed
for i in range(N-1):
a, b = AB[i]
AB[i] = tuple(sorted([a... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
graph = [[] for _ in range(N+1)]
AB = [lr() for _ in range(N-1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
root = 1
parent = [0] * (N+1)
order = []
stack... | p02850 |
from functools import reduce
from operator import mul
N = int(eval(input()))
ab = [tuple(map(int, input().split())) for _ in range(N-1)]
E_n = {k: 0 for k in ab}
for i in range(1,N+1):
items = {k:v for k,v in list(E_n.items()) if i in k}
c = 1
if items == {}: continue
elif reduce(mul, list(item... | N = int(input())
edge = {}
tree = [[] for i in range(N)]
colors = [1]*(N-1)
c_p = [[] for i in range(N)]
for i in range(N-1):
a,b = map(int,input().split())
a,b = a-1,b-1
tree[a].append(b)
edge[(a,b)] = i
for i in range(N):
c = 1
for v_c in tree[i]:
while c in c_p[i]: c+=1
... | p02850 |
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator i... | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator i... | p02850 |
from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
memo = {}
for i, (a, b) in enumerate(zip(*[iter(AB)] * 2)):
E[a].append(b)
E[b].append(a)
memo[(a, b)] = i
memo[(b, a)] = i
K = m... | from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
E = [set() for _ in range(N + 1)]
memo = {}
for i, (a, b) in enumerate(zip(*[iter(AB)] * 2)):
E[a].add(b)
E[b].add(a)
memo[(a, b)] = i
memo[(b, a)] = i
K = max(... | p02850 |
from collections import deque
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
memo = {}
for i, (a, b) in enumerate(zip(*[iter(AB)] * 2)):
E[a].append(b)
E[b].append(a)
memo[(a, b)] = i
memo[(b, a)] = i
K = max(len(e) for e in E)
A = [0] * (N - 1)
can... | from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
I = []
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
I.append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
... | p02850 |
from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
I = []
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
I.append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
... | from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
B = AB[1::2]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
c = 0
... | p02850 |
from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
A, B = AB[::2], AB[1::2]
E = [[] for _ in range(N + 1)]
for a, b in zip(A, B):
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
c = 0
... | """
challenge case
in:
3
1 3
2 3
out:
1
1
1
"""
from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
B = AB[1::2]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a] += b,
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.p... | p02850 |
"""
challenge case
in:
3
1 3
2 3
out:
1
1
1
"""
from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
B = AB[1::2]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a] += b,
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.p... | """
challenge case
in:
3
1 3
2 3
out:
1
1
1
"""
from collections import deque
def main():
N, *AB = list(map(int, open(0).read().split()))
B = AB[1::2]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v =... | p02850 |
from collections import defaultdict, deque, Counter
N = int(eval(input()))
edges = {}
counter = Counter()
nodes = defaultdict(set)
K = 0
for i in range(N - 1):
u, v = list(map(int, input().split(' ')))
counter[u] += 1
counter[v] += 1
K = max(K, counter[u], counter[v])
nodes[u].add(v... | from collections import defaultdict, deque, Counter
N = int(eval(input()))
counter = Counter()
nodes = defaultdict(list)
edges = []
for i in range(N - 1):
u, v = list(map(int, input().split(' ')))
nodes[u].append((v, i))
nodes[v].append((u, i))
edges.append((u, v))
K = 0
for node in l... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
G = [[] for _ in range(N)]
ans = {}
queue = deque([])
e = []
for l in range(N-1):
temp = list(map(int,input().split()))
temp[0] -= 1
temp[1] -= 1
e.append(tuple(temp))
ans[(temp[0],temp[1])] = 0
... | def main():
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
G = [[] for _ in range(N)]
ans = {}
queue = deque([])
e = []
for l in range(N-1):
temp = list(map(int,input().split()))
temp[0] -= 1
temp[1] -= 1... | p02850 |
import sys
def input():
return sys.stdin.readline()[:-1]
import math
from itertools import permutations, combinations
from collections import deque
sys.setrecursionlimit(10**7)
N = int(eval(input()))
ab = []
edges = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split())... | import sys
def input():
return sys.stdin.readline()[:-1]
import math
from itertools import permutations, combinations
from collections import deque
sys.setrecursionlimit(10**7)
N = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(N-1)]
edges = [[] for _ in range(N)]
for abi in a... | p02850 |
from collections import deque
def color_available(unavailable, K):
idx = 0
L = len(unavailable)
unavailable = sorted(unavailable)
for color in range(K):
if idx < L and color == unavailable[idx]:
idx += 1
else:
yield color
def bfs(graph, N, K, start):
... | from collections import deque
def color_available(unavailable, K):
idx = 0
L = len(unavailable)
unavailable = sorted(unavailable)
for color in range(K):
if idx < L and color == unavailable[idx]:
idx += 1
else:
yield color
def bfs(graph, N, K, start):
... | p02850 |
from collections import deque
def main():
N = int(eval(input()))
# 辺の集合を隣接リストとして入力
E = [[] for i in range(N+1)]
edge_order = []
for i in range(N-1):
a,b = list(map(int, input().split()))
E[a].append(b)
edge_order.append(b)
# 頂点1から幅優先探索
queue = deque([... | import sys
from collections import deque
read = sys.stdin.read
def main():
N, *ab = list(map(int, read().split()))
E = [[] for _ in range(N + 1)]
edge_order = []
for a, b in zip(*[iter(ab)] * 2):
E[a].append(b)
edge_order.append(b)
# 頂点1から幅優先探索
queue = de... | p02850 |
from collections import deque
N = int(eval(input()))
G = {i:[] for i in range(1,N+1)}
E = {}
A = []
for _ in range(N-1):
a,b = list(map(int,input().split()))
A.append((a,b))
G[a].append(b)
G[b].append(a)
E[(a,b)] = 0
hist = [0 for _ in range(N+1)]
heap = deque([1])
c = 1
for y in G[1]:... | from collections import deque
N = int(eval(input()))
G = {i:[] for i in range(1,N+1)}
E = {}
A = []
for _ in range(N-1):
a,b = list(map(int,input().split()))
A.append((a,b))
G[a].append(b)
G[b].append(a)
E[(a,b)] = 0
hist = [0 for _ in range(N+1)]
heap = deque([1])
c = 1
for y in G[1]:... | p02850 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.rea... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.rea... | p02850 |
import queue
N = int(eval(input()))
tree = [[]for _ in range(N+1)]
for i in range(1,N):
a,b = list(map(int,input().split()))
tree[a].append( [b,i])
tree[b].append([a,i])
que = queue.Queue()
node = [-1]*(N+1)
edge = [-1]*N
que.put(1)
node[1] = 1
maxi = max([len(i) for i in tree])
color = [[i ... | import queue
N = int(eval(input()))
tree = [[]for _ in range(N+1)]
for i in range(1,N):
a,b = list(map(int,input().split()))
tree[a].append( [b,i])
tree[b].append([a,i])
que = queue.Queue()
node = [-1]*(N+1)
edge = [-1]*N
que.put(1)
node[1] = 1
maxi = 1
color = [[] for _ in range(N+1)]
whi... | p02850 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.