Merge pull request #1610 from AlgorithmWithGod/LiiNi-coder

[20251207] BOJ / G5 / 호석이 두마리 치킨 / 이인희

Author: ShinHeeEul

LiiNi-coder/202512/07 BOJ 호석이 두마리 치킨

@@ -0,0 +1,58 @@
+```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 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 < M; i++){
+			st = new StringTokenizer(br.readLine());
+			int a = Integer.parseInt(st.nextToken());
+			int b = Integer.parseInt(st.nextToken());
+			dist[a][b] = 1;
+			dist[b][a] = 1;
+		}
+		//플로이드워셜
+		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];
+					}
+				}
+			}
+		}
+		int bestI = 0;
+		int bestJ = 0;
+		int bestSum = INF;
+		for(int i = 1; i <= N; i++){
+			for(int j = i + 1; j <= N; j++){
+				int sum = 0;
+				for(int k = 1; k <= N; k++){
+					int d = Math.min(dist[k][i], dist[k][j]);
+					sum += d*2;
+				}
+				if(sum < bestSum){
+					bestSum = sum;
+					bestI = i;
+					bestJ = j;
+				}
+			}
+		}
+		System.out.println(bestI + " " + bestJ + " " + bestSum);
+	}
+}
+
+```