提出 #74224874

---

ソースコード 拡げる

import java.io.*;
import java.util.*;

public class Main {
    static int K, S;
    static int[] T;
    static int[][] memo;
    static int[][] dist;
    private static final int INF = Integer.MAX_VALUE / 2;
    public static void main(String[] args) {
        InputReader reader = new InputReader(System.in);
        PrintWriter writer = new PrintWriter(System.out, false);
        int N = reader.nextInt();
        int M = reader.nextInt();
        dist = new int[N][N];
        for (int i = 0; i < N; i++) {
            Arrays.fill(dist[i], INF);
            dist[i][i] = 0;
        }
        for (int i = 0; i < M; i++) {
            int u = reader.nextInt() - 1;
            int v = reader.nextInt() - 1;
            int w = reader.nextInt();
            dist[u][v] = Math.min(dist[u][v], w);
        }
        for (int k = 0; k < N; k++) {
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
        }
        S = reader.nextInt() - 1;
        K = reader.nextInt();
        T = new int[K];
        for (int i = 0; i < K; i++) {
            T[i] = reader.nextInt() - 1;
        }
        memo = new int[(1 << K)][K];
        for (int[] row : memo) Arrays.fill(row, -1);
        int answer = INF;
        for (int i = 0; i < K; i++) {
            answer = Math.min(answer, dist[S][T[i]] + minCost(1 << i, i));
        }
        writer.println(answer == INF ? -1 : answer);
        writer.close();
        System.exit(0);
    }

    private static int minCost(int mask, int cur) {
        if (mask == (1 << K) - 1) return dist[T[cur]][S];
        if (memo[mask][cur] != -1) return memo[mask][cur];
        int result = INF;
        for (int nxt = 0; nxt < K; nxt++) {
            if ((mask & (1 << nxt)) == 0) {
                result = Math.min(result, dist[T[cur]][T[nxt]] + minCost(mask | (1 << nxt), nxt));
            }
        }
        memo[mask][cur] = result;
        return result;
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
        public String nextLine() {
            String str = "";
            try {
                str = reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

提出情報

ジャッジ結果