heapq1 [백준 4386] 별자리 만들기 - Python(파이썬) 우선순위 큐인 heapq 사용! from heapq import heappop, heappush import sys def find(x): if home[x] < 0: return x home[x] = find(home[x]) return home[x] def union(a, b): home[b] = a n = int(sys.stdin.readline().strip()) arr = [list(map(float, sys.stdin.readline().split())) for _ in range(n)] home = [-1] * (n + 1) my_heap = [] answer = 0 cnt = 0 for i in range(n): for j in range(i+1, n): w, a, b = round(pow.. 2021. 3. 21. 이전 1 다음