diff --git "a/JHLEE325/202509/22 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md" "b/JHLEE325/202509/22 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md" new file mode 100644 index 00000000..65d2c1e7 --- /dev/null +++ "b/JHLEE325/202509/22 BOJ G5 \355\232\214\354\236\245\353\275\221\352\270\260.md" @@ -0,0 +1,67 @@ +```java +import java.io.*; +import java.util.*; + +public class Main { + static final int INF = 987654321; + + public static void main(String[] args) throws Exception { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + StringTokenizer st; + StringBuilder sb = new StringBuilder(); + + int n = Integer.parseInt(br.readLine()); + int[][] arr = new int[n + 1][n + 1]; + + for (int i = 1; i <= n; i++) { + for (int j = 1; j <= n; j++) { + if (i == j) arr[i][j] = 0; + else arr[i][j] = INF; + } + } + + while (true) { + st = new StringTokenizer(br.readLine()); + int a = Integer.parseInt(st.nextToken()); + int b = Integer.parseInt(st.nextToken()); + if (a == -1 && b == -1) break; + arr[a][b] = 1; + arr[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 (arr[i][j] > arr[i][k] + arr[k][j]) { + arr[i][j] = arr[i][k] + arr[k][j]; + } + } + } + } + + int[] score = new int[n + 1]; + int minScore = INF; + for (int i = 1; i <= n; i++) { + int maxDist = 0; + for (int j = 1; j <= n; j++) { + maxDist = Math.max(maxDist, arr[i][j]); + } + score[i] = maxDist; + minScore = Math.min(minScore, maxDist); + } + + List candidates = new ArrayList<>(); + for (int i = 1; i <= n; i++) { + if (score[i] == minScore) { + candidates.add(i); + } + } + + sb.append(minScore).append(" ").append(candidates.size()).append("\n"); + for (int c : candidates) { + sb.append(c).append(" "); + } + System.out.println(sb.toString()); + } +} +```