結果
問題 | No.748 yuki国のお財布事情 |
ユーザー |
![]() |
提出日時 | 2018-10-20 14:57:40 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 487 ms / 2,000 ms |
コード長 | 4,736 bytes |
コンパイル時間 | 2,821 ms |
コンパイル使用メモリ | 85,624 KB |
実行使用メモリ | 49,692 KB |
最終ジャッジ日時 | 2024-11-19 02:35:12 |
合計ジャッジ時間 | 10,441 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
import java.util.Arrays;public class Main {private static void solve() {int n = ni();int m = ni();int k = ni();int[] from = new int[m];int[] to = new int[m];int[] w = new int[m];long total = 0;for (int i = 0; i < m; i++) {from[i] = ni() - 1;to[i] = ni() - 1;w[i] = ni();total += w[i];}int[] f = na(k);long d = kruskal(from, to, w, n, f);System.out.println(total - d);}public static void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic void run() {long start = System.currentTimeMillis();String debug = args.length > 0 ? args[0] : null;if (debug != null) {try {is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));} catch (Exception e) {throw new RuntimeException(e);}}reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);solve();out.flush();tr((System.currentTimeMillis() - start) + "ms");}}, "", 64000000).start();}public static long kruskal(int[] one, int[] other, int[] w, int n, int[] f) {long d = 0;DisjointSet ds = new DisjointSet(n);for (int v : f) {ds.union(one[v - 1], other[v - 1]);d += w[v - 1];}int p = one.length;long[] ord = new long[p];for (int i = 0; i < p; i++)ord[i] = (long) w[i] << 32 | i;Arrays.sort(ord);for (int i = 0; i < ord.length; i++) {int cur = (int) ord[i];if (!ds.equiv(one[cur], other[cur])) {ds.union(one[cur], other[cur]);d += w[cur];}}return d;}static class DisjointSet {public int[] upper; // minus:num_element(root) plus:root(normal)// public int[] w;public DisjointSet(int n) {upper = new int[n];Arrays.fill(upper, -1);// w = new int[n];}public DisjointSet(DisjointSet ds) {this.upper = Arrays.copyOf(ds.upper, ds.upper.length);}public int root(int x) {return upper[x] < 0 ? x : (upper[x] = root(upper[x]));}public boolean equiv(int x, int y) {return root(x) == root(y);}public boolean union(int x, int y) {x = root(x);y = root(y);if (x != y) {if (upper[y] < upper[x]) {int d = x;x = y;y = d;}// w[x] += w[y];upper[x] += upper[y];upper[y] = x;}return x == y;}public int count() {int ct = 0;for (int u : upper) {if (u < 0)ct++;}return ct;}public int[][] toBucket() {int n = upper.length;int[][] ret = new int[n][];int[] rp = new int[n];for (int i = 0; i < n; i++) {if (upper[i] < 0)ret[i] = new int[-upper[i]];}for (int i = 0; i < n; i++) {int r = root(i);ret[r][rp[r]++] = i;}return ret;}}private static java.io.InputStream is = System.in;private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);private static java.util.StringTokenizer tokenizer = null;private static java.io.BufferedReader reader;public static String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new java.util.StringTokenizer(reader.readLine());} catch (Exception e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}private static double nd() {return Double.parseDouble(next());}private static long nl() {return Long.parseLong(next());}private static int[] na(int n) {int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = ni();return a;}private static char[] ns() {return next().toCharArray();}private static long[] nal(int n) {long[] a = new long[n];for (int i = 0; i < n; i++)a[i] = nl();return a;}private static int[][] ntable(int n, int m) {int[][] table = new int[n][m];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[i][j] = ni();}}return table;}private static int[][] nlist(int n, int m) {int[][] table = new int[m][n];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[j][i] = ni();}}return table;}private static int ni() {return Integer.parseInt(next());}private static void tr(Object... o) {if (is != System.in)System.out.println(java.util.Arrays.deepToString(o));}}