input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from sys import setrecursionlimit; setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
edge = {}
starts = set(i for i in range(1, N+1))
for _ in range(M):
x, y = list(map(int, input().split()))
if x not in edge:
edge[x] = [y]
else:
edge[x].append(y)
starts -= {y}
... | from sys import setrecursionlimit; setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
edge = {i:[] for i in range(1, N+1)}
starts = set(i for i in range(1, N+1))
for _ in range(M):
x, y = list(map(int, input().split()))
edge[x].append(y)
starts -= {y}
memo = [-1] * (N+1)
def rec(e)... | p03166 |
from collections import deque
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def read():
N, M = list(map(int, input().strip().split()))
E_out = [list() for i in range(N)]
E_in = [list() for i in range(N)]
for i in range(M):
x, y = list(map(int, input().strip().s... | from collections import deque
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def read():
N, M = list(map(int, input().strip().split()))
parents = [list() for i in range(N)]
n_children = [0 for i in range(N)]
for i in range(M):
x, y = list(map(int, input().strip(... | p03166 |
N, M = (int(i) for i in input().split())
outs = [[] for i in range(N)]
ins = [0] * N
for _ in range(M):
x, y = (int(i) for i in input().split())
x -= 1
y -= 1
outs[x].append(y)
ins[y] += 1
q = []
for i in range(N):
if ins[i] == 0:
q.append(i)
result = []
while q ... | N, M = (int(i) for i in input().split())
outs = [[] for i in range(N)]
ins = [0] * N
for _ in range(M):
x, y = (int(i) for i in input().split())
x -= 1
y -= 1
outs[x].append(y)
ins[y] += 1
q = []
for i in range(N):
if ins[i] == 0:
q.append(i)
result = []
while q ... | p03166 |
import sys
sys.setrecursionlimit(10 ** 9)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
G[x].append(y)
lst = [-1] * (N + 1)
def calc(x):
if lst[x] != -1:
return lst[x]
tmp = 0
for next_ ... | import sys
sys.setrecursionlimit(10 ** 9)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
G[x].append(y)
lst = [-1] * (N + 1)
def calc(x):
if lst[x] != -1:
return lst[x]
tmp = 0
for next_ ... | p03166 |
import sys
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
#dp[v]: start from v maxpath
dp = [-1 for _ in range(N)]
gragh = [[] for _ in range(N)]
for _ in range(M):
x,y = list(map(int, input().split()))
gragh[x-1].append(y-1)
#solve DAG and topological sort by recursive funci... | import sys
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
#dp[v]: start from v maxpath
dp = [-1 for _ in range(N)]
gragh = [[] for _ in range(N)]
for _ in range(M):
x,y = list(map(int, input().split()))
gragh[x-1].append(y-1)
#solve DAG and topological sort by memo recursive ... | p03166 |
""""
5 8
5 3
2 3
2 4
5 2
5 1
1 4
4 3
1 3
"""
N, M = list(map(int, input().split()))
G = []
for _ in range(M):
G.append(list(map(int, input().split())))
h = [0]*(N+1)
for eg in G:
h[eg[1]]+=1
que = []
for i in range(1, N+1):
if h[i] == 0: que.append(i)
dp = [0]*(N+1)
w... |
""""
5 8
5 3
2 3
2 4
5 2
5 1
1 4
4 3
1 3
"""
N, M = list(map(int, input().split()))
G = []
for _ in range(M):
G.append(list(map(int, input().split())))
h = [0]*(N+1)
dest = [[] for _ in range(N+1)]
for eg in G:
h[eg[1]]+=1
dest[eg[0]].append(eg[1])
que = []
for i in rang... | p03166 |
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 01/08/2020
from sys import stdin,stdout
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: lis... | # Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 01/08/2020
from sys import stdin, stdout
import sys
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia ... | p03166 |
import sys
sys.setrecursionlimit(10**7)
def f(v):
if dp[v] != 0:
return dp[v]
res = 0
for i in graph[v]:
res = max(res,f(i)+1)
dp[v] = res
return res
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input()... | import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
edge[x-1].append(y-1)
dp = [0]*N
def f(v):
if dp[v] != 0:
return dp[v]
res = 0
for i in edge[v]:
res = m... | p03166 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: G_fix
# CreatedDate: 2020-06-05 21:28:41 +0900
# LastModified: 2020-06-05 22:03:20 +0900
#
import os
import sys
from collections import deque
#import numpy as np
#import pandas as pd
def main():
n,m = list(map(int,input().split()))
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: G_fix
# CreatedDate: 2020-06-05 21:28:41 +0900
# LastModified: 2020-06-05 22:05:41 +0900
#
import os
import sys
from collections import deque
#import numpy as np
#import pandas as pd
def main():
n,m = list(map(int,input().split()))
... | p03166 |
N, M = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(M)]
from collections import defaultdict
from collections import deque
g = defaultdict(set)
for x, y in XY:
g[x].add(y)
def bfs(u):
s = deque([u])
cost = {u: 0}
done = set()
while s:
u = s.popl... | N, M = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(M)]
from collections import defaultdict
from collections import deque
from collections import Counter
g = defaultdict(set)
for x, y in XY:
g[x].add(y)
def TSort(g):
V = list(g.keys())
for v in lis... | p03166 |
import sys
from functools import lru_cache
sys.setrecursionlimit(100000)
@lru_cache(maxsize=None)
def dfs(v):
lv = links[v]
return max(dfs(u) for u in lv) + 1 if lv else 0
n, m = list(map(int, input().split()))
sss = set(range(n))
links = [set() for _ in range(n)]
for line in sys.stdin.readl... | import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
@lru_cache(maxsize=None)
def dfs(v):
lv = links[v]
return max(list(map(dfs, lv))) + 1 if lv else 0
n, m = list(map(int, input().split()))
sss = set(range(n))
links = [set() for _ in range(n)]
for line in sys.stdin.read... | p03166 |
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
@lru_cache(maxsize=None)
def dfs(v):
lv = links[v]
return max(list(map(dfs, lv))) + 1 if lv else 0
n, m = list(map(int, input().split()))
sss = set(range(n))
links = [set() for _ in range(n)]
for line in sys.stdin.read... | import sys
sys.setrecursionlimit(1000000)
def dfs(v):
if cache[v] > -1:
return cache[v]
lv = links[v]
cache[v] = ret = max(list(map(dfs, lv))) + 1 if lv else 0
return ret
n, m = list(map(int, input().split()))
sss = set(range(n))
links = [set() for _ in range(n)]
cache = [-1... | p03166 |
import sys
sys.setrecursionlimit(1000000)
def dfs(v):
if cache[v] > -1:
return cache[v]
lv = links[v]
cache[v] = ret = max(list(map(dfs, lv))) + 1 if lv else 0
return ret
n, m = list(map(int, input().split()))
sss = set(range(n))
links = [set() for _ in range(n)]
cache = [-1... | import sys
sys.setrecursionlimit(1000000)
def dfs(v):
if cache[v] > -1:
return cache[v]
lv = links[v]
cache[v] = ret = max(list(map(dfs, lv))) + 1 if lv else 0
return ret
n, m = list(map(int, input().split()))
links = [set() for _ in range(n)]
cache = [-1] * n
for line in sy... | p03166 |
n,m=list(map(int,input().split()))
h={}
st=set([i for i in range(1,n+1)])
kos=set()
for _ in range(m):
oy,ko=list(map(int,input().split()))
h.setdefault(oy,[])
h[oy]+=[ko]
kos.add(ko)
st=st-kos
dep=0
while 1:
nst=set()
for s in st:
if s not in h:continue
for ko in ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
def get_kyori(i):
if kos[i] == []:
kyori[i] = 0
return 0
if kyori[i] > -1:
return kyori[i]
re = 0
for ko in kos[i]:
new = get_kyori(ko) + 1
if re < new:
re = new
... | p03166 |
from collections import deque
def main():
n, adj = getInputs()
# maxDistance[start]
maxDistance = [0] * n
overallMaxDistance = 0
calculated = [0] * n
for v in getVertexSequence(n, adj):
# distance[dest] (starting at v)
distance = [0] * n
currMaxDistance ... | def main():
n, adj = getInputs()
sequence = getTopologicalSort(n, adj)
distance = [-1] * n
longest = -1
for v in sequence:
if len(adj[v]) == 0:
distance[v] = 0
else:
for dest in adj[v]:
distance[v] = max(distance[v], 1 + distance[... | p03166 |
from collections import deque
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x)-1 for x in input().split()]
G[x].append(y)
counts = [-1] * n
while -1 in counts:
start = counts.index(-1)
q = deque([[start, 0]])
while q:
i, l = q... | import sys
sys.setrecursionlimit(500000)
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x)-1 for x in input().split()]
G[x].append(y)
# iを始点としたときの有効パスの最大長さ
dp = [-1] * n
def rec(s):
if dp[s] != -1:
return dp[s]
ret = 0
for... | p03166 |
def bell(edges, n):
dist = [0 for i in range(n)]
changed = True
while changed:
changed = False
for edge in edges:
if dist[edge[1]] < dist[edge[0]] + 1:
changed = True
dist[edge[1]] = max(dist[edge[0]] + 1, dist[edge[1]])
... | import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(m):
x, y = list(map(int, input().split()))
edges[x].append(y)
dp = [-1 for _ in range(n+1)]
def longest_path(u):
if dp[u] != -1:
return dp[u]
d = ... | p03166 |
# input
N, M = list(map(int, input().split()))
cost = [[float('inf')] * N for i in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
cost[x - 1][y - 1] = -1
for i in range(N):
for j in range(N):
for k in range(N):
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
an... | # input
N, M = list(map(int, input().split()))
edges = []
for i in range(M):
edges.append(list(map(int, input().split())))
# DP
cost = [[float(0)] * N for i in range(N)]
for e in edges:
e[0] -= 1
e[1] -= 1
cost[e[0]][e[1]] = 1
for e in edges:
for i in range(N):
if cost[i][e[0]] > 0: # i... | p03166 |
import sys
N, M = list(map(int, input().split()))
graph = [dict() for _ in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
graph[x - 1][y - 1] = 1
dp = [0 for _ in range(N)]
sys.setrecursionlimit(10 ** 9)
def dfs(num_v):
if len(graph[num_v]) == 0:
return
... | import sys
sys.setrecursionlimit(10 ** 8)
N, M = list(map(int, input().split()))
graph = [dict() for _ in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
graph[y - 1][x - 1] = 1
dp = [0 for _ in range(N)]
def dfs(u):
if dp[u] != 0:
return dp[u]
max_dis ... | p03166 |
import sys
sys.setrecursionlimit(10 ** 8)
N, M = list(map(int, input().split()))
graph = [dict() for _ in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
graph[y - 1][x - 1] = 1
dp = [0 for _ in range(N)]
def dfs(u):
if dp[u] != 0:
return dp[u]
max_dis ... | import sys
sys.setrecursionlimit(10 ** 8)
N, M = list(map(int, input().split()))
graph = [dict() for _ in range(N)]
for i in range(M):
x, y = list(map(int, input().split()))
graph[y - 1][x - 1] = 1
dp = [0 for _ in range(N)]
def dfs(u):
if dp[u] != 0 or len(graph[u]) == 0:
retu... | p03166 |
N, M = list(map(int, input().split()))
childs = [[] for _ in range(N)]
for i in range(M):
p, c = list(map(int, input().split()))
childs[p-1].append(c)
stack = list(range(1, N+1))
# dp[n]: nに到達する最長のパス
dp = [0] * N
while stack:
n = stack.pop()
for nc in childs[n-1]:
if dp[nc-1] < dp[n... | import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
childs = [[] for _ in range(N)]
for i in range(M):
p, c = list(map(int, input().split()))
childs[p-1].append(c-1)
depth = [-1] * N
def dfs(n):
if depth[n] != -1:
return depth[n]
if childs[n]:
... | p03166 |
import sys
sys.setrecursionlimit(10**9)
n , m = list(map(int,input().split()))
g = [[] for i in range(n)]
for _ in range(m):
v1 , v2 = list(map(int,input().split()))
v1 -=1; v2 -=1
g[v1].append(v2)
# finding longest path for vertice i
def dfs(i):
temp = 0
for nv in g[i]:
temp = max... | import sys
sys.setrecursionlimit(10**9)
n , m = list(map(int,input().split()))
g = [[] for i in range(n)]
dp = [-1] *n
for _ in range(m):
v1 , v2 = list(map(int,input().split()))
v1 -=1; v2 -=1
g[v1].append(v2)
# finding longest path for vertice i
def dfs(i):
if dp[i]!=-1:
return dp[... | p03166 |
import sys
sys.setrecursionlimit(10**9)
def dfs(i):
if distance[i] != -1:
return distance[i]
ans = 0
for node in graph[i]:
ans = max(ans, dfs(node) + 1)
return ans
n, m = list(map(int, input().split()))
graph = [[] for i in range(n)]
distance = [-1 for i in range(n)]
... |
import sys
sys.setrecursionlimit(10**9)
def dfs(i):
if distance[i] != -1:
return distance[i]
ans = 0
for node in graph[i]:
ans = max(ans, dfs(node) + 1)
distance[i] = ans
return ans
n, m = list(map(int, input().split()))
graph = [[] for i in range(n)]
distance = [... | p03166 |
# -*- coding: utf-8 -*-
"""
Created on Sun Jul 26 14:22:54 2020
@author: Maruthi Srinivas
"""
import sys
sys.setrecursionlimit(1000000)
def dfs(node,graph,dp):
temp=0
if dp[node]!=-1:
return dp[node]
for i in graph[node]:
temp=max(temp,dfs(i,graph,dp)+1)
dp[node]=temp
... | # -*- coding: utf-8 -*-
"""
Created on Sun Jul 26 14:22:54 2020
@author: Maruthi Srinivas
"""
import sys
sys.setrecursionlimit(1000000)
def dfs(node,graph,dp):
temp=0
if dp[node]!=-1:
return dp[node]
for i in graph[node]:
temp=max(temp,dfs(i,graph,dp)+1)
dp[node]=temp
... | p03166 |
from bisect import bisect_left as bl, bisect_right as br, insort
import sys
import heapq
#from math import *
from collections import defaultdict as dd, deque
def data(): return sys.stdin.buffer.readline().strip().decode()
def mdata(): return list(map(int, data().split()))
out=sys.stdout.write
#sys.setrecursionl... | from bisect import bisect_left as bl, bisect_right as br, insort
import sys
import heapq
#from math import *
from collections import defaultdict as dd, deque
def data(): return sys.stdin.buffer.readline().strip().decode()
def mdata(): return list(map(int, data().split()))
out=sys.stdout.write
#sys.setrecursionl... | p03166 |
import sys
sys.setrecursionlimit(20000)
def getMax(d,n,c):
global bs
if len(d[n])==0:
bs=max(bs,c)
for k in d[n]:
getMax(d,k,c+1)
n,m=list(map(int,input().split()))
d={}
for j in range(1,n+1):
d[j]=[]
for i in range(m):
a,b=list(map(int,input().split()))
d[a].ap... | import sys
sys.setrecursionlimit(20000)
def getMax(d, n):
if len(d[n]) == 0:
return 0
if not dp[n] == -1:
return dp[n]
for k in d[n]:
dp[n] = max(dp[n], 1 + getMax(d, k))
return dp[n]
n, m = list(map(int, input().split()))
d = {}
dp = [-1 for _ in ra... | p03166 |
import sys
sys.setrecursionlimit(10**9)
def f(x):#dpは
if dp[x]!=-1:
return dp[x]#すでに値が決まっていたらそれをかえす
ans=0
for e in d[x]:#すべての枝について
ans=max(ans,1+f(e))
dp[x]=ans
return ans
n,m = list(map(int, input().split()))
d={}
dp=[-1]
for i in range(1,n+1):
d[i]=[]#dは初期値を... | import sys
sys.setrecursionlimit(10**9)
def dfs(x): #グラフでの再帰DFS
if dp[x] != -1:
return dp[x] #すでに値が決まっていたらそれをかえす
ans = 0
for e in graph[x]: #すべての枝について
ans = max(ans,1 + dfs(e))
dp[x] = ans
return ans # 最も長い距離を返す
n,m = list(map(int, input().split()))
graph = [[] for ... | p03166 |
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
# 各頂点の次数
deg = [0 for _ in range(n)]
# グラフ
edge = [[] for _ in range(n)]
for _ in range(m):
a, b = list(m... | import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
# 各頂点の次数
deg = [0 for _ in range(n)]
# グラフ
edge = [[] for _ in range(n)]
for _ in range(m):
a, b = list... | p03166 |
n, m = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(m)]
dp = [[0,0] for _ in range(n+1)]
check = True
while(check):
check = False
for i in range(m):
x, y =xy[i]
if(dp[x][1] < dp[y][1]+1):
dp[x][1] = dp[y][1]+1
check ... | from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
xy_dict = {}
for i in range(1,n+1):
xy_dict[i] = []
for i in range(m):
x,y = list(map(int, input().split()))
xy_dict[x].append(y)
dp = [-1]*(n+1)
dp[0] = 0
def get_longest(x):
global... | p03166 |
#!/usr/bin/env python
import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)
def get_longest(x, longest, edges):
if longest[x] is no... | #!/usr/bin/env python
import sys
import re
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor
sys.setrecursionlimit(1000000)
def get_longest(x, longest, edges):
if longest[x] is no... | p03166 |
import sys
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
g=[[] for i in range(n)]
for i in range(m):
v1,v2=list(map(int,input().split()))
v1-=1;v2-=1
g[v1].append(v2)
def dfs(i):
temp=0
for nv in g[i]:
temp=max(temp,dfs(nv)+1)
return temp
res=0
for i i... | import sys
sys.setrecursionlimit(10**9)
n,m=list(map(int,input().split()))
g=[[] for i in range(n)]
for i in range(m):
v1,v2=list(map(int,input().split()))
v1-=1;v2-=1
g[v1].append(v2)
dp=[-1]*n
def dfs(i):
if dp[i]!=-1:
return dp[i]
temp=0
for nv in g[i]:
temp=max(temp,dfs... | p03166 |
from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
memo = [[0] * N for _ in range(N)] #矢印が入ってきている数字を-1でフラグ立てる
dp = [0] * N
for _ in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
G[x].append((x, y))
memo[y][x] = 1
q = deque... | from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
# memo = [[0] * N for _ in range(N)] #矢印が入ってきている数字を-1でフラグ立てる
dp = [0] * N
for _ in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
G[x].append((x, y))
# memo[y][x] = 1
q = d... | p03166 |
import sys
sys.setrecursionlimit(10**9)
n , m = list(map(int,input().split()))
g = [[] for i in range(n+1)]
dp = [-1] * (n+1)
for _ in range(m):
v1 , v2 = list(map(int,input().split()))
g[v1].append(v2)
# finding longest path for vertice i
def dfs(i):
if dp[i]!=-1:
return dp... | import sys
N, M = list(map(int, input().split()))
sys.setrecursionlimit(10**9)
vertices = [[] for i in range(N+1)]
dp = [-1] * (N+1)
for _ in range(M):
fro, to = list(map(int, input().split()))
vertices[fro].append(to)
def dfs(i):
if dp[i] != -1:
return dp[i]
temp ... | p03166 |
N,M = list(map(int,input().split()))
XY = []
for i in range(M):
xy = list(map(int,input().split()))
XY.append(xy)
p = [i+1 for i in range(N)]
ans = []
stack = []
alr = []
xy1 = []
for xy in XY:
xy1.append(xy[1])
for i in range(1,N+1):
if i not in xy1:
stack.append(i)
alr.a... | import sys
sys.setrecursionlimit(10**5+10)
input = sys.stdin.readline
N,M = list(map(int,input().split()))
XY = [[] for m in range(N)]
for l in range(M):
x,y = list(map(int,input().split()))
XY[x-1].append(y-1)
dp = [-1 for k in range(N)]
def search(i):
if dp[i] != -1:
return dp[i]
... | p03166 |
import collections
import sys
sys.setrecursionlimit(10000000)
N,M = list(map(int,input().split()))
A = [list(map(int, input().split())) for i in range(M)]
visit = set()
G = collections.defaultdict(set)
for idx,(f,to) in enumerate(A):
G[f].add(to)
cache = {}
def dfs(start):
if start in cache... | import collections
import sys
sys.setrecursionlimit(10000000)
N,M = list(map(int,input().split()))
A = [list(map(int, input().split())) for i in range(M)]
visit = set()
G = collections.defaultdict(set)
for idx,(f,to) in enumerate(A):
G[f].add(to)
cache = {}
def dfs(start):
if start in cache... | p03166 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
inf = float('inf')
def rec(v):
if used[v]:
return dp[v]
used[v] = True
res = 0
for u in es[v]:
res = max(res, rec(u) + 1)
dp[v] = res
return res
n, m = list(map(int, input().split()))
... | import sys
sys.setrecursionlimit(10 ** 7)
def dfs(v):
if d[v] != -1:
return d[v]
res = -1
for u in e[v]:
res = max(res, dfs(u))
res += 1
d[v] = res
return res
n, m = list(map(int, input().split()))
e = tuple(set() for _ in range(n))
for _ in range(m):
... | p03166 |
def main():
from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 7)
readline = sys.stdin.readline
@lru_cache(maxsize=None)
def dfs(v, par=-1):
"""最長有向パスに含まれる頂点数"""
ret = 0
for u in g[v]:
if u == par: continue
ret = ma... | def main():
import sys
sys.setrecursionlimit(10 ** 7)
readline = sys.stdin.readline
def dfs(v):
"""最長有向パスに含まれる頂点数"""
if memo[v] != -1:
return memo[v]
ret = 0
for u in g[v]:
ret = max(ret, dfs(u))
ret += 1 # 自身
memo[... | p03166 |
#!/mnt/c/Users/moiki/bash/env/bin/python
N,M = list(map(int, input().split()))
g = [ list([int(x)-1 for x in input().split()]) for _ in range(M) ]
from collections import Counter, defaultdict
childs = Counter( x[1] for x in g)
childs_list = defaultdict(list)
for x,y in g:
childs_list[x].append(y)
root... | #!/mnt/c/Users/moiki/bash/env/bin/python
N,M = list(map(int, input().split()))
g = [ list([int(x)-1 for x in input().split()]) for _ in range(M) ]
from collections import Counter, defaultdict
childs = Counter( x[1] for x in g)
childs_list = defaultdict(list)
for x,y in g:
childs_list[x].append(y)
root... | p03166 |
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
def geta(fn=lambda s: s.decode()):
return list(map(fn, readline().split()))
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
N, M = geta(int)
... | import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
def geta(fn=lambda s: s.decode()):
return list(map(fn, readline().split()))
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
N, M = geta(int)
... | p03166 |
from collections import deque
N,M = list(map(int, input().split()))
edge=[[] for j in range(N+1)]
x = [0] * M
y = [0] * M
#N,M=4,5
#x=[1, 1, 3, 2, 3]
#y=[2, 3, 2, 4, 4]
#edge=[[], [2, 3], [4], [2, 4], []]
for i in range(M):
x[i], y[i] = list(map(int, input().split()))
edge[x[i]].append(y[i])
... | import sys
sys.setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for i in range(M):
x, y = list(map(int, input().split()))
G[x] += [y]
# print(G)
dp = [-1] * (N + 1)
def func(n):
if dp[n] != -1:
return dp[n]
cnt = 0
# 先... | p03166 |
#DAGの最長有向パスをトポロジカルソートで解く
from collections import defaultdict
N,M=list(map(int,input().split(' ')))
se=set()
d=defaultdict(int)
for i in range(M):
x,y=list(map(int,input().split(' ')))
se.add(x*(10**5)+y)
n=set(i for i in range(1,N+1))
while N>0:
m=set([x%10**5 for x in se])
for i in n-m:
... | from collections import defaultdict, deque
N, M = list(map(int, input().split()))
es = [[int(x) for x in input().split()] for _ in range(M)]
outs = defaultdict(list)
ins = defaultdict(int)
for v1, v2 in es:
outs[v1].append(v2)
ins[v2] += 1
length=defaultdict(int)
q = deque(set(i for i in range(1,... | p03166 |
#DAGの最長有向パスをトポロジカルソートで解く
from collections import defaultdict
N,M=list(map(int,input().split(' ')))
se=set()
d=defaultdict(int)
for i in range(M):
x,y=list(map(int,input().split(' ')))
se.add(x*(10**5)+y)
n=set(i for i in range(1,N+1))
while N>0:
m=set([x%10**5 for x in se])
for i in n-m:
... | from collections import defaultdict
n,m=list(map(int,input().split(' ')))
paths=defaultdict(list)
ins=[0]*(n+1)
for _ in range(m):
x,y=list(map(int,input().split(' ')))
paths[x].append(y)
ins[y]+=1
no_in=[y for y in range(1,n+1) if ins[y]==0]
depth=[0]*(n+1)
while no_in:
x=no_in.pop()
... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x) for x in input().split()]
g[x - 1].append(y - 1)
memo = [-1]*n
def dp(v):
if memo[v] >= 0:
return memo[v]
els... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x) for x in input().split()]
g[x - 1].append(y - 1)
memo = [-1]*n
def dp(v):
if memo[v] >= 0:
return memo[v]
els... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x) for x in input().split()]
g[x - 1].append(y - 1)
memo = [-1]*n
def dp(v):
if memo[v] >= 0:
return memo[v]
els... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = [int(x) for x in input().split()]
g = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x) for x in input().split()]
g[x - 1].append(y - 1)
memo = [0]*n
visited = [False]*n
def dp(v):
if visited[v]:
retur... | p03166 |
import copy
N,M = list(map(int, input().split()))
t_table = {}
for i in range(M):
x,y = list(map(int, input().split()))
if x-1 in t_table: t_table[x-1].append(y-1)
else: t_table[x-1] = [y-1]
ans = 0
dp = [1 for _ in range(N)]
zerolist = [0 for _ in range(N)]
while True:
pnode = copy.copy(dp)
dp = [0 fo... | import sys
sys.setrecursionlimit(10**5+10)
input = sys.stdin.readline
N,M = list(map(int, input().split()))
lst_edge = [[] for _ in range(N)]
for _ in range(M):
x,y = list(map(int, input().split()))
lst_edge[x-1].append(y-1)
dp = [-1] * N
def rec(v):
if dp[v] != -1:
return dp[v]
ans = 0
lst_... | p03166 |
import sys
sys.setrecursionlimit(10**9)
n,m = list(map(int,input().split()))
graph = [[] for _ in range(n)]
for i in range(m):
x,y = list(map(int,input().split()))
graph[x-1].append(y-1)
dp = [0]*(n)
done = []
def dfs(i):
if i in done:
done.pop()
if dp[i] < len(done):dp[i] = len(do... | import sys
sys.setrecursionlimit(10**9)
n,m = list(map(int,input().split()))
graph = [[] for _ in range(n)]
for i in range(m):
x,y = list(map(int,input().split()))
graph[x-1].append(y-1)
dp = [-1]*(n)
def dfs(i):
if dp[i] != -1:
return dp[i]
else:
res = 0
for j in gra... | p03166 |
import sys
input = sys.stdin.buffer.readline
from collections import deque
def main():
N,M = list(map(int,input().split()))
edge = [[] for _ in range(N)]
begin = [True for _ in range(N)]
for _ in range(M):
x,y = list(map(int,input().split()))
edge[x-1].append(y-1)
... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 9)
def main():
N,M = list(map(int,input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
x,y = list(map(int,input().split()))
edge[x-1].append(y-1)
dist = [-1 for _ in range(N)... | p03166 |
# https://atcoder.jp/contests/dp/tasks/dp_g
import sys
sys.setrecursionlimit(10**7)
class DAG:
def __init__(self, n):
# n: num of vertices
self.n = n
self.adj = [[] for _ in range(n)]
def addEdge(self, parent, child):
self.adj[parent].append(child)
def dfs(s... | # https://atcoder.jp/contests/dp/tasks/dp_g
import sys
sys.setrecursionlimit(10**7)
class DAG:
def __init__(self, n):
# n: num of vertices
self.n = n
self.adj = [[] for _ in range(n)]
def addEdge(self, parent, child):
self.adj[parent].append(child)
def dfs(s... | p03166 |
import sys
from functools import lru_cache
sys.setrecursionlimit(524287)
n,m,*l = list(map(int,open(0).read().split()))
pas = [[] for _ in range(n)]
for x,y in zip(l[::2],l[1::2]):
pas[x-1].append(y-1)
INF = float("inf")
done = [-INF]*n
@lru_cache(maxsize = None)
def dfs(t):
if done[t] >= 0:
pass
... | import sys
sys.setrecursionlimit(524287)
n,m,*l = list(map(int,open(0).read().split()))
pas = [[] for _ in range(n)]
for x,y in zip(l[::2],l[1::2]):
pas[x-1].append(y-1)
INF = float("inf")
done = [-INF]*n
def dfs(t):
if done[t] >= 0:
pass
elif pas[t]:
done[t] = max(dfs(s) for s in pas[t]) + 1
... | p03166 |
from collections import deque
def bfs(vertices, start):
q = deque()
q.append(start)
while q:
u = q.popleft()
for v in vertices[u]:
if vis[v]==0 or (vis[u]+1>vis[v]) :
vis[v]=vis[u]+1
q.append(v)
return ... | import sys
input=sys.stdin.readline
#for _ in range(int(input())):
# n=int(input())
# n,m=map(int,input().split())
# s=input().strip()
sys.setrecursionlimit(10**9)
def dfs(i):
if dp[i]!=-1:return dp[i]
c=0
for j in v[i]:c=max(c,dfs(j)+1)
dp[i]=c
return c
n,m=list(map(int,input().split()))
v=[[] for... | p03166 |
import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
a,b = list(map(int, input().split()))
edge[a-1].append(b-1)
dpv = [-1]*N
def dp(v):
if dpv[v] != -1:
return dpv[v]
if len(edge[v])==0:
dpv[v]=0
... | import sys
sys.setrecursionlimit(10**8)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
a,b = list(map(int, input().split()))
edge[a-1].append(b-1)
def dfs(v):
if len(edge[v])==0:
return 0
ans = 0
for u in edge[v]:
if longest[u]==-1:
longe... | p03166 |
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
to = [False]*N
for i in range(M):
a,b = list(map(int, input().split()))
edge[a-1].append(b-1)
to[b-1] = True
import sys
sys.setrecursionlimit(10**8)
def dfs(v):
if lis[v]>=0:
return lis[v]
if len(edge[v])==0:
lis[v] ... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
a,b = list(map(int, input().split()))
edge[a-1].append(b-1)
def dfs(start):
stack = [start]
while stack:
v = stack[-1]
marker = 0
path_l[v] = 0
for u in ... | p03166 |
from collections import defaultdict, deque
v, n = list(map(int, input().split()))
es = [[int(x) for x in input().split()] for _ in range(n)]
outs = defaultdict(list)
ins = defaultdict(int)
#print(ins)
for v1, v2 in es:
outs[v1].append(v2)
ins[v2] += 1
#print(ins)
#print("be",ins)
q = deque(v1... | """memo
トポロジカルソート「http://zehnpaard.hatenablog.com/entry/2018/06/26/201512」
をしてから，dpで求めた．（ソートと同時にdp求められそう）
"""
from collections import deque, defaultdict
import sys
input == sys.stdin.readline
def main():
v, n = list(map(int, input().split()))
es = [[int(x) for x in input().split()] for _ in r... | p03166 |
import sys
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
edge = [[] for _ in range(n)]
for _ in range(m):
x, y = list(map(int, input().split()))
edge[x-1].append(y-1)
dp = [-1]*n
def calc(x):
if dp[x] != -1:
return dp[x]
if not len(edge[x]):
dp[x... | import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
edge[x-1].append(y-1)
dp = [-1]*N
def calc(x):
if dp[x]!=-1:
return dp[x]
if not len(edge[x]):
dp[x] = 0
... | p03166 |
import collections
N,M = list(map(int,input().split()))
road = [[] for i in range(N+1)]
rev_road = [[] for i in range(N+1)]
for _ in range(M):
x,y=list(map(int,input().split()))
road[x].append(y)
rev_road[y].append(x)
dep = []
for i in range(1,N+1):
if len(rev_road[i]) == 0:
dep.app... | import sys
sys.setrecursionlimit(10**9)
N,M = list(map(int,input().split()))
road = [[] for _ in range(N+1)]
for _ in range(M):
x,y=list(map(int,input().split()))
road[x].append(y)
flag = [0]*(N+1)
dist = [0]*(N+1)
def distance(i):#地点iから終点までの最長距離
if flag[i] == 1:
return dist[i]
... | p03166 |
import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
N,M=list(map(int,input().split()))
edge=[[] for _ in range(N)]
s=set(range(N))
for _ in range(M):
x,y=[int(x)-1 for x in input()... | import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
N,M=list(map(int,input().split()))
edge=[[] for _ in range(N)]
s=set(range(N))
for _ in range(M):
x,y=[int(x)-1 for x in input().split()]
edge[x].appe... | p03166 |
from sys import stdin, setrecursionlimit
# input = stdin.readline
setrecursionlimit(200000)
N, M = list(map(int, input().split()))
# d = [0] * (N + 1)
adj = [[] for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
# d[y] += 1
dp = [-1] * (N + 1)
... | from sys import stdin, setrecursionlimit
input = stdin.readline
setrecursionlimit(200000)
N, M = list(map(int, input().split()))
# d = [0] * (N + 1)
adj = [[] for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
# d[y] += 1
dp = [-1] * (N + 1)
de... | p03166 |
from sys import stdin, setrecursionlimit
from collections import defaultdict
input = stdin.readline
setrecursionlimit(200000)
N, M = list(map(int, input().split()))
# d = [0] * (N + 1)
adj = defaultdict(list)
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
# d[y] += 1
... | """
https://atcoder.jp/contests/dp/tasks/dp_g
Using list to store adjacent list is faster than using sets.
Maybe it is because the append operation of list in python is faster than add operation of sets.
Using defaultdict instead of list to store adj is faster. Maybe it is because in case the graph is
sparse, ... | p03166 |
import sys
sys.setrecursionlimit(10**8)
N, M = list(map(int, input().split()))
G = dict([[i, []] for i in range(N)])
for _ in range(M):
x, y = list(map(int, input().split()))
G[x-1].append(y-1)
dp = [-1] * N
def rec(v):
if dp[v] >= 0:
return dp[v]
if len(G[v]) == 0:
ret... | import sys
sys.setrecursionlimit(10**8)
N, M = list(map(int, input().split()))
G = dict([[i, []] for i in range(N)])
for _ in range(M):
x, y = list(map(int, input().split()))
G[x-1].append(y-1)
dp = [-1] * N
def rec(v):
if dp[v] >= 0:
return dp[v]
if len(G[v]) == 0:
ret... | p03166 |
from collections import deque
def main():
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n+1)]
for _ in range(m):
src, dst = list(map(int, input().split()))
graph[dst].append(src)
dist = [0] * (n+1)
for node in range(1, n+1):
visited = [False] ... | from collections import deque
def main():
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n+1)]
parents = [0] * (n+1)
for _ in range(m):
src, dst = list(map(int, input().split()))
graph[src].append(dst)
parents[dst] += 1
q = deque()
for i i... | p03166 |
### 動的計画法のテーブルを用意
# dp(n) は頂点nを始点として時の最大有効パスの長さ
def get_inputs():
N, M = list(map(int, input().split()))
# グラフgを初期化
g = [[] for _ in range(N)]
# 辺情報を読み込みgに追加
for _ in range(M):
x, y = [int(c) - 1 for c in input().split()]
g[x].append(y)
return N, M, g
def g... | import sys
sys.setrecursionlimit(10**5)
def get_inputs():
N, M = list(map(int, input().split()))
# グラフgを初期化
g = [[] for _ in range(N)]
# 辺情報を読み込みgに追加
for _ in range(M):
x, y = [int(c) - 1 for c in input().split()]
g[x].append(y)
return N, M, g
d... | p03166 |
import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | p03166 |
import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | p03166 |
import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | p03166 |
import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | import sys
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j... | p03166 |
def solve():
n, list_of_xy = read()
result = think(n, list_of_xy)
write(result)
def read():
n, m = read_int(2)
list_of_xy = []
for i in range(m):
list_of_xy.append(read_int(2))
return n, list_of_xy
def read_int(n):
return list([int(x) for x in read_line().split... | import sys
def solve():
n, list_of_xy = read()
result = think(n, list_of_xy)
write(result)
def read():
n, m = read_int(2)
list_of_xy = []
for i in range(m):
list_of_xy.append(read_int(2))
return n, list_of_xy
def read_int(n):
return list([int(x) for x in rea... | p03166 |
import sys
import collections
from functools import lru_cache
xy = []
d = collections.defaultdict(list)
@lru_cache(maxsize=None)
def alg_memoization_recursion(f):
mt = 0
for v in d[f]:
mt = max(mt, alg_memoization_recursion(v) + 1)
return mt
def solve():
readline = sys.stdin.bu... | import sys
import collections
from functools import lru_cache
sys.setrecursionlimit(10 ** 7 + 1)
xy = []
d = collections.defaultdict(list)
@lru_cache(maxsize=None)
def alg_memoization_recursion(f):
mt = 0
for v in d[f]:
mt = max(mt, alg_memoization_recursion(v) + 1)
return mt
def... | p03166 |
import sys
sys.setrecursionlimit(10 ** 5 + 5)
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
N, M = list(map(int, input().split()))
x, y = [0] * M, [0] * M
from_x = [[] for _ in range(N)]
memo = [-1] * N
ans = 0
def length(i):
if memo[i] >= 0:... | import sys
input = sys.stdin.readline
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
N, M = list(map(int, input().split()))
to_y = [[] for _ in range(N)]
deg = [0] * N
stack = []
dp = [0] * N
for _ in range(M):
x, y = list(map(int, input().split()))
to_y[x - 1].append(... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(m):
x, y = list([int(x)-1 for x in input().split()])
edges[x].append(y)
def memoize(f):
memo = dict()
def memoized(*args):
if a... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(m):
x, y = list([int(x)-1 for x in input().split()])
edges[x].append(y)
dist = [-1]*n
def longest_path(v):
if dist[v] != -1:
return... | p03166 |
from collections import deque, defaultdict
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
edges = [[]for _ in range(n)]
dd = defaultdict(int)
for _ in range(m):
x, y = list([int(x)-1 for x in input().split()])
edges[x].append(y)
dd[y] += 1
queue = deque([])
for i i... | from collections import deque
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
edges = [[]for _ in range(n)]
dinp = [0]*n
for _ in range(m):
x, y = list([int(x)-1 for x in input().split()])
edges[x].append(y)
dinp[y] += 1
queue = deque([])
for i in range(n):
if ... | p03166 |
from collections import deque
n, m = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(m)]
tree = [[] for i in range(n)]
for i in range(m):
a, b = info[i]
a -= 1
b -= 1
tree[a].append(b)
set_ = set([])
for i in range(n):
for j in tree[i]:
... | import sys
sys.setrecursionlimit(10**6)
n, m = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(m)]
tree = [[] for i in range(n)]
for i in range(m):
a, b = info[i]
a -= 1
b -= 1
tree[a].append(b)
set_ = set([])
for i in range(n):
for j in tre... | p03166 |
def dfs(num,count,ans):
#print(num,count)
ans=max(ans,count)
for index,item in enumerate(l[num-1]):
if item==1:
dp[index+1]=max(dp[index+1],count)
ans=dfs(index+1,count+1,ans)
return ans
N,M=list(map(int,input().split()))
l=[[0]*N for _ in range(N)]
st... | # coding: utf-8
# Your code here!
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
N,M=list(map(int,input().split()))
linked=[[] for i in range(N)]
for _ in range(M):
x,y=list(map(int,input().split()))
linked[x-1].append(y-1)
def saiki(num):
if visited[num]==1:
ret... | p03166 |
import sys
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache
sys.setrecursionlimit(10**6)
@lru_cache(maxsize=None)
def rec(v):
res=0
for nv in graph[v]:
res=max(res,rec(nv)+1)
return res
def main():
n,m=list(map(int,input().split()))
XY=[tuple(map(... | import sys
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache
sys.setrecursionlimit(10**6)
@lru_cache(maxsize=None)
def rec(v):
res=0
for nv in graph[v]:
res=max(res,rec(nv)+1)
return res
def main():
n,m=list(map(int,input().split()))
XY=[tuple(map(... | p03166 |
import sys
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache
sys.setrecursionlimit(10**6)
@lru_cache(maxsize=None)
def rec(v):
res=0
for nv in graph[v]:
res=max(res,rec(nv)+1)
return res
def main():
n,m=list(map(int,input().split()))
XY=[tuple(map(... | import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
def rec(v):
if dp[v]!=-1:return dp[v]
res=0
for nv in graph[v]:
res=max(res,rec(nv)+1)
dp[v]=res
return res
def main():
n,m=list(map(int,input().split()))
XY=[tuple(map(int,input().s... | p03166 |
from collections import deque
def main():
n, adj = getInputs()
# maxDistance[start]
maxDistance = [0] * n
calculated = set()
for v in getVertexSequence(n, adj):
# distance[dest] (starting at v)
distance = [0] * n
toVisit = deque([v])
while len(toVi... | import sys
sys.setrecursionlimit(1000000)
def main():
n, m = [int(x) for x in input().split()]
global dp
dp = [-1]*n
grafo = [[] for _ in range(n)]
for _ in range(m):
x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
grafo[x].append(y)
resp ... | p03166 |
import sys
input=sys.stdin.readline
def longest_path(s):
global dp
if adj[s]:
dp[s-1]=max((longest_path(t)+1)for t in adj[s])
else:
dp[s-1]=0
return dp[s-1]
N,M=list(map(int,input().split()))
edge=[]
for _ in range(M):
edge.append(list(map(int,input().split())))
ad... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)
def longest_path(s):
global dp
if dp[s-1]<1:
if edge[s]:
dp[s-1]=max((longest_path(t)+1)for t in edge[s])
else:
dp[s-1]=0
return dp[s-1]
N,M=list(map(int,input().split()))
edge={}
for i ... | p03166 |
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | p03166 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_... | #トポロジカルソートなるもの
#再帰で書いてるところをwhileで書いてる
#要は無駄な探索(再帰呼び出し)を無くしてる
#まぁ思いつかない
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#... | p03166 |
from collections import deque
def main():
n, adj = getInputs()
# maxDistance[start]
maxDistance = [0] * n
overallMaxDistance = 0
calculated = [0] * n
for v in range(n):
# distance[dest] (starting at v)
distance = [0] * n
currMaxDistance = 0
to... | def main():
n, adj = getInputs()
sequence = getTopologicalSort(n, adj)
distance = [-1] * n
longest = -1
for v in sequence:
if len(adj[v]) == 0:
distance[v] = 0
else:
for dest in adj[v]:
distance[v] = max(distance[v], 1 + distance[... | p03166 |
# coding: utf-8
# Your code here!
from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
n,m = [int(i) for i in input().split()]
#ko = [[] for _ in range(n)]
oya = [[] for _ in range(n)]
for _ in range(m):
x,y = [int(i)-1 for i in input().split()]
# ko[x].append(y)
oya[y].appe... | # coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
n,m = [int(i) for i in input().split()]
#ko = [[] for _ in range(n)]
oya = [[] for _ in range(n)]
for _ in range(m):
x,y = [int(i)-1 for i in input().split()]
# ko[x].append(y)
oya[y].append(x)
memo = [-1]*n
def lon... | p03166 |
import collections
N,M = list(map(int,input().split()))
L = [[False for j in range(N)] for i in range(N)]
for i in range(M) :
a,b = list(map(int,input().split()))
a -= 1
b -= 1
L[a][b] = True
dp = [0 for i in range(N)]
for i in range(N) :
q = collections.deque()
q.append(i)
... | N,M = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(M)]
L_minus = [[] for i in range(N)]
L_plus = [0 for i in range(N)]
dp = [0 for i in range(N)]
for i in range(M) :
x,y = L[i]
x -= 1
y -= 1
L_plus[y] += 1
L_minus[x].append(y)
A = []
for i i... | p03166 |
from collections import deque
n,m = list(map(int,input().split()))
g = [[] for i in range(n)]
h = [[] for i in range(n)]
for i in range(m):
x,y = list(map(int,input().split()))
x-=1;y-=1
g[x].append(y)
h[y].append(x)
hukasa = [0]*n
MIN = float("inf")
for i in range(n):
MIN = min(MIN,len(h[i]))
de... | import heapq
from collections import deque
n,m = list(map(int,input().split()))
g = [[] for i in range(n)]
h = [[] for i in range(n)]
for i in range(m):
x,y = list(map(int,input().split()))
x-=1;y-=1
g[x].append(y)
h[y].append(x)
hukasa = [0]*n
MIN = float("inf")
for i in range(n):
MIN = min(MIN,... | p03166 |
import heapq
from collections import deque
n,m = list(map(int,input().split()))
g = [[] for i in range(n)]
h = [[] for i in range(n)]
for i in range(m):
x,y = list(map(int,input().split()))
x-=1;y-=1
g[x].append(y)
h[y].append(x)
hukasa = [0]*n
MIN = float("inf")
for i in range(n):
MIN = min(MIN,... | from collections import deque
n,m = list(map(int,input().split()))
g = [[] for i in range(n)]
h = [[] for i in range(n)]
for i in range(m):
x,y = list(map(int,input().split()))
x-=1;y-=1
g[x].append(y)
h[y].append(x)
topo = []
hukasa = [0] * n
hairu = [0]*n
que = deque([])
for i in range(n):
hai... | p03166 |
import sys
from collections import deque
stdin = sys.stdin
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def naa(N): return [na() for _ in range(N)]
def ns(): return stdin.readline().rstrip() # ignore trailing spaces
N, M = na()
node_dic = {}
no_in ... | import sys
from collections import deque
sys.setrecursionlimit(10**8)
stdin = sys.stdin
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def naa(N): return [na() for _ in range(N)]
def ns(): return stdin.readline().rstrip() # ignore trailing spaces
def ca... | p03166 |
int1 = lambda x: int(x) - 1
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
N, M = list(map(int, input().split()))
start_point = set(range(N))
to_point = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int1, input().split()))
start_point = start_point - {y... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
int1 = lambda x: int(x) - 1
N, M = list(map(int, input().split()))
to_point = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int1, input().split()))
to_point[x].append(y)
dp_memo = [-1]*N
for x in range... | p03166 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
int1 = lambda x: int(x) - 1
N, M = list(map(int, input().split()))
to_point = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int1, input().split()))
to_point[x].append(y)
dp_memo = [-1]*N
for x in range... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(1000000000)
int1 = lambda x: int(x) - 1
N, M = list(map(int, input().split()))
not_start_point = set()
to_point = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int1, input().split()))
not_start_point.add(y)
to_p... | p03166 |
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer... | import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer... | p03166 |
from collections import defaultdict
import sys
sys.setrecursionlimit(10 ** 7)
def input():
return sys.stdin.readline().strip()
def dfs(v):
if dp[v] >= 0:
return dp[v]
res = 0
for nv in g[v]:
res = max(res, dfs(nv) + 1)
dp[v] = res
return res
n, m = list... | import sys
sys.setrecursionlimit(10 ** 7)
def input():
return sys.stdin.readline().strip()
def dfs(v):
if dp[v] >= 0:
return dp[v]
res = 0
for nv in g[v]:
res = max(res, dfs(nv) + 1)
dp[v] = res
return res
n, m = list(map(int, input().split()))
g = [[] fo... | p03166 |
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
graph = [[] for i in range(n+1)]
path = [0 for i in range(n+1)]
for a,b in ab:
graph[b].append(a)
path[a] = -1
stack = []
for i in range(1,n+1):
if path[i] == 0:
stack... | import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
graph = [[] for i in range(n+1)]
path = [0 for i in range(n+1)]
con = [0 for i in range(n+1)]
for a,b in ab:
graph[b].append(a)
path[a] = -1
con[a] += 1
stack = []
for i i... | p03166 |
from collections import deque
n, m = list(map(int, input().split()))
g = [[] for _ in range(n)]
indeg = [0 for _ in range(n)]
for _ in range(m):
x, y = list(map(int, input().split()))
g[x-1].append(y-1)
indeg[y-1] += 1
q = deque([])
dp = [-1 for _ in range(n)]
for i in range(n):
if ... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, m = list(map(int, input().split()))
g = [[] for _ in range(n)]
indeg = [0 for _ in range(n)]
for _ in range(m):
x, y = list(map(int, input().split()))
g[x-1].append(y-1)
indeg[y-1] += 1
dp = [-1 for _ in range(n)]
... | p03166 |
import sys
sys.setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
to = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
to[x - 1].append(y - 1)
count = 0
def dfs(v, seen, temp=0):
global count
seen[v] = 1
if to[v]:
for nv in ... | import sys
sys.setrecursionlimit(10**9)
N, M = list(map(int, input().split()))
to = [[] for _ in range(N)]
for _ in range(M):
x, y = list(map(int, input().split()))
to[x - 1].append(y - 1)
# dp[i] : iを始点とする最長経路
dp = [0] * N
seen = [0] * N
def dfs(v):
if seen[v]:
return dp[v]
... | p03166 |
import sys
sys.setrecursionlimit(10**6)
def dfs(v):
seen[v]=1
for nv in G[v]:
if seen[nv]:
continue
dfs(nv)
topo.append(v)
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
x,y=[int(x)-1 for x in input().split()]
G[x].append(y)
... | import sys
sys.setrecursionlimit(10**6)
def dfs(v):
if(dp[v]==-1):
dp[v]=0
for nv in G[v]:
dp[v]=max(dp[v],dfs(nv)+1)
return dp[v]
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
x,y=[int(x)-1 for x in input().split()]
G[x].append(y)... | p03166 |
n, m = list(map(int, input().split()))
path = {}
ans = []
for i in range(m):
x, y = list(map(int, input().split()))
if not x in list(path.keys()):
path[x] = []
path[x].append(y)
def get_next_node(current):
next_node = []
for c in current:
if not c in list(path.keys... | n, m = list(map(int, input().split()))
path = {}
ans = []
for i in range(m):
x, y = list(map(int, input().split()))
if not x in list(path.keys()):
path[x] = []
path[x].append(y)
def get_next_node(current):
next_node = []
for c in current:
if not c in list(path.keys... | p03166 |
import sys
sys.setrecursionlimit(10**6)
edges, vertices = list(map(int, input().split()))
dp = [None for _ in range(edges)]
nodes = [[] for _ in range(edges)]
for i in range(vertices):
start, end = list(map(int, input().split()))
nodes[end -1].append(start-1)
def find(arr):
if not len(arr):
... | import sys
sys.setrecursionlimit(10**6)
edges, vertices = list(map(int, input().split()))
dp = [None for _ in range(edges)]
nodes = [[] for _ in range(edges)]
for i in range(vertices):
start, end = list(map(int, input().split()))
nodes[end -1].append(start-1)
for i in range(edges):
if not len... | p03166 |
from sys import stdin
import math
import fractions
from collections import deque
import sys
# 再起の上限を変更
sys.setrecursionlimit(100000)
INF = 10 ** 10
# 深さ優先探索
def dfs(i):
global is_visited
global tsort_res
if is_visited[i]:
return
is_visited[i] = True
for j in nextl[i... | from sys import stdin
import math
import fractions
from collections import deque
import sys
# 再起の上限を変更
sys.setrecursionlimit(100000)
INF = 10 ** 10
# 深さ優先探索
def dfs(i):
global is_visited
global tsort_res
if is_visited[i]:
return
is_visited[i] = True
for j in nextl[i... | p03166 |
from sys import stdin
import math
import fractions
from collections import deque
import sys
# 再起の上限を変更
sys.setrecursionlimit(100000)
INF = 10 ** 10
# 深さ優先探索
def dfs(i):
global is_visited
global tsort_res
if is_visited[i]:
return
is_visited[i] = True
for j in nextl[i... | from sys import stdin
import math
import fractions
from collections import deque
import sys
# 再起の上限を変更
sys.setrecursionlimit(100000)
INF = 10 ** 10
# 深さ優先探索
def dfs(i):
global is_visited
global tsort_res
if is_visited[i]:
return
is_visited[i] = True
for j in nextl[i... | p03166 |
import heapq
INF=float('inf')
n,m=list(map(int,input().split()))
adj=[[] for _ in range(n)]
for _ in range(m):
x,y=list(map(int,input().split()))
x-=1
y-=1
adj[x].append(y)
ans=-INF
for i in range(n):
dist=[-INF for _ in range(n)]
Q=[(0,i)]
dist[i]=0
heapq.heapify(Q)
while Q:
d... | import sys
sys.setrecursionlimit(10**9)
INF=float('inf')
n,m=list(map(int,input().split()))
adj=[[] for _ in range(n+1)]
for _ in range(m):
x,y=list(map(int,input().split()))
adj[x].append(y)
dp=[-1 for _ in range(n+1)]
def f(k):
if dp[k]!=-1:
return dp[k]
dp[k]=0
if adj[k]:
... | p03166 |
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
matrix = [[0]*N for i in range(N)]
for _ in range(M):
x,y = list(map(int,input().split()))
x -= 1; y -= 1
matrix[x][y] = 1
dp = [-1]*N
def rec(nodes):
if dp[nodes] != -1:
return dp[nodes]
res = 0
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N,M = list(map(int,input().split()))
ad = [[] for i in range(N)]
for _ in range(M):
x,y = list(map(int,input().split()))
x -= 1; y -= 1
ad[x].append(y)
dp = [-1]*N
def rec(nodes):
if dp[nodes] != -1:
return dp[n... | p03166 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N,M = list(map(int,input().split()))
ad = [[] for i in range(N)]
for _ in range(M):
x,y = list(map(int,input().split()))
x -= 1; y -= 1
ad[x].append(y)
dp = [-1]*N
def rec(nodes):
if dp[nodes] != -1:
return dp[n... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N,M = list(map(int,input().split()))
ad = [[] for i in range(N)]
for _ in range(M):
x,y = list(map(int,input().split()))
x -= 1; y -= 1
ad[x].append(y)
dp = [-1]*N
def ... | p03166 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, readline().split()))
outdeg = {i: [] for i in range(N)}
for _ in range(M):
a, b = list(map(int, readline().split()))
a -= 1
b -=... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
s, t = list(map(int, input().split()))
s -= 1
t -= 1
edge[s].append(t)
dp = [-1]*N
def dfs(s):
if dp[s] != -1:
... | p03166 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.