
[백준][Python] 1976번 여행 가자

·
백준/분리 집합
코드def solution(): n = int(input()) m = int(input()) global parent parent = [i for i in range(n)] for i in range(n): row = list(map(int, input().split())) for j in range(n): if row[j] == 1: union(i, j) plan = list(map(int, input().split())) root = find_parent(plan[0] - 1) for i in range(m): if find_parent(plan[i] - 1) != root: print("NO") return print..