A63 - Shortest Path 1 - 競プロ

A63 - Shortest Path 1

https://atcoder.jp/contests/tessoku-book/tasks/math_and_algorithm_an

提出

code: python

from collections import deque

n, m = map(int, input().split())

ab = list(map(int, input().split())) for _ in range(m)

g = {}

for i in range(1, n+1):

gi = set()

for a, b in ab:

gb.add(a)

ga.add(b)

print(g)

for k in range(1, n+1):

ans = 0

visited = False * (n+1)

visited1 = True

now = deque(g1)

if visitedk:

print(ans)

continue

while now:

# どうやって最小にする？

next = now.popleft()

ans += 1

visitednext = True

if visitedk:

print(ans)

break

else:

if k in gnext:

print(ans + 1)

visitedk = True

break

for v in gnext:

if visitedv:

continue

else:

now.append(v)

if not visitedk:

print(-1)

解答

code: python

from collections import deque

N, M = map(int, input().split())

ab = list(map(int, input().split())) for i in range(M)

G = list() for i in range(N + 1)

for a, b in ab:

Ga.append(b)

Gb.append(a)

ans = -1 * (N + 1)

ans1 = 0

now = deque()

now.append(1)

while len(now) >= 1:

next = now.popleft()

for v in Gnext:

if ansv == -1:

ansv = ansnext + 1

now.append(v)

for i in range(1, N + 1):

print(ansi)