結果

問題 No.1690 Power Grid
ユーザー tentententen
提出日時 2023-02-03 16:49:01
言語 Java21
(openjdk 21)
結果
AC  
実行時間 493 ms / 3,000 ms
コード長 4,946 bytes
コンパイル時間 2,649 ms
コンパイル使用メモリ 84,820 KB
実行使用メモリ 47,660 KB
最終ジャッジ日時 2024-07-02 15:37:11
合計ジャッジ時間 8,103 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,248 KB
testcase_01 AC 53 ms
37,112 KB
testcase_02 AC 52 ms
37,112 KB
testcase_03 AC 53 ms
37,256 KB
testcase_04 AC 54 ms
37,424 KB
testcase_05 AC 49 ms
37,080 KB
testcase_06 AC 237 ms
46,292 KB
testcase_07 AC 224 ms
46,308 KB
testcase_08 AC 264 ms
46,324 KB
testcase_09 AC 254 ms
46,356 KB
testcase_10 AC 86 ms
39,040 KB
testcase_11 AC 97 ms
39,148 KB
testcase_12 AC 49 ms
36,804 KB
testcase_13 AC 52 ms
37,224 KB
testcase_14 AC 142 ms
45,272 KB
testcase_15 AC 75 ms
38,596 KB
testcase_16 AC 342 ms
47,524 KB
testcase_17 AC 317 ms
47,660 KB
testcase_18 AC 206 ms
45,916 KB
testcase_19 AC 493 ms
47,448 KB
testcase_20 AC 427 ms
47,212 KB
testcase_21 AC 90 ms
39,036 KB
testcase_22 AC 257 ms
46,548 KB
testcase_23 AC 76 ms
38,576 KB
testcase_24 AC 149 ms
45,768 KB
testcase_25 AC 115 ms
40,848 KB
testcase_26 AC 104 ms
39,252 KB
testcase_27 AC 51 ms
37,212 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int h = sc.nextInt();
        int[] values = new int[n];
        long[][] costs = new long[n][n];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
            Arrays.fill(costs[i], Long.MAX_VALUE / 2);
            costs[i][i] = 0;
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int c = sc.nextInt();
            costs[a][b] = c;
            costs[b][a] = c;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    costs[j][k] = Math.min(costs[j][k], costs[j][i] + costs[i][k]);
                }
            }
        }
        UnionFindTree uft = new UnionFindTree(n);
        long ans = Long.MAX_VALUE;
        for (int i = 1; i < (1 << n); i++) {
            if (getPop(i) != h)  {
                continue;
            }
            PriorityQueue<Path> queue = new PriorityQueue<>();
            long current = 0;
            uft.clear();
            for (int j = 0; j < n; j++) {
                if ((i & (1 << j)) == 0) {
                    continue;
                }
                current += values[j];
                for (int k = j + 1; k < n; k++) {
                    if ((i & (1 << k)) == 0) {
                        continue;
                    }
                    queue.add(new Path(j, k, costs[j][k]));
                }
            }
            while (queue.size() > 0) {
                Path p = queue.poll();
                if (!uft.same(p)) {
                    current += p.value;
                    uft.unite(p);
                }
            }
            ans = Math.min(ans, current);
        }
        System.out.println(ans);
    }
    
    static int getPop(int x) {
        int pop = 0;
        while (x > 0) {
            pop += x % 2;
            x >>= 1;
        }
        return pop;
    }
    
    static class Path implements Comparable<Path> {
        int left;
        int right;
        long value;
        
        public Path(int left, int right, long value) {
            this.left = left;
            this.right = right;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            if (value == another.value) {
                return 0;
            } else if (value < another.value) {
                return -1;
            } else {
                return 1;
            }
        }
    }
    
    static class UnionFindTree {
        int[] parents;
        
        public UnionFindTree(int size) {
            parents = new int[size];
        }
        
        public void clear() {
            for (int i = 0; i < parents.length; i++) {
                parents[i] = i;
            }
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        } 
        
        public boolean same(Path p) {
            return same(p.left, p.right);
        }
        
        public void unite(int x, int y) {
            if (!same(x, y)) {
                parents[find(x)] = find(y);
            }
        }
        
        public void unite(Path p) {
            unite(p.left, p.right);
        }
    }
    
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
0