Submission #2546439

---

Source Code Expand

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

C = [[0 for _ in range(n)] for _ in range(n) ]
nodes = []
for _ in range(m):
    x, y = map(int,input().split())
    C[x-1][y-1] = 1
    C[y-1][x-1]  =1
    nodes.append([x,y])

visited_node = [0]
visited_node.append(10 ** 10)

from collections import itertools

def bdf(node):
    

Submission Info

Judge Result