input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import deque
N = int(eval(input()))
edges = [[] for _ in range(N + 1)]
for edge_idx in range(1, N):
a, b = list(map(int, input().split()))
edges[a].append([edge_idx, b])
edges[b].append([edge_idx, a])
used_edges = []
colors = [1 for _ in range(1, N + 1)]
used_colors = [[] for _ i... | from collections import deque
N = int(eval(input()))
edges = [[] for _ in range(N + 1)]
for edge_idx in range(1, N):
a, b = list(map(int, input().split()))
edges[a].append([edge_idx, b])
edges[b].append([edge_idx, a])
used_edges = set()
colors = [1 for _ in range(1, N + 1)]
used_colors = [set() f... | p02850 |
n = int(eval(input()))
l = [[] for _ in range(n+1)]
s = [0 for _ in range(n+1)]
ll = []
for _ in range(n-1):
ai,bi = list(map(int,input().split()))
l[ai].append(bi)
l[bi].append(ai)
ll.append([ai,bi])
s[ai] += 1
s[bi] += 1
mx = 0
for i in range(1,n+1):
if s[i] > mx:
mx = s[i]
mxi = ... | import sys
import resource
sys.setrecursionlimit(10**5)
n = int(eval(input()))
l = [[] for _ in range(n+1)]
s = [0 for _ in range(n+1)]
ll = []
for i in range(n-1):
ai,bi = list(map(int,input().split()))
l[ai].append([bi,i])
l[bi].append([ai,i])
s[ai] += 1
s[bi] += 1
mx = 0
for i in range(1,n+1)... | p02850 |
N = int(eval(input()))
edges = [[] for i in range(N)]
ans = [[0 for i in range(N + 1)] for i in range(N + 1)]
lines = []
for i in range(N - 1):
a, b = list(map(int, input().split()))
lines.append((a, b,))
edges[a - 1].append(b - 1)
q = [(0, 0,)]
max_color = 0
while q:
v, color = q.pop()
... | N = int(eval(input()))
edges = [[] for i in range(N)]
ans = [-1] * (N - 1)
lines = []
for i in range(N - 1):
a, b = list(map(int, input().split()))
lines.append((a, b))
edges[a - 1].append((b - 1, i,))
q = [(0, 0,)]
max_color = 0
while q:
v, c = q.pop()
color = 1
if c == color:
... | p02850 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N)]
Ed = {}
for i in range(N-1):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
Ed[(a-1)*N+b-1] = i
Ed[(b-1)*N+a-1] = i
q = [0]
checked = [False]*N
checked[0... | import sys
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N)]
Edges = []
for _ in range(N-1):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
Edges.append((a-1, b-1))
Col = 0
for n in range(N):
Col = max(Col, len(grap... | p02850 |
import sys
sys.setrecursionlimit(10**8)
N = int(eval(input()))
adj = [[] for _ in range(N+1)]
for e in range(1,N):
a,b = list(map(int, input().split()))
adj[a].append((b,e))
adj[b].append((a,e))
#print(adj)
col_num = max([len(ad) for ad in adj])
edge_color = [0]*N
visited = [False]*(N+1)
def d... | import sys
sys.setrecursionlimit(10**8)
def dfs(v,c):
now = 1
for u,i in edge[v]:
if color[i]==0:
if now==c:
now += 1
color[i] = now
dfs(u,now)
now += 1
return 0
N = int(input())
edge = [[] for _ in range(N)]
for i in range(N-1):
a,b = map(int, input().spl... | p02850 |
N = int(eval(input()))
E = []
A = [[-1 for j in range(N+1)] for i in range(N+1)]
edges = [[] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
if i == 0:
root = a
E.append((a,b))
edges[a].append(b)
edges[b].append(a)
def dfs(u):
visited = ["white"] * (N... |
N = int(eval(input()))
edges = [[] for i in range(N+1)]
A = [-1 for i in range(N-1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
if i == 0:
root = a
edges[a].append((b, i))
edges[b].append((a, i))
def dfs(u):
visited = ["white"] * (N + 1)
stack = [(u, -1, -1)]
mcolo... | p02850 |
N = int(eval(input()))
A = [[-1 for j in range(N+1)] for i in range(N+1)]
ans = [-1 for i in range(N-1)]
edges = [[] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
if i == 0:
root = a
edges[a].append((b, i))
edges[b].append((a,i))
def dfs(u):
visited = ... |
N = int(eval(input()))
EDGES = [[] for _ in range(N+1)]
P = [(set(), 1) for _ in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
if i == 0:
root = a
EDGES[a].append((b, i))
EDGES[b].append((a, i))
ans = [None for i in range(N-1)]
def dfs(root):
# from, parent, co... | p02850 |
from collections import defaultdict
N = int(eval(input()))
P = [[] for _ in range(N)]
C = [set([]) for _ in range(N)]
T = set([])
D = defaultdict(int)
for _ in range(N-1):
a, b = [int(x)-1 for x in input().split()]
P[a].append(b)
#P[b].append(a)
D[(a, b)]
def bfs(s):
d = [-1] * N
d[s]... | N = int(eval(input()))
graph = [[] for _ in range(N+1)]
AB = []
for _ in range(N-1):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
AB.append((a, b))
root = 1
parent = [0] * (N+1)
order = []
stack = [root]
while stack:
x = stack.pop()
order.append(x)
... | p02850 |
import sys,collections
input = sys.stdin.readline
n = int(eval(input()))
l=[[]]
cnt = [0]*(n+1)
nn = []
for _ in range(n+1):
l.append([])
for i in range(n-1):
a,b = list(map(int,input().split()))
l[a].append(b)
l[b].append(a)
nn.append(b)
m = max(list(map(len,l)))
co = []
for... | import sys
input = sys.stdin.readline
n = int(eval(input()))
l=[[]]
nn = []
for _ in range(n+1):
l.append([])
for i in range(n-1):
a,b = list(map(int,input().split()))
l[a].append(b)
l[b].append(a)
nn.append(b)
ml = list(map(len,l))
m = max(ml)
co = []
for i in range(n+1):
... | p02850 |
from collections import deque
N = int(eval(input()))
tree = [[] for _ in range(N)]
ans = {}
tmp = []
for _ in range(N-1):
a, b = [int(x)-1 for x in input().split()]
tree[a].append(b)
tree[b].append(a)
ans[(a, b)] = 0
tmp.append((a, b)) # 最後に出力する際に使う, 順番通りに出力する必要があるから。
# print(tree)
... | from collections import deque
N = int(eval(input()))
visited = [False]*N
tree = [[] for _ in range(N)]
tmp = []
for _ in range(N-1):
a, b = [int(x)-1 for x in input().split()]
tree[a].append(b)
tree[b].append(a)
tmp.append((a, b)) # 順番を保持するため
ans = {} # 連想配列で保持する
q = deque([0]) # 開始のノー... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
def main():
N = int(eval(input()))
visited = [False] * N
E = [deque() for i in range(N)]
nums = [set() for i in range(N)]
ans = [None] * (N-1)
for i in range(N-1):
a, b = list(map(int, input().split(... | # -*- coding: utf-8 -*
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
G = [[] for i in range(N)]
ans = [None] * (N-1)
for i in range(N-1):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
G[a].append((b, i))
... | p02850 |
n = int(eval(input()))
ikeru = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
ikeru[a-1].append((b-1, i))
settansaku = set([])
setmada = {0}
listmada = [(0, None)] #left: Vertex, right: Color
kouho = 1
num = [0 for _ in range(n-1)]
while kouho != 0:
for i, cnt in l... | n = int(eval(input()))
ikeru = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
ikeru[a-1].append((b-1, i))
settansaku = set([])
setmada = {0}
listmada = [(0, None)] #left: Vertex, right: Color
kouho = 1
num = [0 for _ in range(n-1)]
while kouho != 0:
for i, cnt in l... | p02850 |
from collections import deque
N = int(eval(input()))
edge = [[] for _ in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
edge[a - 1].append((b - 1, i))
edge[b - 1].append((a - 1, i))
ec = [0] * (N - 1)
def bfs():
q = deque()
q.append((0, 0))
while len(q... | import sys
sys.setrecursionlimit(10 ** 6)
def dfs(v, c):
nc = 0
k = 0
for nv, idx in edge[v]:
if status[nv] == 0:
nc = nc + 1 + ((nc + 1) == c)
color[idx] = nc
status[nv] = 1
k = max(k, dfs(nv, nc))
return max(nc, k)
N = int(eva... | p02850 |
from collections import deque
n = int(eval(input()))
ab = [list(map(int,input().split())) for i in range(n-1)]
ver = [[] for i in range(n)]
for i in range(n-1):
a,b = ab[i][0],ab[i][1]
ver[a-1].append(b-1)
ver[b-1].append(a-1)
#print(ver)
color = [dict() for i in range(n)]
q = deque()
... | import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
edge = [[] for i in range(n)]
for i in range(n-1):
a,b = list(map(int,input().split()))
edge[a-1].append((b-1,i))
edge[b-1].append((a-1,i))
k = max(len(e) for e in edge)
print(k)
ans = [-1]*(n-1)
def dfs(v=0, p=-1, to_p_col ... | p02850 |
# -*- coding: utf-8 -*-
"""
D - Coloring Edges on Tree
https://atcoder.jp/contests/abc146/tasks/abc146_d
"""
import sys
from collections import OrderedDict, deque
def main(args):
N = int(eval(input()))
G = [[] for _ in range(N+1)]
res = OrderedDict()
for _ in range(N-1):
a, b... | # -*- coding: utf-8 -*-
"""
D - Coloring Edges on Tree
https://atcoder.jp/contests/abc146/tasks/abc146_d
"""
import sys
from collections import OrderedDict, deque
def main(args):
N = int(eval(input()))
G = [[] for _ in range(N+1)]
res = OrderedDict()
for _ in range(N-1):
a, b... | p02850 |
"""Coloring Edges on Tree
https://atcoder.jp/contests/abc146/tasks/abc146_d
"""
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 5 + 1)
class Node:
def __init__(self, num):
self.num = num
self.edge = set()
self.edge_color = set()
def dfs(node, p):
used_... | """Coloring Edges on Tree
https://atcoder.jp/contests/abc146/tasks/abc146_d
"""
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 5 + 1)
class Node:
def __init__(self, num):
self.num = num
self.edge = set()
self.edge_color = set()
def dfs(node, c = -1 , p = -... | p02850 |
import collections
N=int(eval(input()))
AB=[list(map(int,input().split())) for i in range(N-1)]
AB_C=[0 for i in range(N-1)]
D=collections.Counter([i[0] for i in AB]+[i[1] for i in AB]).most_common()
M=D[0][1]
print(M)
data=[set() for i in range(N+1)]
idxdata=set([i for i in range(N-1)])
d=0
while idx... | from collections import deque
N=int(eval(input()))
AB=[list(map(int,input().split())) for i in range(N-1)]
P=[set() for i in range(N+1)]
C=[set() for i in range(N+1)]
for a,b in AB:
P[a].add(b)
P[b].add(a)
Cpath={}
stack=deque([1])
delset=set()
while stack:
#print(C)
#print(Cpath,"Cpath")... | p02850 |
from collections import deque
N = int(eval(input()))
B = []
L = []
for i in range(N-1):
ta,tb = list(map(int,input().split()))
B.append(ta)
B.append(tb)
L.append([ta,tb])
B =B[1::2]
E = [[] for _ in range(N + 1)]
for a, b in L:
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
whi... | def main():
from collections import deque
N = int(eval(input()))
B = []
L = []
for i in range(N-1):
ta,tb = list(map(int,input().split()))
B.append(ta)
B.append(tb)
L.append([ta,tb])
B =B[1::2]
E = [[] for _ in range(N + 1)]
for a, b in L... | p02850 |
n = int(eval(input()))
arr = []
for i in range(n-1):
arr.append([int(s) for s in input().split(" ")])
mmk = [[0 for i in range(n+1)] for i in range(n+1)]
childNodeNums = [0 for i in range(n)]
childNodeStatus = [-1 for i in range(n)]
nodeLines = [0 for i in range(n - 1)]
def prepare(n, arr):
s =... | 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
if color ... | p02850 |
from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(eval(input()))
ab = []
edges = [[]for _ in range(n)]
for _ in range(n-1):
a, b = list([int(x)-1 for x in input().split()])
edges[a].append(b)
edges[b].append(a)
ab.append((a, b))
... | from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(eval(input()))
ab = []
edges = [[]for _ in range(n)]
for _ in range(n-1):
a, b = list([int(x)-1 for x in input().split()])
edges[a].append(b)
edges[b].append(a)
ab.append((a, b))
... | p02850 |
from collections import deque
n = int(eval(input()))
e = [list(map(int, input().split())) for _ in range(n-1)]
c = [0 for _ in range(n-1)]
cmap = [[0 for _ in range(n)] for _ in range(n)]
for l in e:
cmap[l[0]-1][l[1]-1] = cmap[l[1]-1][l[0]-1]=-1
d = deque()
d.append(1)
while(d):
ed = d.popl... | from collections import deque
n = int(eval(input()))
ls = [list() for _ in range(n)]
ls2 = [list() for _ in range(n)]
edge = []
for i in range(n-1):
x,y = list(map(int,input().split()))
ls[x-1].append(i)
ls2[y-1].append(i)
edge.append([x-1,y-1])
d = deque()
color = [0]*(n-1)
d.append(0)
... | p02850 |
class ColorMgmt:
def __init__(self, n):
self.colors_hash = [set() for _ in range(n)]
self.next_colors = [1] * n
def set_color(self, v, c):
self.colors_hash[v].add(c)
if self.next_colors[v] != c:
return
cnt = 1
while cnt in self.colors_ha... | class ColorMgmt:
from heapq import heappop, heappush
def __init__(self, n):
self.colors_hash = [set() for _ in range(n)]
self.next_colors = [1] * n
def set_color(self, v, c):
self.colors_hash[v].add(c)
while self.next_colors[v] in self.colors_hash[v]:
... | p02850 |
import collections
import sys
input = sys.stdin.readline
N = int(eval(input()))
ab = [list(map(int, input().split())) for i in range(N-1)]
eda = [set() for i in range(N)]
for a, b in ab:
eda[a-1].add(b)
eda[b-1].add(a)
max_e = 0
for i in range(N-1):
max_e = max(max_e, len(eda[i]))
id = 0
for i ... | import collections
N = int(input())
G = [set() for i in range(N)]
ab = [tuple(map(int, input().split())) for i in range(N-1)]
d = dict()
i = 0
for a, b in ab:
a -= 1
b -= 1
d[(a, b)] = i
d[(b, a)] = i
i += 1
G[a].add(b)
G[b].add(a)
q = collections.deque()
r = set()
r.ad... | p02850 |
n = int(eval(input()))
ab = [list([int(x)-1 for x in input().split()]) for _ in range(n-1)]
e = [[] for _ in range(n)]
d = [[0 for _ in range(n)] for _ in range(n)]
c = [0] * n
for a, b in ab:
c[a] += 1
c[b] += 1
e[a].append(b)
e[b].append(a)
me = max(c)
print(me)
for a, b in ab:... | from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(eval(input()))
ab = [list([int(x)-1 for x in input().split()]) for _ in range(n-1)]
e = [[] for _ in range(n)]
d = [[0 for _ in range(n)] for _ in range(n)]
c = [0] * n
for a, b in ab:
c[a] += 1
c[b] += 1
e[a].append(b)
... | p02850 |
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(eval(input()))
ab = [list([int(x)-1 for x in input().split()]) for _ in range(n-1)]
e = [[] for _ in range(n)]
d = [[0 for _ in range(n)] for _ in range(n)]
c = [0] * n
for a, b in ab:
c[a] += 1
c[b] += 1
e[a].append(b)
... | from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(eval(input()))
ab = [list([int(x)-1 for x in input().split()]) for _ in range(n-1)]
e = [[] for _ in range(n)]
d = [[0 for _ in range(n)] for _ in range(n)]
c = [0] * n
for a, b in ab:
e[a].append(b)
e[b].append(a)
me = 0
... | p02850 |
from collections import defaultdict, deque
N = int(eval(input()))
E = [[] for _ in range(N+1)]
inp = []
for i in range(N-1):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
inp.append((a, b))
# node: (id, parent_id)
root_node = (1, -1)
open_list = deque([root_node])... | from collections import defaultdict, deque
N = int(eval(input()))
E = [[] for _ in range(N+1)]
edge_order = []
for i in range(N-1):
a, b = list(map(int, input().split()))
E[a].append(b)
E[b].append(a)
edge_order.append(b)
# node: (id, parent_id)
root_node = (1, -1)
open_list = deque([ro... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N)]
ab = [list([int(x)-1 for x in input().split()]) for _ in range(N-1)]
col_max = 0
for i in range(N-1):
a, b = ab[i]
graph[a] += [b]
graph[b] += [a]
for i in range(N):
col_max ... | import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N)]
ab = [list([int(x)-1 for x in input().split()]) for _ in range(N-1)]
d = {}
for a, b in ab:
graph[a] += [b]
graph[b] += [a]
def dfs(u, pre, c):
color = 0
for v in graph[u... | p02850 |
from collections import deque, Counter
N = int(eval(input()))
edge = [[] for i in range(N-1)]
to = [[] for i in range(N)]
color = {}
edge_list = []
for i in range(N-1):
a, b = list(map(int, input().split()))
to[a-1].append(b-1)
to[b-1].append(a-1)
edge[i] = [a-1, b-1]
edge_list.... | from collections import deque, Counter
N = int(eval(input()))
edge = [[] for i in range(N-1)]
to = [[] for i in range(N)]
color = {}
edge_list = []
for i in range(N-1):
a, b = list(map(int, input().split()))
to[a-1].append(b-1)
to[b-1].append(a-1)
edge[i] = [a-1, b-1]
edge_list.app... | p02850 |
from collections import deque
n = int(eval(input()))
matrix= []
lis = [[] for i in range(n)]
ans = [[0 for i in range(n)] for j in range(n)]
for i in range(n-1):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
matrix.append(sorted([a,b]))
lis[a].append(b)
lis[b].append(a)
color =... | from collections import deque
n = int(eval(input()))
matrix= []
lis = [[] for i in range(n)]
ans = {}
for i in range(n):
ans[i] = {}
for i in range(n-1):
a,b = list(map(int, input().split()))
a -= 1
b -= 1
matrix.append(sorted([a,b]))
lis[a].append(b)
lis[b].append(a)
color = [... | p02850 |
import heapq
import collections
from collections import deque
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)
colors = [ [-1... |
import heapq
import collections
from collections import deque
n = int(eval(input()))
ab = []
visit = [-1 for _ in range(n+1)]
tree = [[] for _ in range(n+1)]
colors = {}
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)
... | p02850 |
N = int(eval(input()))
ab = [list(map(int, input().split())) for i in range(N-1)]
tree = {i:[] for i in range(1, N+1)}
for a, b in ab:
tree[a].append(b)
tree[b].append(a)
stree = sorted(list(tree.items()), key=lambda x: -len(x[1]))
print((len(stree[0][1])))
start = stree[0][0]
colormap = {i:[0]*(... | from collections import deque
N = int(input())
ab = [list(map(int, input().split())) for i in range(N-1)]
tree = [list() for _ in range(N+1)]
color = [0] * (N-1)
for i, (a, b) in enumerate(ab):
tree[a].append((b, i))
q = deque([(1, 0)]) # パス先, パスの色でキューに追加
while q:
v, pc = q.popleft()
nc = 0 ... | p02850 |
import sys
N = int(sys.stdin.buffer.readline())
neighbor = [[] for _ in range(N)]
edge = []
for i in range(N-1):
a, b = list(map(int, sys.stdin.buffer.readline().split()))
neighbor[a-1].append(b-1)
neighbor[b-1].append(a-1)
edge.append([a-1, b-1, i])
K = len(max(neighbor, key=len))
print... | import sys
sys.setrecursionlimit(500000)
N = int(sys.stdin.buffer.readline())
neighbor = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, sys.stdin.buffer.readline().split()))
neighbor[a-1].append([b-1, i])
neighbor[b-1].append([a-1, i])
K = max(len(l) for l in neighbor)
print... | p02850 |
import sys
# import re
# import math
# import collections
# import decimal
# import bisect
# import itertools
# import fractions
# import functools
# import copy
# import heapq
# import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
ni = ... | import sys
# import re
# import math
# import collections
# import decimal
# import bisect
# import itertools
# import fractions
# import functools
# import copy
# import heapq
# import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
ni = ... | p02850 |
import sys
sys.setrecursionlimit(100000)
def rootedTree(node,parent,root,add):
A.append([node,parent,root,add])
for root_num,num in root:
if len(tree[root_num])!=0:
rootedTree(root_num,node,tree[root_num],num)
else:
A.append([root_num,node,tree[root_num],num])... | import sys
sys.setrecursionlimit(100000)
def rootedTree(node,parent,root,add):
A.append([node,parent,root,add])
for root_num,num in root:
rootedTree(root_num,node,tree[root_num],num)
n=int(eval(input()))
AB=[list(map(int,input().split()))+[i+1] for i in range(n-1)]
A=[]
tree=[[] for... | p02850 |
import sys
sys.setrecursionlimit(100000)
def rootedTree(node,parent,root,num):
A.append([node,parent,root,num])
for root_num,num in root:
rootedTree(root_num,node,tree[root_num],num)
n=int(eval(input()))
AB=[list(map(int,input().split()))+[i+1] for i in range(n-1)]
A=[]
tree=[[] for... | import sys
sys.setrecursionlimit(10**7)
def rootedTree(node,parent,root,num):
A.append([node,parent,root,num])
for root_num,num in root:
rootedTree(root_num,node,tree[root_num],num)
n=int(eval(input()))
AB=[list(map(int,input().split()))+[i+1] for i in range(n-1)]
A=[]
tree=[[] for ... | p02850 |
from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
edges = [[] for _ in range(n)]
l = []
for i in range(n-1):
a,b = list(map(int,input().split()))
edges[a-1].append(b-1)
edges[b-1].append(a-1)
l.append([a-1,b-1])
ans = [[0 for _ in range(n)] for... | from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
edges = [[] for _ in range(n)]
l = {}
for i in range(n-1):
a,b = list(map(int,input().split()))
edges[a-1].append(b-1)
edges[b-1].append(a-1)
l[(a-1,b-1)]=i
l[(b-1,a-1)]=i
ans = [0]*(n-1)
... | p02850 |
from collections import deque
n = int(eval(input()))
l = [0 for i in range(n)]
l2 = []
l3 = [[] for i in range(n+1)]
for i in range(n-1):
a,b = list(map(int,input().split()))
l2.append([a,b])
l3[a].append(b)
l3[b].append(a)
l[a-1] += 1
l[b-1] += 1
a = max(l)
print(a)
rl = [0 for i ... | from collections import deque
n = int(eval(input()))
l = [0 for i in range(n)]
l2 = []
l3 = [[] for i in range(n+1)]
for i in range(n-1):
a,b = list(map(int,input().split()))
l2.append([a,b])
l3[a].append(b)
l3[b].append(a)
l[a-1] += 1
l[b-1] += 1
a = max(l)
print(a)
rl = [0 for i ... | p02850 |
N = int(input())
A = set([i for i in range(1, 10**5)])
s = [[] for _ in range(N)]
r = []
for _ in range(N-1):
a, b = map(int, input().split())
n = min(A - set(s[a-1] + s[b-1]))
s[a-1] += [n]
s[b-1] += [n]
r.append(n)
print(max(r))
print(*r, sep='\n')
| from collections import deque
N = int(input())
G = [[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
G[b-1].append([a-1, i])
q = deque()
q.append([0, 0, 0])
colors = [0] * (N-1)
while q:
node, parent, edge_color = q.popleft()
c = 1
fo... | p02850 |
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
data = [[] for _ in range(n)]
for i in range(n-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
data[a].append([i,b]) # i本目でbに
data[b].append([i,a])
k = max(len(data[i]) for i in range(n))
print(k)
ans = [-1 for i in... | n = int(input())
G = [[] for _ in range(n)]
d = {}
for i in range(n-1):
a,b = map(int,input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
d[(a,b)] = d[(b,a)] = i
k = 0
ans = [None]*(n-1)
stack = [(0,-1)] #node, par
while stack:
now,pre = stack.pop()
color = ... | p02850 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
edges = [[int(i) for i in input().split()] for _ in range(N-1)]
edge_col = [0]*(N-1)
cols = [set() for _ in range(N)]
gp = [[] for _ in range(N)]
for ind, (a, b) in enumerate(edges):
gp[a-1].append((b-1, ind))
gp[b-1].append((a-1, ind))
... | import sys
input = sys.stdin.readline
N = int(eval(input()))
edges = [[int(i) for i in input().split()] for _ in range(N-1)]
edge_col = [0]*(N-1)
gp = [[] for _ in range(N)]
for ind, (a, b) in enumerate(edges):
gp[a-1].append((b-1, ind))
gp[b-1].append((a-1, ind))
cols = [set(list([x+1 for x in r... | p02850 |
import sys
sys.setrecursionlimit(10**6)
def dfs(G,v,p,color):
cnt=1
for nv in G[v]:
if(nv==p):
continue
if cnt in liset[v]:
while(cnt in liset[v]):
cnt+=1
liset[v].add(cnt)
liset[nv].add(cnt)
dic[str(v)+'t'+str(nv)]=cnt
... | import sys
sys.setrecursionlimit(10**6)
def dfs(G,v,p,color):
cnt=1
for nv in G[v]:
if(nv==p):
continue
while(cnt in s[v]):
cnt+=1
s[v].add(cnt)
s[nv].add(cnt)
dic[tuple(sorted([v,nv]))]=cnt
dfs(G,nv,v,cnt)
N=int(... | p02850 |
# ある頂点で、子供に対して順に1,2,3...と辺の色を渡していく
# 親から来た色を持っておき、親から来た色と同色になったときはスキップして次の色を渡す
# グラフ構築の際に、辺の番号を持っておく
import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
for i in range(N - 1):
a,b = list(map(int,readline().split()))
G[a-1].append([b-1,i])
G[b-1].append([a-1,i])
... | import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
from collections import defaultdict
E = defaultdict(int)
for i in range(N - 1):
a,b = list(map(int,readline().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
E[(a - 1, b - 1)] = i
from collections ... | p02850 |
import sys
from collections import deque
read = sys.stdin.read
N, *ab = list(map(int, read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
graph[a].append(b)
color = [0] * (N + 1)
queue = deque([1])
color_v = [[] for _ in range(N + 1)]
while queue:
V = queue.p... | import sys
from collections import deque
read = sys.stdin.read
N, *ab = list(map(int, read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
graph[a].append(b)
color = [0] * (N + 1)
queue = deque([1])
color_v = [set() for _ in range(N + 1)]
while queue:
V = queu... | p02850 |
import sys
from collections import deque
read = sys.stdin.read
N, *ab = list(map(int, read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
graph[a].append(b)
color = [0] * (N + 1)
queue = deque([1])
color_v = [set() for _ in range(N + 1)]
while queue:
V = queu... | import sys
from collections import deque
read = sys.stdin.read
N, *ab = list(map(int, read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
graph[a].append(b)
color = [0] * (N + 1)
queue = deque([1])
while queue:
V = queue.popleft()
number = 1
for v in... | p02850 |
N=int(eval(input()))
G=[[] for i in range(N)]
a=[]
b=[]
for i in range(N-1):
ai,bi=list(map(int,input().split()))
a.append(ai-1)
b.append(bi-1)
G[ai-1].append(bi-1)
G[bi-1].append(ai-1)
k=[0]*N
from collections import deque
q=deque([0])
C=[[-1]*N for i in range(N)]
p=[-1]*N
... | N=int(eval(input()))
G=[[] for i in range(N)]
a=[]
b=[]
for i in range(N-1):
ai,bi=list(map(int,input().split()))
a.append(ai-1)
b.append(bi-1)
G[ai-1].append(bi-1)
G[bi-1].append(ai-1)
k=[0]*N
from collections import deque
q=deque([0])
visited=[0]*N
ans={}
p=[-1]*N
kmx=0
... | p02850 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | p02850 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
X = [[] for _ in range(N)]
P = [-1] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
X[a-1].append((i, b-1))
#print(X)
P[b-1] = a-1
Q = [(0, -1)]
ANS = [-1] * (N-1)
while Q:
x, c0 = Q.pop()
c = 1
for... | import sys
input = sys.stdin.readline
N = int(eval(input()))
X = [[] for _ in range(N)]
P = [-1] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
X[a-1].append((i, b-1))
#print(X)
#P[b-1] = a-1
#print(X)
Q = [(0, -1)]
ANS = [-1] * (N-1)
maxc = 0
while Q:
x, c0 = Q.pop... | p02850 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
X = [[] for _ in range(N)]
P = [-1] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
X[a-1].append((i, b-1))
#print(X)
#P[b-1] = a-1
#print(X)
Q = [(0, -1)]
ANS = [-1] * (N-1)
maxc = 0
while Q:
x, c0 = Q.pop... | import sys
input = sys.stdin.readline
N = int(eval(input()))
X = [[] for _ in range(N)]
P = [-1] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
X[a-1].append((i, b-1))
#print(X)
#P[b-1] = a-1
#print(X)
Q = [(0, -1)]
ANS = [-1] * (N-1)
cmax = 0
while Q:
x, c0 = Q.pop... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
X = [deque() for _ in range(N)]
P = [-1] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
X[a-1].append((i, b-1))
#print(X)
#P[b-1] = a-1
#print(X)
Q = deque([(0, -1)])
ANS = [-1] * (... | import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
X = [[] for _ in range(N)]
P = [-1] * N
for i in range(N-1):
a, b = list(map(int, input().split()))
X[a-1].append((i, b-1))
#print(X)
#P[b-1] = a-1
#print(X)
Q = deque([(0, -1)])
ANS = [-1] * (N-1)
... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
bi=[0]* N
children = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
bi[i]=b-1
children[a-1].append(b-1)
queue = deque([0])
colors = [0] * N
maxColor = 0
while queue:
... | import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
bi=[0]* N
children = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
bi[i]=b-1
children[a-1].append(bi[i])
queue = deque([0])
colors = [0] * N
maxColor = 0
while queue... | p02850 |
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
bi=[0]* N
children = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
b-=1
bi[i]=b
children[a-1].append(b)
queue = deque([0])
colors = [0] * N
maxColor = 0
while q... | import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
bi=[0]* N
children = [[] for _ in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
b-=1
bi[i]=b
children[a-1].append(b)
queue = deque([0])
colors = [0] * N
#maxColor = 0
while ... | p02850 |
import queue
N = int(eval(input()))
ab = []
deg = [0 for i in range(N)]
child = [[] for _ in range(N)]
edge = {}
color = [0 for _ in range(N-1)]
for i in range(N-1):
tmp = list(map(int, input().split()))
deg[tmp[0]-1] += 1
deg[tmp[1]-1] += 1
child[tmp[0]-1].append(tmp[1]-1)
child[tmp[1]-1].ap... | import queue
N = int(eval(input()))
ab = []
deg = [0 for i in range(N)]
child = [[] for _ in range(N)]
edge = {}
color = [0 for _ in range(N-1)]
for i in range(N-1):
tmp = list(map(int, input().split()))
deg[tmp[0]-1] += 1
deg[tmp[1]-1] += 1
child[tmp[0]-1].append(tmp[1]-1)
child[tmp[1]-1].ap... | p02850 |
from collections import deque
N = int(input())
# mtx = np.zeros([N, N], dtype=np.int32)
tree = [[] for i in range(N)]
key_order = [0] * (N-1)
for i in range(N-1):
in1, in2 = map(int, input().split())
in1 -= 1
in2 -= 1
tree[in1].append(in2)
tree[in2].append(in1)
key_order[i] = (i... | from collections import deque
N = int(input())
# mtx = np.zeros([N, N], dtype=np.int32)
tree = [[] for i in range(N)]
key_order = [0] * (N-1)
for i in range(N-1):
in1, in2 = map(int, input().split())
in1 -= 1
in2 -= 1
tree[in1].append(in2)
tree[in2].append(in1)
key_order[i] = (i... | p02850 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
#import bisect
#from collections import deque
import math
sys.setrecursionlimit(10**5)
def input():
return sys.stdin.readline().rstrip('\n')
N = int(eval(input()))
peer_nodes = [[] for _ in range(N)]
edge_colors = [[0]*(N) for _ in range(N)]
... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
#import bisect
#from collections import deque
import math
sys.setrecursionlimit(10**5)
def input():
return sys.stdin.readline().rstrip('\n')
N = int(eval(input()))
peer_nodes = [[] for _ in range(N)]
edge_colors = [[0]*(N) for _ in range(N)]
... | p02850 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
#import bisect
#from collections import deque
import math
sys.setrecursionlimit(10**5)
def input():
return sys.stdin.readline().rstrip('\n')
N = int(eval(input()))
peer_nodes = [[] for _ in range(N)]
edge_colors = [{} for _ in range(N)]
pairs... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
#import bisect
#from collections import deque
import math
sys.setrecursionlimit(10**5)
def input():
return sys.stdin.readline().rstrip('\n')
N = int(eval(input()))
peers = [[] for _ in range(N)]
colors = [{} for _ in range(N)]
pairs = []
for... | p02850 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *AB = list(map(int, read().split()))
G = [[] for _ in range(N)]
for i, (a, b) in enumerat... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *AB = map(int, read().split())
G = [[] for _ in range(N)]
for i, (a, b) in enumerate(zip(... | p02850 |
from collections import deque
def main():
N = int(eval(input()))
path = [[] for _ in range(N)]
ab = []
ans = {}
visited = [False] * N
visited[0] = True
for _ in range(N-1):
a, b = list(map(int, input().split()))
path[a-1].append(b-1)
path[b-1].append(a-1)... | from collections import deque
def main():
N = int(eval(input()))
path = [[] for _ in range(N)]
ab = []
ans = {}
visited = [False] * N
visited[0] = True
for _ in range(N-1):
a, b = list(map(int, input().split()))
path[a-1].append(b-1)
# path[b-1].append(a-... | p02850 |
# ABC146 D - Coloring Edges on Tree
from collections import deque
n = int(eval(input()))
E = [[] for _ 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からBFS
q = deque([1])
color = [0] * (n+1)
while q:
V... | n=int(eval(input()))
G=[[] for i in range(n+1)]
G_order=[]
for i in range(n-1):
a,b=list(map(int,input().split()))
G[a].append(b)
G_order.append(b)
from collections import deque
q=deque([1])
color=[0]*(n+1)
while q:
cur=q.popleft()
c=1
for nx in G[cur]:
if c==color[cur]:
c+=1
... | p02850 |
n=int(eval(input()))
G=[[] for i in range(n+1)]
G_order=[]
for i in range(n-1):
a,b=list(map(int,input().split()))
G[a].append(b)
G_order.append(b)
from collections import deque
q=deque([1])
color=[0]*(n+1)
while q:
cur=q.popleft()
c=1
for nx in G[cur]:
if c==color[cur]:
c+=1
... | n = int(eval(input()))
G = [[] for _ in range(n)]
edge = []
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
edge.append(b)
from collections import deque
q = deque()
color = [0]*n
q.append(0)
while q:
cur = q.popleft()
c = 1
fo... | p02850 |
from collections import deque
N = int(eval(input()))
E = [tuple([int(x)-1 for x in input().split()]) for _ in range(N-1)]
K = 0
E_sorted = sorted(E, key=lambda x:x[0])
ans = {}
V = [deque([i for i in range(1, N)]) for _ in range(N)]
for e in E_sorted:
a, b = e
c = 1
req_K = True
c = V[a].popleft()
... | N = int(eval(input()))
E = [tuple([int(x)-1 for x in input().split()]) for _ in range(N-1)]
K = 0
E_sorted = sorted(E, key=lambda x:x[0])
ans = {}
V = [[] for _ in range(N)]
for e in E_sorted:
a, b = e
c = 1
req_K = True
c = 1
i = 1
while i <= K:
if not (i in V[a]):
c = i
req_... | p02850 |
N = int(eval(input()))
from collections import defaultdict
G = defaultdict(list)
EdaNum = defaultdict(int)
for i in range(N-1):
a,b = list(map(int,input().split()))
G[a].append(b)
G[b].append(a)
EdaNum[(a,b)] = i
ans = [-1]*(N-1)
que = [[1,-1,-1]]
K = 0
visited = [False]*(N+1)
... | N = int(eval(input()))
from collections import defaultdict
G = defaultdict(list)
EdaNum = defaultdict(int)
for i in range(N-1):
a,b = list(map(int,input().split()))
G[a].append(b)
G[b].append(a)
EdaNum[(a,b)] = i
ans = [-1]*(N-1)
que = [[1,-1,-1]]
K = 0
visited = [False]*(N+1)
... | p02850 |
from queue import deque
n = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(n-1)]
li = [[0 for i in range(n)]for j in range(n)]
for i,j in l:
i,j = i-1,j-1
li[i][j] = 1
li[j][i] = 1
ans = [[0 for i in range(n)]for j in range(n)]
before_color = {}
before_color[0] = 0
vi... | from queue import deque
n = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(n-1)]
li = [[] for _ in range(n)]
for i,j in l:
i,j = i-1,j-1
li[i].append(j)
li[j].append(i)
stack = 0
color = [0]*n
work_queue = deque([])
visited = [False]*n
visited[0] = True
color_list... | p02850 |
from collections import deque
N=int(eval(input()))
tree=[[] for _ in range(N)]
dirtree=[[] for _ in range(N)]
paths=[]
for i in range(N-1):
a,b=list(map(int,input().split()))
tree[a-1].append(b-1)
tree[b-1].append(a-1)
paths.append([a-1,b-1,i,0])
paths=sorted(paths,key=lambda x:x[1])
paths.so... | from collections import deque
N=int(eval(input()))
tree=[[] for _ in range(N)]
dirtree=[[] for _ in range(N)]
paths=[]
for i in range(N-1):
a,b=list(map(int,input().split()))
tree[a-1].append(b-1)
tree[b-1].append(a-1)
paths.append([a-1,b-1,i,0])
paths=sorted(paths,key=lambda x:x[1])
paths.so... | p02850 |
from collections import deque
N=int(eval(input()))
G=[[] for n in range(N)]
E=[]
color_map={}
for n in range(N-1):
a,b=list(map(int,input().split()))
E.append((a-1,b-1))
color_map[(a-1,b-1)]=0
G[a-1].append(b-1)
G[b-1].append(a-1)
deg=[len(v) for v in G]
K=max(deg)
Q=deque([0])
X=[]
... | from collections import deque
N=int(eval(input()))
G=[[] for n in range(N)]
E=[]
for n in range(N-1):
a,b=list(map(int,input().split()))
E.append((a-1,b-1))
G[a-1].append(b-1)
G[b-1].append(a-1)
K=max([len(v) for v in G])
P=[-1]*N
Q=[0]
X=[]
count=0
while Q:
v=Q.pop()
X.appen... | p02850 |
from collections import deque
N=int(eval(input()))
G=[[] for n in range(N)]
E=[]
for n in range(N-1):
a,b=list(map(int,input().split()))
E.append((a-1,b-1))
G[a-1].append(b-1)
G[b-1].append(a-1)
K=max([len(v) for v in G])
P=[-1]*N
Q=[0]
X=[]
count=0
while Q:
v=Q.pop()
X.appen... | N=int(eval(input()))
G=[[] for n in range(N)]
E=[]
for n in range(N-1):
a,b=list(map(int,input().split()))
E.append((a-1,b-1))
G[a-1].append(b-1)
G[b-1].append(a-1)
K=max([len(v) for v in G])
P=[-1]*N
Q=[0]
X=[]
count=0
while Q:
v=Q.pop()
X.append(v)
for u in G[v]:
... | p02850 |
n, m = list(map(int, input().split()))
g = [[i] for i in range(n)]
for _ in range(m):
u, v = [int(x) - 1 for x in input().split()]
g[u].append(v)
g[v].append(u)
q = int(eval(input()))
c = [None] * q
dp = [[-1 for j in range(n)] for i in range(11)]
for i in range(q):
v, d, c[i] = list(map... | n, m = list(map(int, input().split()))
g = [[i] for i in range(n)]
for _ in range(m):
u, v = [int(x) - 1 for x in input().split()]
g[u].append(v)
g[v].append(u)
q = eval(input())
c = [None] * q
dp = [[-1 for j in range(n)] for i in range(11)]
for i in range(q):
v, d, c[i] = list(map(int,... | p03768 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return False
else:
if pa... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(4100000)
n,m = list(map(int, readline().split()))
g = [[]*n for i in range(n)]
for i in range(m):
u,v = list(map(int,readline().split()))
u -= 1
v -= 1
g[u].append(v)
g[v].append(u)
... | p03768 |
inf = 100
N, M = list(map(int, input().split()))
WF = [[inf]*N for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
WF[a-1][b-1] = 1
WF[b-1][a-1] = 1
for i in range(N):
WF[i][i] = 0
for k in range(N):
for i in range(N):
for j in range(N):
WF[i][j] = min(WF[i][j], WF[i][k]+W... | inf = 100
N, M = list(map(int, input().split()))
G = [[set([j]) for i in range(11)] for j in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1][1].add(b-1)
G[b-1][1].add(a-1)
for i in range(N):
for d in range(1,11):
for j in G[i][d-1]:
G[i][d] |= G[j][1]
C = [0]*N
Q = i... | p03768 |
N, M = list(map(int, input().split()))
G = [[set([j]) for i in range(11)] for j in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1][1].add(b-1)
G[b-1][1].add(a-1)
for i in range(N):
if len(G[i][1]) == 1:
continue
for d in range(1,11):
for j in G[i][d-1]:
G[i][d] |= G[... | N, M = list(map(int, input().split()))
G = [[set([j]) for i in range(11)] for j in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
G[a-1][1].add(b-1)
G[b-1][1].add(a-1)
for i in range(N):
if len(G[i][1]) == 1:
continue
for d in range(1,11):
G[i][d] |= G[i][d-1]
for j in G[i]... | p03768 |
import sys
from collections import defaultdict as dd
input = sys.stdin.readline
N, M = list(map(int, input().split()))
e = dd(list)
for _ in range(M):
u, v = list(map(int, input().split()))
e[u].append(v)
e[v].append(u)
res = [set() for _ in range(N + 1)]
Q = int(eval(input()))
qd = [0] * Q
qc = [... | import sys
from collections import defaultdict as dd
input = sys.stdin.readline
N, M = list(map(int, input().split()))
e = dd(list)
for _ in range(M):
u, v = list(map(int, input().split()))
e[u].append(v)
e[v].append(u)
mxd = 0
res = [set() for _ in range(N + 1)]
Q = int(eval(input()))
qd = [0] * Q
... | p03768 |
import collections
n,m=list(map(int,input().split()))
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=list(map(int,input().split()))
g[a].append(b)
g[b].append(a)
q=int(eval(input()))
arr=[list(map(int,input().split())) for _ in range(q)]
color=[0]*(n+1)
for i in range(q):
v,d,c=arr[i]
tmp=0
... | def dfs(i,v,d,c):
if dp[v][d]==-1:
dp[v][d]=i
if d>0:
dfs(i,v,d-1,c)
for u in g[v]:
dfs(i,u,d-1,c)
n,m=list(map(int,input().split()))
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=list(map(int,input().split()))
g[a].append(b)
g[b].append(a)
q=int(eval(input()))
... | p03768 |
import queue
N, M = list(map( int, input().split() ))
G = [ [] for i in range( N ) ]
for i in range( M ):
u, v = list(map( int, input().split() ))
G[ u - 1 ].append( v - 1 )
G[ v - 1 ].append( u - 1 )
Q = int( eval(input()) )
V = []
D = []
C = []
for qi in range( Q ):
v, d, c = list(map( int, ... | from collections import deque
N, M = list(map( int, input().split() ))
G = [ [] for i in range( N ) ]
for i in range( M ):
u, v = list(map( int, input().split() ))
G[ u - 1 ].append( v - 1 )
G[ v - 1 ].append( u - 1 )
Q = int( eval(input()) )
V = []
D = []
C = []
for qi in range( Q ):
v, d, c ... | p03768 |
from collections import deque
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
Q=int(eval(input()))
Colors=[0]*N
dp=[[False]*11 for i in range(N)]
def BFS(v,d,c):
global dp
for i in range(d+1):
... | N,M=list(map(int,input().split()))
E=[]
for i in range(M):
a,b=list(map(int,input().split()))
E.append((a-1,b-1))
Q=int(eval(input()))
dp=[[-1]*11 for i in range(N)]
C=[]
for i in range(Q):
v,d,c=list(map(int,input().split()))
dp[v-1][d]=i
C.append(c)
for d in range(1,11)[::-1]:
for n in range(... | p03768 |
# -*- encoding: utf-8 -*-
N,M = list(map(int, input().split()))
C=[]
for i in range(N):
C.append(0)
AB=[]
for i in range(M):
AB.append(list(map(int, input().split())))
nextnodes=[]
for i in range(N):
nextnodes.append([])
for ab in AB:
#print("%d,%d,%d" % (N, ab[0], ab[1]))
nextnodes[ab[... | # -*- encoding: utf-8 -*-
N,M = list(map(int, input().split()))
C=[]
for i in range(N):
C.append(0)
AB=[]
for i in range(M):
AB.append(list(map(int, input().split())))
nextnodes=[]
for i in range(N):
nextnodes.append([])
for ab in AB:
#print("%d,%d,%d" % (N, ab[0], ab[1]))
nextnodes[ab[... | p03768 |
def recClr(v,d,c):
if clr[v-1]==0:
clr[v-1]=c
# print "recClr",v,d,c
if d>0:
if v in ab:
for b in ab[v]:
recClr(b,d-1,c)
N,M=list(map(int,input().split()))
ab={}
for i in range(M):
a,b=list(map(int,input().split()))
if a in ab:
... | def recClr(v,d,c):
# print "recClr",v,d,c
if visited[v-1] >= d:
return
else:
visited[v-1]=d
if clr[v-1]==0:
clr[v-1]=c
if d>0:
if v in ab:
for b in ab[v]:
recClr(b,d-1,c)
N,M=list(map(int,input().split()))
ab={}
for i in ra... | p03768 |
from queue import deque
def dijkstra(s, d):
queue = deque([(0, s)])
paint = set()
while queue:
cost, v = queue.popleft()
if cost > d:
break
paint.add(v)
queue.extend((cost + 1, u) for u in links[v] if u not in paint)
return paint
n, m = list... | from queue import deque
def paint(s, d, c):
queue = deque([(d, s)])
while queue:
remains, v = queue.popleft()
if painted[v] >= remains:
continue
if colors[v] == 0:
colors[v] = c
painted[v] = remains
if remains:
queue.exte... | p03768 |
n, m = list(map(int, input().split()))
node = [[] for _ in range(n + 1)]
for i in range(m):
a, b = list(map(int, input().split()))
node[a].append(b)
node[b].append(a)
q = int(eval(input()))
node_color = [0 for _ in range(n + 1)]
for j in range(q):
v, d, c = list(map(int, input().split()))
... | n, m = list(map(int, input().split()))
node = [[] for _ in range(n + 1)]
for i in range(m):
a, b = list(map(int, input().split()))
node[a].append(b)
node[b].append(a)
q = int(eval(input()))
node_color = [0 for _ in range(n + 1)]
vdc = [list(map(int, input().split())) for _ in range(q)]
vdc = vd... | p03768 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import deque
def resolve():
n,m=map(int,input().split())
E=[[] for _ in range(n)]
for _ in range(m):
u,v=map(int,input().split())
u-=1; v-=1
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import deque
def resolve():
n,m=map(int,input().split())
E=[[] for _ in range(n)]
for _ in range(m):
u,v=map(int,input().split())
u-=1; v-=1
... | p03768 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,m = list(map(int,readline().split()))
data = list(map(int,read().split()))
ab = data[:2*m]
q = data[2*m]
vdc = data[2*m+1:]
links = [[] for _ in range(n+1)]
it = iter(ab)
for a,b in zip(i... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,m = list(map(int,readline().split()))
data = list(map(int,read().split()))
ab = data[:2*m]
q = data[2*m]
vdc = data[2*m+1:]
links = [[] for _ in range(n+1)]
it = iter(ab)
for a,b in zip(i... | p03768 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p03768 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,m = list(map(int, input().split()))
from collections import defaultdict
ns = defaultdict(set)
for _ in range(m):
u,v = list(map(int, input().split()))
u -= ... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,m = list(map(int, input().split()))
from collections import defaultdict
ns = defaultdict(list)
for _ in range(m):
u,v = list(map(int, input().split()))
u -= 1... | p03768 |
from collections import deque
n, m = map(int, input().split())
G = [list() for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
a -= 1; b -= 1
G[a].append(b)
G[b].append(a)
Q = int(input())
queries = [tuple(map(int, input().split())) for _ in range(Q)][::-1]
dp = [[Q]*11 for _ in r... | import sys
readline = sys.stdin.readline
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
def solve():
n, m = nm()
G = [list() for _ in range(n)]
for _ in range(m):
a, b = nm()
... | p03768 |
from collections import defaultdict
def paint(v, d, c):
if (v, d) in memo:
return
else:
memo[(v, d)] = True
if d == 0:
color[v] = c
elif d > 0:
paint(v, d-1, c)
for nb in graph[v]:
paint(nb, d-1, c)
memo = {}
N, M = list(map(int, input... | from collections import defaultdict
def paint(v, d, c):
if color[v] == 0:
color[v] = c
if dp[v] >= d or d == 0:
return
dp[v] = d
for nb in graph[v]:
paint(nb, d-1, c)
N, M = list(map(int, input().split()))
dp = [0] * N
color = [0] * N
graph = defaultdict(set)
for... | p03768 |
from collections import deque
from heapq import heappop, heappush
N,M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
a,b = list(map(int, input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
Q = int(eval(input()))
VDC = [[int(i) for i in input().split()... | # 写経AC
N,M = map(int, input().split())
edge = [[] for _ in range(N)]
for _ in range(M):
a,b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
Q = int(input())
VDC = [[int(i) for i in input().split()] for _ in range(Q)]
for i in range(Q):
VDC[i][0] -= 1
color = [0] * ... | p03768 |
import queue
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
Q=int(eval(input()))
v=[0 for i in range(Q)]
d=[0 for i in range(Q)]
c=[0 for i in range(Q)]
for i in range(Q):
v[-i-1],d[-i-1]... | from collections import deque
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
Q=int(eval(input()))
v=[0 for i in range(Q)]
d=[0 for i in range(Q)]
c=[0 for i in range(Q)]
for i in range(Q):
... | p03768 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p03768 |
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_... | import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_... | p03768 |
n, m = list(map(int, input().split()))
g = {}
used = {i:[False for _ in range(11)] for i in range(n)}
color = [0 for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split()))
u-=1
v-=1
if u not in g:
g[u] = []
if v not in g:
g[v] = []
g[u... | n, m = list(map(int, input().split()))
g = {}
used = {i:[False for _ in range(11)] for i in range(n)}
color = [0 for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split()))
u-=1
v-=1
if u not in g:
g[u] = []
if v not in g:
g[v] = []
g[u].... | p03768 |
from collections import deque
N, M, *L = list(map(int, open(0).read().split()))
AB, VDC = L[:2 * M], L[2 * M + 1:]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
colors = [0] * (N + 1)
visited = [-1] * (N + 1)
for v, d, c in reversed(tuple(zip(*[i... | from collections import deque
def main():
N, M, *L = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(L[:2 * M])] * 2):
E[a].append(b)
E[b].append(a)
colors = [0] * (N + 1)
visited = [-1] * (N + 1)
for v, d, c in revers... | p03768 |
from collections import deque
def main():
N, M, *L = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(L[:2 * M])] * 2):
E[a].append(b)
E[b].append(a)
colors = [0] * (N + 1)
visited = [False] * (N + 1)
for v, d, c in rev... | from collections import deque
def main():
N, M, *L = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(L[:2 * M])] * 2):
E[a].append(b)
E[b].append(a)
colors = [0] * (N + 1)
visited = [-1] * (N + 1)
for v, d, c in revers... | p03768 |
def painting(N,A,v,d,c):
if d < 0:
return
if A[v][d] == 0:
A[v][d] = c
for ni,n in enumerate(N[v]):
if n == 1:
painting(N,A,ni,d-1,c)
N,M = list(map(int,input().split()))
nodes = [[0]*N for i in range(N)]
dp = [[0]*11 for i in range(N)]
for m in range(M):
a,b = list(map(int,input().split()))... | def painting(N,A,v,d,c):
if d < 0:
return
if A[v][d] == 0:
A[v][d] = c
i = 0
while i < len(N):
if 1 in N[v][i:]:
i = i + N[v][i:].index(1)
else:
break
painting(N,A,i,d-1,c)
i = i + 1
N,M = list(map(int,input().split()))
nodes = [[0]*N for i in range(N)]
dp = [[0]*11 for... | p03768 |
#b
#naive (TLE)
n,m = [int(i) for i in input().split()]
edges = [[] for _ in range(n)]
colors = [0]*n
for _ in range(m):
a,b = [int(i) for i in input().split()]
edges[a-1].append(b-1)
edges[b-1].append(a-1)
q = int(eval(input()))
info = []
for _ in range(q):
v,d,c = [int(i) for i i... | #b
#by using the condition d<=10, we should memorize V*d whether the pair is already searched.
#if searched, we can stop.
n,m = [int(i) for i in input().split()]
edges = [[] for _ in range(n)]
colors = [0]*n
checker = [[0 for _ in range(11)] for _ in range(n)]
for _ in range(m):
a,b = [int(i) ... | p03768 |
import sys
sys.setrecursionlimit(10**7)
def main():
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
q = int(eval(input()))
vdc = [list(map(int, input().spli... | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
def main():
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
q = int(eval(input()))
vdc =... | p03768 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
agc012 C
"""
from collections import defaultdict
n, m = list(map(int, input().split()))
graph = defaultdict(list)
for i in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
q = ... | #! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
agc012 C
"""
n, m = list(map(int, input().split()))
graph = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
q = int(eval(input()))
qlist = [t... | p03768 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
agc012 C
"""
n, m = list(map(int, input().split()))
graph = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
q = int(eval(input()))
qlist = [t... | #! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
agc012 C
"""
n, m = list(map(int, input().split()))
graph = [[] for i in range(n+1)]
for i in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
q = int(eval(input()))
qlist = [t... | p03768 |
n,m = list(map(int,input().split()))
p = [list(map(int,input().split())) for i in range(m)]
q = int(eval(input()))
v = [list(map(int,input().split())) for i in range(q)]
v = v[::-1]
l = [[] for i in range(n+1)]
for pi in p:
l[pi[0]].append(pi[1])
l[pi[1]].append(pi[0])
mita = [-1]*(n+1)
tugi = [set(... | n,m = list(map(int,input().split()))
p = [list(map(int,input().split())) for i in range(m)]
q = int(eval(input()))
v = [list(map(int,input().split())) for i in range(q)]
v = v[::-1]
l = [[] for i in range(n+1)]
for pi in p:
l[pi[0]].append(pi[1])
l[pi[1]].append(pi[0])
mita = [-1]*(n+1)
tugi = [set(... | p03768 |
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
nei =[[i] for i in range(n)]
for i in range(m):
a, b = list(map(int,input().split()))
a -= 1
b -= 1
nei[a].append(b)
nei[b].append(a)
color = [0 for i in range(n)]
#print(nei)
def paint(v,d,c):
if colo... | import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
nei =[[i] for i in range(n)]
for i in range(m):
a, b = list(map(int,input().split()))
a -= 1
b -= 1
nei[a].append(b)
nei[b].append(a)
color = [0 for i in range(n)]
depth = [-1 for i in range(n)]
def paint... | p03768 |
import sys
N,K=list(map(int,input().split()))
A=sorted([int(i) for i in input().split()])
def f(x):
L=[set() for i in range(N+1)]
L[0].add(0)
for i in range(N):
s=A[i]
if i==x:
s=0
for k in L[i]:
L[i+1].add(k)
if k+s<K:
... | import sys
N,K=list(map(int,input().split()))
A=sorted([int(i) for i in input().split()])
sa=sum(A)
def f(x):
if A[x]>=K:
return True
L=set()
L.add(0)
for i in range(N):
T=set()
s=A[i]
if i==x:
s=0
for k in L:
T.add(k)
... | p03782 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted([a for a in A if a < K])
N = len(A)
S = sum(A)
l, r = -1, N
while r - l > 1:
m = (l + r) // 2
B = A[:m] + A[m + 1:]
if S - A[m] < K - A[m]:
l = m
continue
dp = [False] * (K + 1)
... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted([a for a in A if a < K])
N = len(A)
S = sum(A)
# あああああああああああああああああああ＼(＾o＾)／
if S < K:
print(N)
exit()
elif S - A[0] < N:
print((0))
exit()
l, r = -1, N
while r - l > 1:
m = (l + r) // 2
B =... | p03782 |
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
a = sorted(a)
if N == 1:
if a[0] >= K:
print((0))
else:
print((1))
else:
def check(i):
if a[i] >= K:
return True
if i == 0:
b = a[1:]
elif i == N - 1:
b = a[:N - 1]
else:
b = a[:i] + a[i+1:]
#pr... | N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
a = sorted(a)
if N == 1:
if a[0] >= K:
print((0))
else:
print((1))
else:
def check(i):
if a[i] >= K:
return True
if i == 0:
b = a[1:]
elif i == N - 1:
b = a[:N - 1]
else:
b = a[:i] + a[i+1:]
#pr... | p03782 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.