ABC168 D - .. (Double Dots)

提出

code: python

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

aisle = [[] for _ in range(n+1)]

for i in ab:

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

print(1)

else:

print(j)

break

解答

code: python

from collections import deque

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

aisle = [[] for _ in range(n+1)]

for i in ab:

# print(aisle)

# 部屋1に最小の移動回数でたどり着くことを求めるため、部屋1から出発する

while que:

q = que.popleft()

que.append(i)

# 出発元

# print(ans)

print("Yes")

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

テーマ

メモ

提出

code: python

from collections import defaultdict

from collections import deque

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

d = defaultdict(set)

q = deque()

for i in ab:

print(d)

# defaultdict(<class 'set'>, {1: {2}, 2: {1, 3, 4}, 3: {2, 4}, 4: {2, 3}})

miti = []

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

ans = 0

q.append(i)

while q:

print(q)

if next == 1:

q.clear()

break

else:

q.append(next)

print(ans)

print("=============")