input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import heapq
def sol(inp=input):
n,m=list(map(int,inp().split()))
G={i+1:set() for i in range(n)}
for _ in range(m):
i,j=list(map(int,inp().split()))
G[i].add(j)
s,t=list(map(int,inp().split()))
cache_kenken={}
def kenken(v):
if v not in cache_kenken:
... | import heapq
def sol(inp=input):
s=3
n,m=list(map(int,inp().split()))
G={(i+1,j):set() for i in range(n) for j in range(s)}
for _ in range(m):
u,v=list(map(int,inp().split()))
for i in range(s):
G[(u,i)].add((v,(i+1)%s))
s,t=list(map(int,inp().split()))
visi... | p02991 |
import copy
n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
s,t=list(map(int,input().split()))
connection=[[] for i in range(3*n)]
for i in range(m):
connection[l[i][0]-1].append(l[i][1]-1+n)
connection[l[i][0]-1+n].append(l[i][1]-1+2*n)
connection[l[i][0]-1+2*n].... | n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
s,t=list(map(int,input().split()))
connection=[[] for i in range(3*n)]
for i in range(m):
connection[l[i][0]-1].append(l[i][1]-1+n)
connection[l[i][0]-1+n].append(l[i][1]-1+2*n)
connection[l[i][0]-1+2*n].append(l[i][1... | p02991 |
N,M = list(map(int,input().split()))
path = [[] for _ in range(N*3+3)]
for _ in range(M):
u,v = list(map(int,input().split()))
path[u].append(v+N)
path[u+N].append(v+N+N)
path[u+N+N].append(v)
S,T = list(map(int,input().split()))
import collections
q = collections.deque()
vis = [-1 for _ i... | N,M = list(map(int,input().split()))
path = [[] for _ in range(N*3+3)]
for _ in range(M):
u,v = list(map(int,input().split()))
path[u].append(v+N)
path[u+N].append(v+N+N)
path[u+N+N].append(v)
S,T = list(map(int,input().split()))
import collections
q = collections.deque()
vis = [-1 for _ i... | p02991 |
N,M = list(map(int,input().split()))
import time
start_t = time.time()
path = [[] for _ in range(N+3)]
for _ in range(M):
u,v = list(map(int,input().split()))
path[u].append(v)
S,T = list(map(int,input().split()))
import collections
q = collections.deque()
vis = [[-1 for _ in range(3)] for _ in ra... | N,M = list(map(int,input().split()))
import time
start_t = time.time()
path = [[] for _ in range(N+3)]
for _ in range(M):
u,v = list(map(int,input().split()))
path[u].append(v)
S,T = list(map(int,input().split()))
import collections
q = collections.deque()
vis = [[-1 for _ in range(3)] for _ in ra... | p02991 |
def main():
N, M = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
edge[u-1].append(v-1)
d = [-1]*N
S, T = list(map(int, input().split()))
d[S-1] = 0
que = [S-1]
while len(que)>0:
now = que.pop(0)
for i i... | def main():
N, M = list(map(int, input().split()))
edge = [[[] for _ in range(3)] for _ in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
edge[u-1][0].append([v-1,1])
edge[u-1][1].append([v-1,2])
edge[u-1][2].append([v-1,0])
d = [[-1]*3 for _ in range(N)]
S, T = l... | p02991 |
import sys
from collections import deque
N, M = list(map(int, sys.stdin.readline().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
u, v = list(map(int, sys.stdin.readline().split()))
edges[u-1].append(v-1)
S, T = list(map(int, sys.stdin.readline().split()))
S -= 1
T -= 1
visited = ... | import sys
from collections import deque
N, M = list(map(int, sys.stdin.readline().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
u, v = list(map(int, sys.stdin.readline().split()))
edges[u-1].append(v-1)
S, T = list(map(int, sys.stdin.readline().split()))
S -= 1
T -= 1
visited = ... | p02991 |
from collections import deque
N,M=list(map(int,input().split()))
# 頂点の番号は0-initialのまま扱う
E=set() # 辺から成るset
for i in range(M):
u,v=list(map(int,input().split()))
E.add((u,v))
S,T=list(map(int,input().split()))
d1=[set() for i in range(N+1)] # d1[i]=頂点iからの距離が1であるような頂点vから成るset
for e in E:
u=e[0];... | from collections import deque
N,M=list(map(int,input().split()))
a=[set() for i in range(N)] # 0-index
for i in range(M):
u,v=[int(x)-1 for x in input().split()]
a[u].add(v)
S,T=[int(x)-1 for x in input().split()]
# print(a)
t=[]
for i in range(N):
ti=set()
for u in a[i]:
for v... | p02991 |
from collections import deque
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
S, T = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for u, v in edges:
graph[u].append(v)
INF = 10 ** 9 + 7
dp = [[INF] * (N + 1) for _ in range(3)]
dp[... | from collections import deque
N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
S, T = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for u, v in X:
graph[u].append(v)
INF = 10 ** 9 + 7
ctr = [[INF] * (N + 1) for _ in range(3)]
ctr[0][S... | p02991 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
def LI(): return list(map(int, sys.stdin.readline().split()))
N,M = LI()
um = [[] for i in range(M)]... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
def LI(): return list(map(int, sys.stdin.readline().split()))
N,M = LI()
um = [[] for i in range(M)]... | p02991 |
n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
alist = [[] for _ in range(n)]
for u, v in uv:
alist[u-1].append(v-1)
s, t = list(map(int, input().split()))
alist3 = [set([]) for _ in range(n)]
for v in range(n):
for v1 in alist[v]:
for v2 in al... | n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
alist = [[] for _ in range(3*n)]
for u, v in uv:
u, v = u-1, v-1
alist[u].append(n+v)
alist[n+u].append(2*n+v)
alist[2*n+u].append(v)
# BFS
queue = [s-1]... | p02991 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
def f(D, S, T):
close = [[False] * N, [False] * N, [False] * N]
Q = []
index = 0
Q.append((S, 0, 0))
while len(Q) > index:
p, c, l = Q[index]
index += 1
if l == 0 and p == T:
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
def f(D, S, T):
close = [[False] * N, [False] * N, [False] * N]
Q = []
index = 0
Q.append((S, 0, 0))
while len(Q) > index:
p, c, l = Q[index]
index += 1
if close[l][p]:
... | p02991 |
import queue
def dist(s, t, g):
q = queue.Queue()
dists = [-1]*len(g)
dists[s] = 0
q.put(s)
f = False
while not q.empty():
target = q.get()
for v in g[target]:
if dists[v] == -1:
dists[v] = dists[target] + 1
if v == t:
... | def dist(s, t, g):
q = [s]
dists = [-1]*len(g)
dists[s] = 0
while len(q) != 0:
p = []
for u in q:
for v in g[u]:
if dists[v] != -1:
continue
p.append(v)
dists[v] = dists[u] + 1
q = p
... | p02991 |
import heapq
N, M = list(map(int, input().split()))
Edge = [list(map(int, input().split())) for i in range(M)]
S, T = list(map(int, input().split()))
S, T = S - 1, T - 1
G3 = [[] for i in range(3 * N)]
for u, v in Edge:
u, v = u - 1, v - 1
G3[u].append([v + N, 1])
G3[u + N].append([v + N * 2,... | N, M = list(map(int, input().split()))
G = [[] for i in range(3 * N)]
for i in range(M):
u, v = list(map(int, input().split()))
u, v = u - 1, v - 1
G[u].append([v + N, 1])
G[u + N].append([v + 2 * N, 1])
G[u + 2 * N].append([v, 1])
S, T = list(map(int, input().split()))
S, T = S - 1, T - ... | p02991 |
from collections import deque
N,M,*f = list(map(int, open(0).read().split()))
uv = [f[i:i+2] for i in range(0, len(f)-2, 2)]
S = f[-2]
T = f[-1]
connected = [[] for _ in range(N+1)]
for u, v in uv:
connected[u].append(v)
d = deque([S])
for i in range(1,N+1):
for j in range(3):
for k in ra... | from collections import deque
N,M,*f = list(map(int, open(0).read().split()))
uv = [f[i:i+2] for i in range(0, len(f)-2, 2)]
S = f[-2]
T = f[-1]
connected = [[] for _ in range(N+1)]
for u, v in uv:
connected[u].append(v)
dist = [[-1] * 3 for _ in range(N+1)]
dist[S][0] = 0
ans = 0
d = deque([(S,0)])
w... | p02991 |
N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
u, v = u-1, v-1
graph[u].append(v)
S, T = list(map(int, input().split()))
S, T = S-1, T-1
new1 = [[] for i in range(N)]
new2 = [[] for i in range(N)]
new3 = [[] for i in ... | N, M = list(map(int, input().split()))
graph = [[] for i in range(3 * N)]
for i in range(M):
u, v = list(map(int, input().split()))
u, v = u-1, v-1
graph[u].append(v+N)
graph[u+N].append(v+2*N)
graph[u+2*N].append(v)
S, T = list(map(int,input().split()))
S, T = S-1, T-1
visit = [False for ... | p02991 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,M,*UV,S,T = list(map(int,read().split()))
it = iter(UV)
graph = [[] for _ in range(1+N+N+N)]
for x,y in zip(it,it):
x1=x+N; x2=x1+N
y1=y+N; y2=y1+N
graph[x].append(y1)
gra... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,M,*UV,S,T = list(map(int,read().split()))
it = iter(UV)
graph = [[] for _ in range(1+N+N+N)]
for x,y in zip(it,it):
x1=x+N; x2=x1+N
y1=y+N; y2=y1+N
graph[x].append(y1)
gra... | p02991 |
import queue
WHITE = 0
GRAY = 1
BLACK = 2
INFTY = 10**16
def dijkstra(s, V):
color = [WHITE for i in range(N+1)]
d = [INFTY for i in range(N+1)]
d[s] = 0
q = queue.Queue()
q.put(s)
while not q.empty():
u = q.get()
color[u] = BLACK
for v in V[u]:
... | import queue
WHITE = 0
GRAY = 1
BLACK = 2
INFTY = 10**16
def bfs(s, V):
color = [[WHITE for i in range(N+1)] for j in range(3)]
d = [[INFTY for i in range(N+1)] for j in range(3)]
d[0][s] = 0
q = queue.Queue()
q.put((0, s))
while not q.empty():
dv, u = q.get()
... | p02991 |
n,m = list(map(int,input().split()))
uv = [[] for _ in range(n)]
for i in range(m):
u,v = [int(x)-1 for x in input().split()]
uv[u].append(v)
s,t = [int(x)-1 for x in input().split()]
time = 0
now = {s}
flag = 0
for _ in range(n):
time += 1
tmp = set()
for x in now:
for y in uv[x]:
tmp... | n,m = list(map(int,input().split()))
pst = [[] for _ in range(n)]
for _ in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
pst[a].append(b)
s,t = list(map(int,input().split()))
s -= 1
t -= 1
cnt = [[0,0,0] for _ in range(n)]
cnt[s][0] = 1
now = [s]
time = 0
while now:
time += 1
... | p02991 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
# 双方向グラフで幅優先探索
from collections import deque
n, m = list(map(int, input().split()))
g = [set([]) for _ in range(n)]
#隣接リストの作成
for i in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a].add(b)
graph = [set([]) for _ in range(n)... | #!/usr/bin python3
# -*- coding: utf-8 -*-
# 双方向グラフで幅優先探索
from collections import deque
n, m = list(map(int, input().split()))
g = [set([]) for _ in range(n)]
#隣接リストの作成
for i in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a].add(b)
s, t = list(map(int, input().split... | p02991 |
import queue
INF=-1
N,M=[int(e) for e in input().split(' ')]
to=[[] for _ in range(N)]
for i in range(M):
u,v=[int(e) for e in input().split(' ')]
to[u-1].append(v-1)
S,T=[int(e)-1 for e in input().split(' ')]
dist=[[INF for i in range(3)] for j in range(N)]
q=queue.Queue()
q.put([S,0])
dist[... | #import queue
from collections import deque
INF=-1
N,M=[int(e) for e in input().split(' ')]
to=[[] for _ in range(N)]
for i in range(M):
u,v=[int(e) for e in input().split(' ')]
to[u-1].append(v-1)
S,T=[int(e)-1 for e in input().split(' ')]
dist=[[INF for i in range(3)] for j in range(N)]
q=... | p02991 |
from collections import deque
def sol():
n,m=list(map(int,input().split()))
d={}
for i in range(m):
u,v=list(map(int,input().split()))
if u in d:
d[u].append(v)
else:
d[u]=[v]
s,t=list(map(int,input().split()))
ans=chk=0
w=deque([0,s])
... | from collections import deque
def sol():
n,m=list(map(int,input().split()))
d={}
for i in range(m):
u,v=list(map(int,input().split()))
if u in d:
d[u].append(v)
else:
d[u]=[v]
s,t=list(map(int,input().split()))
ans=chk=0
w=deque([0,s])
... | p02991 |
from collections import deque
import sys
input = sys.stdin.readline
def sol():
n,m=list(map(int,input().split()))
d={}
for i in range(m):
u,v=list(map(int,input().split()))
if u in d:
d[u].append(v)
else:
d[u]=[v]
s,t=list(map(int,input().spl... | from collections import deque
import sys
input = sys.stdin.readline
def sol():
n,m=list(map(int,input().split()))
d={}
for i in range(m):
u,v=list(map(int,input().split()))
if u in d:
d[u].append(v)
else:
d[u]=[v]
s,t=list(map(int,input().spl... | p02991 |
from collections import deque
import sys
input = sys.stdin.readline
def MI():return list(map(int,input().split()))
def main():
n,m=MI()
G=[[] for _ in range(n)]
for _ in range(m):
u,v=MI()
u-=1
v-=1
G[u].append(v)
s,t=MI()
s-=1
t-=1
fi=[True]*n
se=[True]*n
th=[True... | #from collections import deque
import sys
input = sys.stdin.readline
def MI():return list(map(int,input().split()))
def main():
n,m=MI()
G=[[] for _ in range(n)]
for _ in range(m):
u,v=MI()
u-=1
v-=1
G[u].append(v)
s,t=MI()
s-=1
t-=1
fi=[True]*n
se=[True]*n
th=[Tru... | p02991 |
import sys
#色々とメモリ使用量には気をつける
from collections import deque
n, m=list(map(int, input().split()))
u_list=[]
v_list=[]
for i in range(m):
u, v=list(map(int, input().split()))
u_list.append(u)
v_list.append(v)
s, t=list(map(int, input().split()))
queue=deque()
kenken=[]
for i in range(1, n+1):
... | import sys
from collections import deque
n, m=list(map(int,input().split()))
"""
頂点1~nを1~3nに3倍加する
"""
edges=[[] for i in range(3*n)]
for i in range(m):
"""
uからvへの枝を
uからv+n, u+nからv+2n, u+2nからv+3n
とする
(枝を3倍加)
"""
u, v=list(map(int, input().split()))
u, v=u-1, v-1
edges[... | p02991 |
#132_E
import queue
import sys
sys.setrecursionlimit(300000)
n,m=list(map(int,input().split()))
edges=[[] for i in range(n)]
for _ in range(m):
u,v=list(map(int,input().split()))
edges[u-1].append(v-1)
edges_3=[[] for i in range(n)]
for i in range(n):
for x in edges[i]:
for y in e... | #### 132_E
import queue
import sys
sys.setrecursionlimit(300000)
n,m=list(map(int,input().split()))
edges=[[] for i in range(3*n)]
for _ in range(m):
u,v=list(map(int,input().split()))
u,v=u-1,v-1
u0,u1,u2=u,u+n,u+2*n
v0,v1,v2=v,v+n,v+2*n
edges[u0].append(v1)
edges[u1].append(... | p02991 |
from collections import defaultdict as dd
from collections import deque
from copy import deepcopy as dc
N, M = list(map(int, input().split()))
e = dd(list)
inf = 10 ** 9
for _ in range(M):
u, v = list(map(int, input().split()))
e[u].append(v)
S, T = list(map(int, input().split()))
stopped = [inf] * (N +... | from collections import defaultdict as dd
from collections import deque
N, M = list(map(int, input().split()))
e = dd(list)
inf = 10 ** 9
for _ in range(M):
u, v = list(map(int, input().split()))
e[u].append(v + N)
e[u + N].append(v + 2 * N)
e[u + 2 * N].append(v)
S, T = list(map(int, input().split())... | p02991 |
from collections import deque
n,m = list(map(int,input().split()))
path = [[set() for _ in range(n)] for _ in range(3)]
for _ in range(m):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
path[0][u].add(v)
s,t = list(map(int,input().split()))
for i in range(2):
for j in range(n):
... | from collections import deque
n,m = list(map(int,input().split()))
path = [set() for _ in range(n)]
for _ in range(m):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
path[u].add(v)
s,t = list(map(int,input().split()))
que = deque([(s-1,0)])
d = [[float('inf')]*n for _ in range(3)]
d[0... | p02991 |
from collections import deque
def main():
N, M = list(map(int, input().split()))
dp = [[set() for _ in range(N)] for _ in range(3)]
for _ in range(M):
u, v = list(map(int, input().split()))
dp[0][v-1].add(u-1)
S, T = list(map(int, input().split()))
for i in range(1, 3):
... | from collections import deque
def main():
N, M = list(map(int, input().split()))
dp = [[[] for _ in range(N)] for _ in range(3)]
for _ in range(M):
u, v = list(map(int, input().split()))
dp[0][v-1].append(u-1)
S, T = list(map(int, input().split()))
for i in range(1, 3):
... | p02991 |
from collections import deque
def main():
N, M = list(map(int, input().split()))
dp = [[[] for _ in range(N)] for _ in range(3)]
for _ in range(M):
u, v = list(map(int, input().split()))
dp[0][v-1].append(u-1)
S, T = list(map(int, input().split()))
for i in range(1, 3):
... | from collections import deque
def main():
N, M = list(map(int, input().split()))
dp = [[[] for _ in range(N)] for _ in range(3)]
for _ in range(M):
u, v = list(map(int, input().split()))
dp[0][v-1].append(u-1)
S, T = list(map(int, input().split()))
for i in range(1, 3):
... | p02991 |
from collections import deque
def main():
N, M = list(map(int, input().split()))
dp = [[[] for _ in range(N)] for _ in range(3)]
for _ in range(M):
u, v = list(map(int, input().split()))
dp[0][v-1].append(u-1)
S, T = list(map(int, input().split()))
for i in range(1, 3):
... | from collections import deque
def main():
N, M = list(map(int, input().split()))
adj = [set() for _ in range(N*3)]
dp = [[[] for _ in range(N)] for _ in range(3)]
for _ in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
adj[u].add(N*1+v)
... | p02991 |
def main():
N, M = list(map(int, input().split()))
INF = 2**30-1
mat = [[INF for _ in range(3*N)] for _ in range(3*N)]
for _ in range(M):
u, v = list(map(int, input().split()))
mat[u-1][N+v-1] = 1
mat[N+u-1][2*N+v-1] = 1
mat[2*N+u-1][v-1] = 1
for i in range(3*N):
for j in range(3*N):
for k ... | def main():
N, M = list(map(int, input().split()))
INF = 2**30-1
mat = [[] for _ in range(3*N)]
for _ in range(M):
u, v = list(map(int, input().split()))
mat[u-1].append([N+v-1, 1])
mat[N+u-1].append([2*N+v-1, 1])
mat[2*N+u-1].append([v-1, 1])
S, T = list(map(int, input().split()))
queue = lis... | p02991 |
# https://atcoder.jp/contests/abc132/tasks/abc132_e
# ぱっと思いつくのはダイクストラで3回で到達できる点を探索していくとかかなぁ
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina(*argv, sub=1): return list([x - sub for x in argv])
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def read_a_in... | # https://atcoder.jp/contests/abc132/tasks/abc132_e
# ぱっと思いつくのはダイクストラで3回で到達できる点を探索していくとかかなぁ
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def mina(*argv, sub=1): return list([x - sub for x in argv])
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def read_a_in... | p02991 |
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()))
u, v = u-1, v-1
g[u].append(v)
# print(g)
s, t = list(map(int, input().split()))
s, t = s-1, t-1
visited = [[-1]*3 for j in range(n)]
l = 0... | import sys
input = sys.stdin.buffer.readline
n, m = list(map(int, input().split()))
g = [[] for _ in range(3*n)]
for i in range(m):
u, v = list(map(int, input().split()))
u, v = u-1, v-1
g[u].append(v+n)
g[u+n].append(v+2*n)
g[u+2*n].append(v)
s, t = list(map(int, input().split()))
s, t... | p02991 |
import queue
n,m = list(map(int, input().split()))
a = [[] for i in range(n)]
for i in range(m):
u,v = list(map(int, input().split()))
u-=1
v-=1
a[u].append(v)
s,t = list(map(int, input().split()))
s-=1
t-=1
inf = float('inf')
d = [[inf, inf, inf] for i in range(n)]
d[s][0]=0
q =... | import queue
n,m = list(map(int, input().split()))
a = [[] for i in range(n)]
for i in range(m):
u,v = list(map(int, input().split()))
u-=1
v-=1
a[u].append(v)
s,t = list(map(int, input().split()))
s-=1
t-=1
inf = float('inf')
d = [[inf, inf, inf] for i in range(n)]
d[s][0]=0
q =... | p02991 |
import sys
import heapq
n, m = [int(i) for i in sys.stdin.readline().split()]
graph = [[0 for i in range(3 * n)] for j in range(3 * n)]
for i in range(m):
u, v = [int(i) for i in sys.stdin.readline().split()]
u -= 1
v -= 1
graph[u][n+v] = 1
graph[u+n][2*n+v] = 1
graph[u + 2 * n][v] = 1... | import sys
import heapq
n, m = [int(i) for i in sys.stdin.readline().split()]
graph = {j:[] for j in range(3 * n)}
for i in range(m):
u, v = [int(i) for i in sys.stdin.readline().split()]
u -= 1
v -= 1
graph[u].append(n+v)
graph[u+n].append(2*n+v)
graph[u + 2 * n].append(v)
s, t = [in... | p02991 |
import sys
from collections import deque
n, m = [int(i) for i in sys.stdin.readline().split()]
graph = {j:[] for j in range(3 * n)}
for i in range(m):
u, v = [int(i) for i in sys.stdin.readline().split()]
u -= 1
v -= 1
graph[u].append(n+v)
graph[u+n].append(2*n+v)
graph[u + 2 * n].appe... | import sys
INF = 10 ** 9
n, m = [int(i) for i in sys.stdin.readline().split()]
graph = {j:[] for j in range(3 * n)}
for i in range(m):
u, v = [int(i) for i in sys.stdin.readline().split()]
u -= 1
v -= 1
graph[u].append(n+v)
graph[u+n].append(2*n+v)
graph[u + 2 * n].append(v)
s, t = [i... | p02991 |
import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutat... | import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutat... | p02991 |
import queue
N,M = list(map(int, input().split()))
G = [[] for i in range(3*N+1)]
for i in range(M):
u,v = list(map(int, input().split()))
G[u].append(v+N)
G[u+N].append(v+2*N)
G[u+2*N].append(v)
S,T = list(map(int, input().split()))
def bfs(s):
que = queue.Queue()
que.put(s)
d = [-1 for... | import collections
N,M = list(map(int, input().split()))
G = [[] for i in range(3*N+1)]
for i in range(M):
u,v = list(map(int, input().split()))
G[u].append(v+N)
G[u+N].append(v+2*N)
G[u+2*N].append(v)
S,T = list(map(int, input().split()))
def bfs(s):
que = collections.deque()
que.append(s)... | p02991 |
from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [set() for _ in range(3 * N)]
for a, b in LIST:
a, b = 3 * (a - 1), 3 * (b - 1)
NEAR[a].add(b + 1)
NEAR[a + 1].add(b + 2)
NEAR[a + 2].add(b)
return NEAR
def bfs(S, T, N): # 幅優先探索 # キュー
... | from collections import deque
def nearlist(N, LIST): # 隣接リスト
NEAR = [set() for _ in range(3 * N)]
for a, b in LIST:
a, b = 3 * (a - 1), 3 * (b - 1)
NEAR[a].add(b + 1)
NEAR[a + 1].add(b + 2)
NEAR[a + 2].add(b)
return NEAR
def bfs(S, T, N): # 幅優先探索 # キュー
... | p02991 |
from collections import deque
N, M = list(map(int, input().split()))
G = {k: [] for k in range(N+1)}
for _ in range(M):
u, v = list(map(int, input().split()))
G[u].append(v)
S, T = list(map(int, input().split()))
visited = [[10**9] * (N+1) for _ in range(3)]
que = deque([(S, 0)])
while que:
... | from collections import deque
N, M = list(map(int, input().split()))
G = [[[] for j in range(3)] for i in range(N+1)]
for _ in range(M):
u, v = list(map(int, input().split()))
for i in range(3):
G[u][i].append((v, (i+1) % 3))
S, T = list(map(int, input().split()))
visited = [[-1] * 3 for _ i... | p02991 |
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)
gken=[[] for i in range(n)]
for i in range(n):
for j in g[i]:
for j2 in g[j]:
for j3 in g[j2]:
gke... | from collections import deque
n,m=list(map(int,input().split()))
g=[[] for i in range(3*n)]
for i in range(m):
a,b=list(map(int,input().split()))
g[3*(a-1)].append(3*(b-1)+1)
g[3*(a-1)+1].append(3*(b-1)+2)
g[3*(a-1)+2].append(3*(b-1))
s,t=list(map(int,input().split()))
s-=1
t-=1
s*=3
t*=3
q... | p02991 |
from collections import deque
n,m = list(map(int,input().split()))
uv = [[] for i in range(n)]
for i in range(m):
u,v = list(map(int,input().split()))
#uv[v-1].append(u-1)
uv[u-1].append(v-1)
s,t = list(map(int,input().split()))
check = [[0 for i in range(3)] for j in range(n)]
d = de... | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# vertexごとに3つの状態数を持つ
N, M = lr()
graph = [[] for _ in range((N+1)*3)] # 1-indexed
for _ in range(M):
a, b = lr()
a *... | p02991 |
import copy
a,b=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(b)]
s,t=list(map(int,input().split()))
s=3*s
t=3*t
dd=[[]for i in range(a+1)]
for i in range(b):
da=c[i][0]
db=c[i][1]
dd[da].append(db)
d=[[]for i in range(3*(a+1))]
for i in range(len(dd)):
for j... | import copy
a,b=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(b)]
s,t=list(map(int,input().split()))
s=3*s
t=3*t
dd=[[]for i in range(a+1)]
for i in range(b):
da=c[i][0]
db=c[i][1]
dd[da].append(db)
d=[[]for i in range(3*(a+1))]
for i in range(len(dd)):
for j... | p02991 |
import sys
from heapq import heappush, heappop
inf = float('inf')
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, sys.stdin.readline().split()))
g[u].append(v)
s, t = list(map(int, sys.stdin.readline().split()))
g2 = [[] f... | import sys
from heapq import heappush,heappop
inf = float('inf')
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, sys.stdin.readline().split()))
g[u].append(v)
s, t = list(map(int, sys.stdin.readline().split()))
def main():... | p02991 |
def BC132_E():
n, m = list(map(int, input().split(' ')))
e = [[] for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split(' ')))
e[u - 1].append(v - 1)
s, t = list(map(int, input().split(' ')))
s, t = s - 1, t - 1
f = []
for i in range(n):
... | def BC132_E():
n, m = list(map(int, input().split(' ')))
e = [[] for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split(' ')))
e[u - 1].append(v - 1)
s, t = list(map(int, input().split(' ')))
s, t = s - 1, t - 1
stack, visited = [(s, 0)], set()
a, b... | p02991 |
# import bisect
from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF... | # import bisect
from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF... | p02991 |
import heapq
N, M = list(map(int, input().split()))
edges = [set() for _ in range(N)]
for _ in range(M):
u, v = list(map(int, input().split()))
edges[u-1].add(v-1)
S, T = list(map(int, input().split()))
S -= 1
T -= 1
step2 = [set() for _ in range(N)]
for u in range(N):
for v in edges[... | import heapq
N, M = list(map(int, input().split()))
edges = [set() for _ in range(N)]
for _ in range(M):
u, v = list(map(int, input().split()))
edges[u-1].add(v-1)
S, T = list(map(int, input().split()))
S -= 1
T -= 1
cost = [-1 for _ in range(N)]
q = []
heapq.heappush(q, (0, S))
step1memo ... | p02991 |
N,M = list(map(int, input().split()))
UV = [list(map(int, input().split())) for _ in range(M)]
S,T = list(map(int, input().split()))
adjucent_dict={u:set() for u in range(1,N+1)}
for u,v in UV:
adjucent_dict.setdefault(u,set()).add(v)
#adjucent_dict.setdefault(v,set()).add(u)
two_adjucent_dict={u:set.u... | N,M = list(map(int, input().split()))
UV = [list(map(int, input().split())) for _ in range(M)]
S,T = list(map(int, input().split()))
adjacent_dict={}
for u,v in UV:
adjacent_dict.setdefault((u,0),set()).add((v,1))
adjacent_dict.setdefault((u,1),set()).add((v,2))
adjacent_dict.setdefault((u,2),set()).add(... | p02991 |
from collections import defaultdict, deque
def kenkenpa(s, visited):
res = []
for v1 in e[s]:
if visited[v1][1]:
continue
visited[v1][1] = True
for v2 in e[v1]:
if visited[v2][2]:
continue
visited[v2][2] = True
... | from collections import defaultdict, deque
N, M = list(map(int, input().split()))
e = defaultdict(list)
for i in range(M):
u, v = list(map(int, input().split()))
e[u].append(v)
'''
頂点を%3で考える(1つの頂点にを3つに分解する)
(u,0)->(v,1)
(v,1)->(u,2)
(u,2)->(v,0)
'''
S, T = list(map(int, input().split()))
q = ... | p02991 |
def f(n, m):
to1 = {}
for _ in range(m):
u, v = list(map(int, input().split()))
to1.setdefault(u, [])
to1[u] += [v]
s, t = list(map(int, input().split()))
vst1 = set()
cnt = 0
to = {}
for i in range(1, n + 1):
ss = set([i])
for _ in ran... | def f(n, m):
to = {}
for _ in range(m):
u, v = list(map(int, input().split()))
to.setdefault(u, [])
to[u] += [v]
s, t = list(map(int, input().split()))
vst = [[False] * 3 for _ in range(n + 1)]
a = [s]
vst[s][0] = True
cnt = 0
while a:
b = []
... | p02991 |
import sys
input = sys.stdin.readline
from collections import deque
class Graph:
def __init__(self, n, directed=False, decrement=True, destroy=False, edges=[]):
self.n = n
self.directed = directed
self.decrement = decrement
self.destroy = destroy
self.edges = [se... | # https://atcoder.jp/contests/abc132/tasks/abc132_e
"""
タグ: bfs、拡張グラフ
"""
import sys
input = sys.stdin.readline
from collections import deque
class Graph:
def __init__(self, n, directed=False, decrement=True, destroy=False, edges=[]):
self.n = n
self.directed = directed
self... | p02991 |
#
import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop
def next_kenp(node, edges):
nodes = set()
nodes2 = set()
for n1 in edges[node]:
for n2 in edges[n1]:
if n2 not in nodes2:
... | #
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
def main():
n, m = list(map(int, input().split()))
edges = defaultdict(list)
for _ in range(m):
u, v = list(map(in... | p02991 |
from collections import deque
import sys
input = sys.stdin.readline
def reachable_by_3steps_from(node, edges):
dist1 = edges[node]
reachable = []
for d1 in dist1:
dist2 = edges[d1]
for d2 in dist2:
reachable += edges[d2]
return reachable
n, m = list(map(int... | from collections import deque
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(m):
_from, to = list(map(int, input().split()))
edges[_from-1].append(to-1)
start, goal = list(map(int, input().split()))
todo = deque([])
se... | p02991 |
import os
import sys
from collections import defaultdict
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
N, M = list(map(int, sys.stdin.readline().split()))
UV = [list(map(int, sys.stdin.re... | import os
import sys
from collections import defaultdict
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
N, M = list(map(int, sys.stdin.readline().split()))
UV = [list(map(int, sys.stdin.re... | p02991 |
import heapq
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
N, M = list(map(int, sys.stdin.readline().split()))
UV = [list(map(int, sys.stdin.readline().split())) for _ in range(M)]
S, T = list(map(int... | import heapq
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
N, M = list(map(int, sys.stdin.readline().split()))
VU = [list(map(int, sys.stdin.readline().split())) for _ in range(M)]
S, T = list(map(int... | p02991 |
def dijkstra(edge,start,end) :
import heapq
minCosts = [float('inf') for _ in range(len(edge))]
nodeHeap = []
heapq.heappush(nodeHeap, (0, start)) # (cost, node)
while nodeHeap :
cost, node = heapq.heappop(nodeHeap)
if minCosts[node] <= cost :
continue
... | import heapq
N , M = list(map(int,input().split()))
# edges , costs
nodes = [[] for _ in range(3 * N)]
confilm = [False] * (3 * N) # 確定フラグ
costs = [-1] * (3 * N) # 最短経路
# 辺の入力
for _ in range(M) :
fromNode , toNode = list(map(int,input().split()))
fromNode -= 1
toNode -= 1
fro... | p02991 |
import sys,atexit
from io import BytesIO
inp = BytesIO(sys.stdin.buffer.read())
input = lambda:inp.readline().decode('ascii')
buf = BytesIO()
sys.stdout.write = lambda s: buf.write(s.encode('ascii'))
atexit.register(lambda:sys.__stdout__.buffer.write(buf.getvalue()))
n,m = list(map(int,input().split()))
C =... | import sys,atexit
from io import BytesIO
inp = BytesIO(sys.stdin.buffer.read())
input = lambda:inp.readline().decode('ascii')
buf = BytesIO()
sys.stdout.write = lambda s: buf.write(s.encode('ascii'))
atexit.register(lambda:sys.__stdout__.buffer.write(buf.getvalue()))
n,m = list(map(int,input().split()))
C =... | p02991 |
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p02991 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | p02991 |
import heapq
class Dijkstra:
def __init__(self, rote_map, start_point, goal_point=None):
self.rote_map = rote_map
self.start_point = start_point
self.goal_point = goal_point
def execute(self):
num_of_city = 3 * 10 ** 5 + 10
dist = [float("inf") for _ in ra... | N, M = list(map(int, input().split()))
from collections import defaultdict, deque
graph = defaultdict(list)
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph[u].append(v + N)
graph[u + N].append(v + 2 * N)
graph[u + 2 * N].append(v)
S, T = list(map(int, in... | p02991 |
N, M = list(map(int, input().split()))
from collections import defaultdict, deque
graph = defaultdict(list)
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph[u].append(v + N)
graph[u + N].append(v + 2 * N)
graph[u + 2 * N].append(v)
S, T = list(map(int, in... | N, M = list(map(int, input().split()))
from collections import defaultdict, deque
graph = defaultdict(list)
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph[u].append(v + N)
graph[u + N].append(v + 2 * N)
graph[u + 2 * N].append(v)
S, T = list(map(int, in... | p02991 |
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(eval(input()))
s = lambda: eval(input())
N, M = nl()
from collections import defaultdict
edges = defaultdict(set)
for i in range(M):
u, v = nl()
edges[u].add(v+N)
edges[u+N].add(v+2*N)
edges[u+2*N].a... | nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(eval(input()))
s = lambda: eval(input())
N, M = nl()
from collections import defaultdict
edges = defaultdict(set)
for i in range(M):
u, v = nl()
edges[u].add(v+N)
edges[u+N].add(v+2*N)
edges[u+2*N].a... | p02991 |
n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
from collections import defaultdict, deque
g1 = defaultdict(set)
for u, v in uv:
g1[u-1].add(v-1)
s -= 1
t -= 1
f = False
visited = set([s])
q = deque([(s, 0)])
wh... | n, m = list(map(int, input().split()))
uv = [list(map(int, input().split())) for _ in range(m)]
s, t = list(map(int, input().split()))
import heapq
from collections import defaultdict
g1 = defaultdict(set)
for u, v in uv:
g1[u-1].add(v-1)
s -= 1
t -= 1
dist = [[float('inf')] * 3 for _ in range(n)]
... | p02991 |
from collections import defaultdict
N, M = list(map(int, input().split()))
dic = defaultdict(list)
for i in range(M):
u, v = list(map(int, input().split()))
dic[u-1] += [v-1]
S, T = list(map(int, input().split()))
S -= 1
T -= 1
dist = [[float('inf')]*3 for i in range(N)]
ls = [float('inf')]*3
dist[S][0] ... | from collections import defaultdict, deque
N, M = list(map(int, input().split()))
dic = defaultdict(list)
for i in range(M):
u, v = list(map(int, input().split()))
dic[u-1] += [v-1]
S, T = list(map(int, input().split()))
S -= 1
T -= 1
dist = [[float('inf')]*3 for i in range(N)]
dist[S][0] = 0
q = deque([... | p02991 |
class Node:
def __init__(self, i):
self.num = i
self.ken = set()
self.kenken = set()
self.kenkenpa = set()
N, M = list(map(int, input().split()))
nodes = [Node(i) for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
... | N, M = list(map(int, input().split()))
nodes = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
nodes[u].append(v)
s, t = list(map(int, input().split()))
s -= 1
t -= 1
num = s
step = 0
q = [[num, step]]
check = [[False for i in range(N)] f... | p02991 |
#!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import ite... | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import ite... | p02991 |
import heapq as h
import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
hen=[[] for i in range(0,N)]
for i in range(0,M):
u,v=list(map(int,input().split()))
hen[u-1].append(v-1)
S,T=list(map(int,input().split()))
triplehen=[[] for i in range(0,N)]
for i in range(0,N):
q=[... | import heapq as h
N,M=list(map(int,input().split()))
hen={(i,j):[] for i in range(0,N) for j in range(0,3)}
for i in range(0,M):
u,v=list(map(int,input().split()))
hen[(u-1,0)].append((v-1,1))
hen[(u-1,1)].append((v-1,2))
hen[(u-1,2)].append((v-1,0))
S,T=list(map(int,input().split()))
sta... | p02991 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p02991 |
from collections import deque
def bfs(start, goal, g, visited):
q = deque([start])
visited[start] = 0
while q:
curr_node = q.popleft()
if curr_node == goal:
return
for next1_node in g[curr_node]:
for next2_node in g[next1_node]:
for ... | from collections import deque
def bfs(start, goal, g, n, visited):
visited1 = [False]*(n+1)
visited2 = [False]*(n+1)
q = deque([start])
visited[start] = 0
while q:
curr_node = q.popleft()
if curr_node == goal:
return
for next1_node in g[curr_node]:
... | p02991 |
from heapq import *
import sys
input=sys.stdin.readline
def main():
N,M=list(map(int,input().split()))
G=[set() for i in range(N)]
for i in range(M):
u,v=list(map(int,input().split()))
u,v=u-1,v-1
G[u].add(v)
S,T=list(map(int,input().split()))
A=[set() for i in range(N)]
for i ... | from heapq import *
import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
G=[[] for i in range(3*N)]
for i in range(M):
u,v=list(map(int,input().split()))
u,v=u-1,v-1
G[3*u+0].append([3*v+1,0])
G[3*u+1].append([3*v+2,0])
G[3*u+2].append([3*v+0,1])
S,T=list(map(int,input()... | p02991 |
import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
adj=[[] for _ in range(N)]
adj_2=[[] for _ in range(N)]
adj_3=[[] for _ in range(N)]
for i in range(M):
u,v=list(map(int,input().split()))
adj[u-1].append(v-1)
S,T=list(map(int,input().split()))
for i in range(N):
for ... | ##########################################
inf=10**9
import heapq
class Dijkstra():
"""
・有向 / 無向は問わない(無向の場合は，逆向きの辺もたす)
・負のコストがない場合のみ
・計算量はO(E log|V|)
・heapを使うことで頂点を走査する必要がなくなる（代わりに，距離更新したものは確定でなくともqueに入れておく）
"""
class Edge():
#重み付き有向辺
def __init__(s... | p02991 |
##########################################
inf=10**9
import heapq
class Dijkstra():
"""
・有向 / 無向は問わない(無向の場合は，逆向きの辺もたす)
・負のコストがない場合のみ
・計算量はO(E log|V|)
・heapを使うことで頂点を走査する必要がなくなる（代わりに，距離更新したものは確定でなくともqueに入れておく）
"""
class Edge():
#重み付き有向辺
def __init__(s... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
##########################################
import heapq
class Dijkstra():
"""
・有向 / 無向は問わない(無... | p02991 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02991 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02991 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02991 |
n,m=list(map(int,input().split()))
u,v=[],[]
path=[[] for i in range(n)]
for i in range(m):
ui,vi=[int(x)-1 for x in input().split()]
path[ui].append(vi)
# path[vi].append(ui)
s,t=[int(x)-1 for x in input().split()]
from collections import deque
q=deque()
q.append((s,0))
# print(path)
check=[Fal... | n,m=list(map(int,input().split()))
u,v=[],[]
path=[[] for i in range(n)]
for i in range(m):
ui,vi=[int(x)-1 for x in input().split()]
path[ui].append(vi)
# path[vi].append(ui)
s,t=[int(x)-1 for x in input().split()]
from collections import deque
q=deque()
q.append((s,0))
# print(path)
check=[[Fa... | p02991 |
#逆探索
N, M = list(map(int, input().split()))
E = []
for i in range(M):
e = list(map(int, input().split()))
e.reverse()
E.append(e)
S, T = list(map(int, input().split()))
keiro = []
for i in range(N):
keiro.append(set())
for e in E:
keiro[e[0]-1].add(e[1])
rireki = [{T}]
before = set()
... | #順探索
N, M = list(map(int, input().split()))
E = []
for i in range(M):
e = list(map(int, input().split()))
E.append(e)
S, T = list(map(int, input().split()))
keiro = [set()]
for i in range(N):
keiro.append(set())
for e in E:
keiro[e[0]].add(e[1])
reached = {S}
before = set()
after = reached... | p02991 |
from collections import deque
N, M = list(map(int, input().split()))
vec = [[] for _ in range(N)]
for _ in range(M) :
u, v = list(map(int, input().split()))
vec[u-1].append(v-1)
S, T = list(map(int, input().split()))
S, T = S - 1, T - 1
visited = [False] * N
visited[S] = True
queue1 = deque([(... | from collections import deque
N, M = list(map(int, input().split()))
vec = [[] for _ in range(N)]
for _ in range(M) :
u, v = list(map(int, input().split()))
vec[u-1].append(v-1)
S, T = list(map(int, input().split()))
S, T = S - 1, T - 1
visited = [[False] * N for _ in range(3)]
visited[0][S] = ... | p02991 |
from collections import deque
N,M = list(map(int,input().split()))
data = [[] for _ in range(3*N)]
for i in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
data[3*u].append(3*v+1)
data[3*u+1].append(3*v+2)
data[3*u+2].append(3*v)
S,T = list(map(int,input().split())... | from collections import deque
N,M = list(map(int,input().split()))
data = [[] for _ in range(3*N)]
for i in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
data[3*u].append(3*v+1)
data[3*u+1].append(3*v+2)
data[3*u+2].append(3*v)
S,T = list(map(int,input().split())... | p02991 |
from collections import defaultdict, deque
import sys
sys.setrecursionlimit(10**8)
N, M = list(map(int, input().split()))
e = defaultdict(list)
for i in range(M):
a, b = list(map(int, input().split()))
e[(a, 0)].append((b, 1))
e[(a, 1)].append((b, 2))
e[(a, 2)].append((b, 0))
S, T = list(m... | from collections import deque, defaultdict
N, M = list(map(int, input().split()))
edge = defaultdict(list)
for i in range(M):
a, b = list(map(int, input().split()))
edge[(a, 0)].append((b, 1))
edge[(a, 1)].append((b, 2))
edge[(a, 2)].append((b, 0))
S, T = list(map(int, input().split()))
i... | p02991 |
n, m = list(map(int, input().split()))
graph1 = [[] for _ in range(n)]
graph2 = [[] for _ in range(n)]
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph1[u].append(v)
# def dfs(v0, v, k):
# if k == 0:
# graph2[v0].append((1, v))
# return... | n, m = list(map(int, input().split()))
graph1 = [[] for _ in range(n*3)]
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph1[u*3+0].append(v*3+1)
graph1[u*3+1].append(v*3+2)
graph1[u*3+2].append(v*3+0)
s, t = list(map(int, input().split()))
s -= 1
t -=... | p02991 |
n, m = list(map(int, input().split()))
graph1 = [[] for _ in range(n*3)]
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph1[u*3+0].append(v*3+1)
graph1[u*3+1].append(v*3+2)
graph1[u*3+2].append(v*3+0)
s, t = list(map(int, input().split()))
s -= 1
t -=... | n, m = list(map(int, input().split()))
graph1 = [[] for _ in range(n * 3)]
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
graph1[u * 3 + 0].append(v * 3 + 1)
graph1[u * 3 + 1].append(v * 3 + 2)
graph1[u * 3 + 2].append(v * 3 + 0)
s, t = list(map(int, input... | p02991 |
import sys
from collections import deque
n,m = list(map(int,sys.stdin.readline().split()))
vertices = [[] for _ in range(n+1)]
jumpValue = [[-1,-1,-1] for _ in range(n+1)]
visited = set()
queue = []
temp = []
def bfs(arr,jump):
temp = []
for node in arr:
if jumpValue[node][(jump+1)%3]==-1:
... | import sys
from collections import deque
n,m = list(map(int,sys.stdin.readline().split()))
vertices = [[] for _ in range(n+1)]
jumpValue = [[-1,-1,-1] for _ in range(n+1)]
queue = []
def bfs(arr,jump):
for node in arr:
if jumpValue[node][(jump+1)%3]==-1:
queue.append([node,jump+1])
for... | p02991 |
import sys
from io import StringIO
import unittest
import os
from collections import deque
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
# 実装を行う関数
def resolve(test_def_name=""):
n, m = list(map(int, input().split()))
u_s = [list(map(int, input().split())) for i in range... | import sys
from io import StringIO
import unittest
import os
from collections import deque
import itertools
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
# 実装を行う関数
def resolve(test_def_name=""):
n, m = list(map(int, input().split()))
u_s = [list(map(int, input().split(... | p02991 |
n, m = list(map(int, input().split()))
path_list = [[] for _ in range(n)]
for i in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
path_list[u].append(v)
s, t = list(map(int, input().split()))
s -= 1
t -= 1
i = 0
dp = [[] for _ in range(3*n)]
dp[0].append(s)
while i < 3*n-1:
... | n, m = list(map(int, input().split()))
path_list = [[] for _ in range(n)]
for i in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
path_list[u].append(v)
s, t = list(map(int, input().split()))
s -= 1
t -= 1
i = 0
dp = [set() for _ in range(3)]
dp[0].add(s)
while i < 3*n-1:
a... | p02991 |
import queue
MOD = 10**9 +7
INF = 10**9
def main():
n,m = list(map(int,input().split()))
V0 = [[] for _ in range(n)]
V1 = [[] for _ in range(n)]
V2 = [[] for _ in range(n)]
for _ in range(m):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
V0[u].append... | from collections import deque
MOD = 10**9 +7
INF = 10**9
def main():
n,m = list(map(int,input().split()))
V0 = [[] for _ in range(n)]
V1 = [[] for _ in range(n)]
V2 = [[] for _ in range(n)]
for _ in range(m):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
... | p02991 |
from collections import deque
inf = float('inf')
N, M = list(map(int, input().split()))
es = [[] for _ in range(N * 3)]
# 有向グラフ
for _ in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
# 0-indexed
es[u].append(v + N)
es[u + N].append(v + N * 2)
es[u + N * 2... | from collections import deque
inf = float('inf')
n, m = list(map(int, input().split()))
es = [[] for _ in range(n * 3)]
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
es[u].append(v + n)
es[u + n].append(v + n * 2)
es[u + n * 2].append(v)
s, t = list(m... | p02991 |
def bfs(g, N, s, t):
from collections import deque
dist = [-1] * (N * 3)
dist[s] = 0
dq = deque()
dq.append(s)
while dq:
v = dq.popleft()
d = dist[v]
for u in g[v]:
if ~dist[u]: continue
dist[u] = d + 1
if u == t:
... | def main():
from collections import deque
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
g = tuple(set() for _ in range(N * 3))
for _ in range(M):
u, v = (int(x) - 1 for x in input().split())
g[u].add(v + N)
g[u + N].add(v + N + ... | p02991 |
from collections import deque
def main():
N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
u, v = list(map(int, input().split()))
edges[u - 1].append(v - 1)
converted_edges = [[] for _ in range(N)]
for v, v_edge in enumerate(edg... | from collections import deque
def main():
N, M = list(map(int, input().split()))
edges = [[] for _ in range(3 * N)]
for _ in range(M):
u, v = [int(x) - 1 for x in input().split()]
edges[3 * u].append(3 * v + 1)
edges[3 * u + 1].append(3 * v + 2)
edges[3 * u + 2]... | p02991 |
#coding: utf-8
from collections import deque
N, M = list(map(int, input().split()))
graph = {i:[] for i in range(1, N+1)}
for i in range(M):
u, v = list(map(int, input().split()))
graph[u].append(v)
# graph[v].append(u)
S, T = list(map(int, input().split()))
queue = deque([[graph[S][i], 0] for i in... | from sys import stdin
from collections import deque
def main():
#入力
readline=stdin.readline
n,m=list(map(int,readline().split()))
G=[[] for _ in range(n*3)]
for i in range(m):
a,b=[int(x)-1 for x in readline().split()]
for j in range(3):
G[3*a+j].append(3*b+(j+1... | p02991 |
from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
node_num, edge_num = list(map(int, input().split()))
graph_data = defaultdict(set)
abcde = [list(map(int, input().split())) for i in range(edge_num)]
for i in range(edge_num):
a, b = abcde[i]
... | from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
node_num, edge_num = list(map(int, input().split()))
graph_data = defaultdict(set)
abcde = [list(map(int, input().split())) for i in range(edge_num)]
for i in range(edge_num):
a, b = abcde[i]
... | p02991 |
#!/usr/bin/env python
import sys
def getVertex(i,e):
v= set()
for v1 in e[i]:
for v2 in e[v1]:
for v3 in e[v2]: v.add( v3 )
#
return v
#
n,m = [ int(x) for x in sys.stdin.readline().split() ]
e = { i:[] for i in range(n) }
for _ in range(m):
u,v = [ int(x) for x ... | #!/usr/bin/env python
import sys
v1mask= set()
v2mask= set()
def getVertex(i,e):
global v1mask, v2mask
v= set()
for v1 in e[i]:
if v1 in v1mask: continue
v1mask.add( v1 )
for v2 in e[v1]:
if v2 in v2mask: continue
v2mask.add( v2 )
... | p02991 |
from collections import deque
n, m = list(map(int, input().split()))
graph = [set([]) for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, input().split()))
graph[u].add(v)
graph3 = [set([]) for _ in range(n+1)]
for i, g in enumerate(graph):
if i == 0:
continue
gr... | from collections import deque
n, m = list(map(int, input().split()))
graph = [[[] for _ in range(3)] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, input().split()))
graph[u][0].append([v, 1])
graph[u][1].append([v, 2])
graph[u][2].append([v, 0])
s, t = list(map(int, input().sp... | p02991 |
from collections import deque
n, m = list(map(int, input().split()))
graph = [[[] for _ in range(3)] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, input().split()))
graph[u][0].append([v, 1])
graph[u][1].append([v, 2])
graph[u][2].append([v, 0])
s, t = list(map(int, input().sp... | from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, input().split()))
graph[u].append(v)
s, t = list(map(int, input().split()))
dist = [[-3] * 3 for _ in range(n+1)]
dist[s][0] = 0
q = deque([(s, 0)])
w... | p02991 |
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | p02991 |
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | p02991 |
import sys
import math
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(input())
def make_grid(h, w, num): ... | import sys
import math
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(input())
def make_grid(h, w, num): ... | p02991 |
import sys
from collections import Counter, deque, defaultdict
from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
from functools import reduce
from math import ceil, floor, log10, factorial
import math
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
INF = float('inf'... | import sys
from collections import Counter, deque, defaultdict
from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
from functools import reduce
from math import ceil, floor, log10, factorial
import math
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
INF = float('inf'... | p02991 |
import sys, collections
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
son = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
son[u-1].append(v-1)
S, T = list(map(int, input().split()))
graphB = [set() f... | import sys, collections
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
son = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
son[u-1].append(v-1)
S, T = list(map(int, input().split()))
graphB = [[] for ... | p02991 |
import sys, collections
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
son = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
son[u-1].append(v-1)
S, T = list(map(int, input().split()))
graphB = [set() f... | import sys, collections
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
son = [[] for i in range(N)]
for i in range(M):
u, v = list(map(int, input().split()))
son[u-1].append(v-1)
S, T = list(map(int, input().split()))
dist = [[-1, -1,... | p02991 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.