[BOJ] 17182 우주 탐사선 (JAVA)

https://www.acmicpc.net/problem/17182

17182번: 우주 탐사선

플로이드 워셜 + DFS로 해결했습니다.

 

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {

    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StringBuilder sb = new StringBuilder();
    static StringTokenizer st;
    static int N, K, result = Integer.MAX_VALUE;
    static int[][] dist;
    static boolean[] visited;

    public static void main(String[] args) throws Exception {

        st = new StringTokenizer(br.readLine(), " ");
        N = Integer.parseInt(st.nextToken());
        K = Integer.parseInt(st.nextToken());
        dist = new int[N][N];
        for (int i = 0; i < N; i++) {
            st = new StringTokenizer(br.readLine(), " ");
            for (int j = 0; j < N; j++) {
                dist[i][j] = Integer.parseInt(st.nextToken());
            }
        } // end of input

        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                for (int k = 0; k < N; k++) {
                    dist[j][k] = Math.min(dist[j][k], dist[j][i] + dist[i][k]);
                }
            }
        } // Floyd Warshall

        visited = new boolean[N];
        visited[K] = true;
        find(1, K, 0);

        System.out.print(result);

    }

    static void find(int cnt, int index, int sum) {

        if(cnt == N) {
            result = Math.min(result, sum);
            return;
        }

        for (int i = 0; i < N; i++) {

            if(!visited[i]) {

                visited[i] = true;
                find(cnt + 1, i, sum + dist[index][i]);
                visited[i] = false;

            }

        }

    }
	
}