코드 def distance(x1, y1, x2, y2): dist = ((x2-x1)**2 + (y2-y1)**2)**0.5 return dist def find(a,lst): if a != lst[a]: lst[a] = find(lst[a],lst) return lst[a] def union(a,b,lst): a = find(a,lst) b = find(b,lst) if a < b: lst[b] = a else: lst[a] = b import sys sys.setrecursionlimit(10**5) input = sys.stdin.readline n,m = map(int, input().split()) parent = [i for i in range(n+1)] graph = [0] for _ in..
