Merge pull request #1699 from AlgorithmWithGod/Seol-JY

[20251217] BOJ / G4 / 운동 / 설진영

Author: ShinHeeEul

Seol-JY/202512/17 BOJ G4 운동.md

@@ -0,0 +1,47 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static final int INF = 100_000_000;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int V = Integer.parseInt(st.nextToken());
+        int E = Integer.parseInt(st.nextToken());
+
+        int[][] dist = new int[V + 1][V + 1];
+
+        for (int i = 1; i <= V; i++) {
+            Arrays.fill(dist[i], INF);
+        }
+
+        for (int i = 0; i < E; 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;
+        }
+
+        for (int k = 1; k <= V; k++) {
+            for (int i = 1; i <= V; i++) {
+                for (int j = 1; j <= V; j++) {
+                    if (dist[i][k] + dist[k][j] < dist[i][j]) {
+                        dist[i][j] = dist[i][k] + dist[k][j];
+                    }
+                }
+            }
+        }
+
+        int ans = INF;
+        for (int i = 1; i <= V; i++) {
+            ans = Math.min(ans, dist[i][i]);
+        }
+
+        System.out.println(ans == INF ? -1 : ans);
+    }
+}
+```