Cod sursa(job #2784696)

Utilizator Mirc100Mircea Octavian Mirc100 Data 17 octombrie 2021 01:40:48
Problema BFS - Parcurgere in latime Scor 70
Compilator py Status done
Runda Arhiva educationala Marime 0.7 kb
from collections import deque
f = open("bfs.in")
#n, m, s = (int(x) for x in f.readline().split())
n, m, s = [int(x) for x in f.readline().split()]
s -= 1
l = [[] for i in range(m)]
#for i in range(m):
for linie in f:
    x, y = [int(a) for a in linie.split()]
    l[x - 1].append(y - 1)
f.close()
d = [-1] * n
viz = [0] * n
c = deque()
c.append(s)
d[s] = 0
viz[s] = 1
while c:
    x = c.popleft()
    for y in l[x]:
        if viz[y] == 0:
            c.append(y)
            viz[y] = 1
            d[y] = d[x] + 1
f = open("bfs.out", "w")
# f.write(" ".join(str(x) for x in d))
#for x in d:
 #   f.write(str(x))
  #  f.write(" ")
f.writelines(map(lambda x:str(x)+' ',d))
f.close()