From 31749d7f195e4d5ed2b9864730a5ef880b974bcf Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Tue, 10 Mar 2026 19:34:56 +0900
Subject: [PATCH] =?UTF-8?q?[20260310]=20BOJ=20/=20G2=20/=20=EC=B9=9C?=
 =?UTF-8?q?=EA=B5=AC=20=EB=84=A4=ED=8A=B8=EC=9B=8C=ED=81=AC=20/=20?=
 =?UTF-8?q?=EC=9D=B4=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...44\355\212\270\354\233\214\355\201\254.md" | 58 +++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 "JHLEE325/202603/10 BOJ G2 \354\271\234\352\265\254 \353\204\244\355\212\270\354\233\214\355\201\254.md"

diff --git "a/JHLEE325/202603/10 BOJ G2 \354\271\234\352\265\254 \353\204\244\355\212\270\354\233\214\355\201\254.md" "b/JHLEE325/202603/10 BOJ G2 \354\271\234\352\265\254 \353\204\244\355\212\270\354\233\214\355\201\254.md"
new file mode 100644
index 00000000..e30be4cc
--- /dev/null
+++ "b/JHLEE325/202603/10 BOJ G2 \354\271\234\352\265\254 \353\204\244\355\212\270\354\233\214\355\201\254.md"	
@@ -0,0 +1,58 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int[] parent;
+    static int[] count;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int T = Integer.parseInt(br.readLine());
+
+        StringBuilder sb = new StringBuilder();
+        while (T-- > 0) {
+            int F = Integer.parseInt(br.readLine());
+
+            parent = new int[F * 2];
+            count = new int[F * 2];
+            for (int i = 0; i < F * 2; i++) {
+                parent[i] = i;
+                count[i] = 1;
+            }
+
+            Map<String, Integer> map = new HashMap<>();
+            int id = 0;
+
+            for (int i = 0; i < F; i++) {
+                StringTokenizer st = new StringTokenizer(br.readLine());
+                String f1 = st.nextToken();
+                String f2 = st.nextToken();
+
+                if (!map.containsKey(f1)) map.put(f1, id++);
+                if (!map.containsKey(f2)) map.put(f2, id++);
+
+                sb.append(union(map.get(f1), map.get(f2))).append("\n");
+            }
+        }
+        System.out.print(sb.toString());
+    }
+
+    static int find(int x) {
+        if (parent[x] == x) return x;
+        return parent[x] = find(parent[x]);
+    }
+
+    static int union(int x, int y) {
+        x = find(x);
+        y = find(y);
+
+        if (x != y) {
+            parent[y] = x;
+            count[x] += count[y];
+        }
+
+        return count[x];
+    }
+}
+```