From 5c6013d276a65aaceb15e8d06714eaf25ef729f6 Mon Sep 17 00:00:00 2001 From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com> Date: Sat, 27 Sep 2025 14:53:40 +0900 Subject: [PATCH] =?UTF-8?q?[20250927]=20BOJ=20/=20G5=20/=20=EB=85=B8?= =?UTF-8?q?=EB=93=9C=EC=82=AC=EC=9D=B4=EC=9D=98=20=EA=B1=B0=EB=A6=AC=20/?= =?UTF-8?q?=20=EC=9D=B4=EC=A4=80=ED=9D=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...4\354\235\230 \352\261\260\353\246\254.md" | 55 +++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 "JHLEE325/202509/27 BOJ G5 \353\205\270\353\223\234\354\202\254\354\235\264\354\235\230 \352\261\260\353\246\254.md" diff --git "a/JHLEE325/202509/27 BOJ G5 \353\205\270\353\223\234\354\202\254\354\235\264\354\235\230 \352\261\260\353\246\254.md" "b/JHLEE325/202509/27 BOJ G5 \353\205\270\353\223\234\354\202\254\354\235\264\354\235\230 \352\261\260\353\246\254.md" new file mode 100644 index 00000000..e2a2b11f --- /dev/null +++ "b/JHLEE325/202509/27 BOJ G5 \353\205\270\353\223\234\354\202\254\354\235\264\354\235\230 \352\261\260\353\246\254.md" @@ -0,0 +1,55 @@ +```java +import java.io.*; +import java.util.*; + +public class Main { + static final int INF = 987654321; + + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + + int n = Integer.parseInt(st.nextToken()); + int m = Integer.parseInt(st.nextToken()); + + int[][] dist = new int[n+1][n+1]; + + + for (int i = 1; i <= n; i++) { + for (int j = 1; j <= n; j++) { + if (i == j) dist[i][j] = 0; + else dist[i][j] = INF; + } + } + + for (int i = 0; i < n - 1; i++) { + st = new StringTokenizer(br.readLine()); + int a = Integer.parseInt(st.nextToken()); + int b = Integer.parseInt(st.nextToken()); + int c = Integer.parseInt(st.nextToken()); + dist[a][b] = c; + dist[b][a] = c; + } + + for (int k = 1; k <= n; k++) { + for (int i = 1; i <= n; i++) { + for (int j = 1; j <= n; j++) { + if (dist[i][j] > dist[i][k] + dist[k][j]) { + dist[i][j] = dist[i][k] + dist[k][j]; + } + } + } + } + + StringBuilder sb = new StringBuilder(); + for (int i = 0; i < m; i++) { + st = new StringTokenizer(br.readLine()); + int from = Integer.parseInt(st.nextToken()); + int to = Integer.parseInt(st.nextToken()); + sb.append(dist[from][to]).append("\n"); + } + + System.out.print(sb.toString()); + } +} +```