From ef76a9588304e05a703e81358ca227497cfa3460 Mon Sep 17 00:00:00 2001 From: zinnnn37 Date: Thu, 9 Oct 2025 23:33:22 +0900 Subject: [PATCH] =?UTF-8?q?[20251009]=20BOJ=20/=20G2=20/=20=EB=AC=B8?= =?UTF-8?q?=EC=A0=9C=EC=A7=91=20/=20=EA=B9=80=EB=AF=BC=EC=A7=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...2 \353\254\270\354\240\234\354\247\221.md" | 74 +++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 "zinnnn37/202510/9 BOJ G2 \353\254\270\354\240\234\354\247\221.md" diff --git "a/zinnnn37/202510/9 BOJ G2 \353\254\270\354\240\234\354\247\221.md" "b/zinnnn37/202510/9 BOJ G2 \353\254\270\354\240\234\354\247\221.md" new file mode 100644 index 00000000..4a05eb19 --- /dev/null +++ "b/zinnnn37/202510/9 BOJ G2 \353\254\270\354\240\234\354\247\221.md" @@ -0,0 +1,74 @@ +```java +import java.io.*; +import java.util.*; + +public class BJ_1766_문제집 { + + 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, M; + private static int[] inDegree; + + private static Queue q; + private static List[] graph; + + 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()); + + graph = new ArrayList[N + 1]; + for (int i = 1; i <= N; i++) { + graph[i] = new ArrayList<>(); + } + + inDegree = new int[N + 1]; + 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 PriorityQueue<>(); + } + + 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 v : graph[cur]) { + inDegree[v]--; + if (inDegree[v] == 0) { + q.offer(v); + } + } + } + + bw.write(sb.toString()); + bw.flush(); + bw.close(); + br.close(); + } + +} +``` \ No newline at end of file