結果

問題 No.748 yuki国のお財布事情
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-10-20 14:57:40
言語 Java21
(openjdk 21)
結果
AC  
実行時間 398 ms / 2,000 ms
コード長 4,736 bytes
コンパイル時間 2,508 ms
コンパイル使用メモリ 81,016 KB
実行使用メモリ 60,324 KB
最終ジャッジ日時 2023-08-12 05:13:08
合計ジャッジ時間 8,908 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 61 ms
51,044 KB
testcase_01 AC 61 ms
50,788 KB
testcase_02 AC 63 ms
51,084 KB
testcase_03 AC 62 ms
50,716 KB
testcase_04 AC 62 ms
50,672 KB
testcase_05 AC 62 ms
50,972 KB
testcase_06 AC 61 ms
50,820 KB
testcase_07 AC 63 ms
50,836 KB
testcase_08 AC 62 ms
51,056 KB
testcase_09 AC 63 ms
50,720 KB
testcase_10 AC 67 ms
51,012 KB
testcase_11 AC 64 ms
50,832 KB
testcase_12 AC 62 ms
51,008 KB
testcase_13 AC 180 ms
57,072 KB
testcase_14 AC 211 ms
58,052 KB
testcase_15 AC 177 ms
57,916 KB
testcase_16 AC 250 ms
59,272 KB
testcase_17 AC 356 ms
60,324 KB
testcase_18 AC 381 ms
58,984 KB
testcase_19 AC 398 ms
59,828 KB
testcase_20 AC 386 ms
59,352 KB
testcase_21 AC 362 ms
60,028 KB
testcase_22 AC 63 ms
50,808 KB
testcase_23 AC 64 ms
50,728 KB
testcase_24 AC 62 ms
50,800 KB
testcase_25 AC 321 ms
60,264 KB
testcase_26 AC 369 ms
60,012 KB
testcase_27 AC 352 ms
58,852 KB
testcase_28 AC 329 ms
59,184 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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() {
      @Override
      public 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));
  }
}
0