백준 14621 - 나만 안되는 연애

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748import sys,heapq def union(x,y): x = find(x) y = find(y) if x != y: parent[y] = x def find(x): if parent[x] == x: return x else: parent[x] = find(parent[x]) return parent[x] n, m = map(int, sys.stdin.readline().split())gender = list(map(str, sys.stdin.readline().split()))gender.insert(0,0)q = []for _ in range(m): u,v,d = map(int, sys.stdin.readline().split()) if gender[u] != gender[v]: heapq.heappush(q, [d,u,v]) parent = [int(i) for i in range(n+1)] ans = 0cnt = 0while q: c, a, b = heapq.heappop(q) if find(a..........

원문링크 : 백준 14621 - 나만 안되는 연애