Merge pull request #762 from AlgorithmWithGod/zinnnn37

[20250828] BOJ / G3 / 줄 세우기 / 김민진

Author: ShinHeeEul

zinnnn37/202508/28 BOJ G3 줄 세우기.md

@@ -0,0 +1,83 @@
+```java
+import java.io.BufferedReader;
+import java.io.BufferedWriter;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.io.OutputStreamWriter;
+import java.util.ArrayDeque;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Queue;
+import java.util.StringTokenizer;
+
+public class BJ_2252_줄_세우기 {
+
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static final StringBuilder sb = new StringBuilder();
+    private static StringTokenizer st;
+
+    private static int N;
+    private static int M;
+
+    private static int[] inDegree;
+    private static List<Integer>[] graph;
+    private static Queue<Integer> q;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        sol();
+    }
+
+    private static void init() throws IOException {
+        st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+        inDegree = new int[N + 1];
+        graph = new ArrayList[N + 1];
+        for (int i = 1; i <= N; i++) {
+            graph[i] = new ArrayList<>();
+        }
+
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+
+            int u = Integer.parseInt(st.nextToken());
+            int v = Integer.parseInt(st.nextToken());
+
+            graph[u].add(v);
+            inDegree[v]++;
+        }
+
+        q = new ArrayDeque<>();
+    }
+
+    private static void sol() throws IOException {
+        for (int i = 1; i <= N; i++) {
+            if (inDegree[i] == 0) {
+                q.offer(i);
+            }
+        }
+
+        while (!q.isEmpty()) {
+            int cur = q.poll();
+            sb.append(cur).append(" ");
+
+            for (int i : graph[cur]) {
+                inDegree[i]--;
+
+                if (inDegree[i] == 0) {
+                    q.offer(i);
+                }
+            }
+        }
+
+        bw.write(sb.toString());
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+}
+```