[BOJ] 집합의 표현 / 골드 5 / 60분 실패

https://www.acmicpc.net/problem/1717

Author: YoonYn9915

YoonYn9915/implementation/2025-03-08-[백준]-#1717-집합의 표현.py

@@ -0,0 +1,32 @@
+import sys
+
+sys.setrecursionlimit(1000000)
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+parent = [i for i in range(n + 1)]
+
+def find_parent(x):
+    if parent[x] != x:
+        parent[x] = find_parent(parent[x])
+    return parent[x]
+
+
+def union_parent(a, b):
+    a = find_parent(a)
+    b = find_parent(b)
+    if a < b:
+        parent[b] = a
+    else:
+        parent[a] = b
+
+
+for _ in range(m):
+    opr, a, b = map(int, input().split())
+    if opr == 0:
+        union_parent(a, b)
+    else:
+        if find_parent(a) == find_parent(b):
+            print("YES")
+        else:
+            print("NO")