183082025-10-18 21:15:46Zoli9Adószedőpython3Runtime error 16/30505ms32000 KiB
from collections import deque
seged = list(map(int, input().split()))
n = seged[0]
m = seged[1]
fo = seged[2]
elek = []
for i in range(n+1):
    elek.append([])
osszes = []
for u in range(m):
    a = list(map(int, input().split()))
    elek[a[0]].append(a[1])
    elek[a[1]].append(a[0])
    osszes.append([a[0], a[1]])
sor = deque([fo])
szintek = [-1]*(n+1)
szintek[fo] = 0
megoldas = []
count = 0
while len(sor)>0:
    aktualis = sor.popleft()
    for i in elek[aktualis]:
        if(szintek[i] == -1):
            sor.append(i)
            szintek[i] = (szintek[aktualis]+1)
        if (szintek[i] -1 )== szintek[aktualis]:
            megoldas.append([aktualis, i])
            count += 1
print(count)
for i in range(len(megoldas)):
    print(megoldas[i][0], megoldas[i][1])
SubtaskSumTestVerdictTimeMemory
base16/30
1Runtime error0/018ms3576 KiB
2Runtime error0/0504ms32000 KiB
3Accepted1/118ms3388 KiB
4Accepted1/119ms3384 KiB
5Accepted1/119ms3480 KiB
6Accepted1/118ms3620 KiB
7Accepted1/120ms3380 KiB
8Accepted1/121ms3628 KiB
9Accepted2/224ms3844 KiB
10Accepted2/228ms4148 KiB
11Accepted2/228ms4152 KiB
12Accepted2/285ms7500 KiB
13Accepted2/2193ms13264 KiB
14Runtime error0/2474ms32000 KiB
15Runtime error0/1446ms32000 KiB
16Runtime error0/1505ms32000 KiB
17Runtime error0/2474ms32000 KiB
18Runtime error0/2442ms32000 KiB
19Runtime error0/2470ms32000 KiB
20Runtime error0/2437ms32000 KiB
21Runtime error0/2441ms32000 KiB