7511번

· 백준
코드 import sys sys.setrecursionlimit(10**5) input = sys.stdin.readline 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 tc = int(input()) for i in range(tc): n = int(input()) k = int(input()) parent = [i for i in range(n+1)] for _ in range(k): a,b = map(int, input().split()) unio..