結果
問題 | No.748 yuki国のお財布事情 |
ユーザー | uwi |
提出日時 | 2018-10-19 21:31:11 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 298 ms / 2,000 ms |
コード長 | 4,378 bytes |
コンパイル時間 | 5,746 ms |
コンパイル使用メモリ | 82,600 KB |
実行使用メモリ | 59,832 KB |
最終ジャッジ日時 | 2023-08-12 00:12:52 |
合計ジャッジ時間 | 10,850 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,440 KB |
testcase_01 | AC | 45 ms
49,508 KB |
testcase_02 | AC | 44 ms
49,436 KB |
testcase_03 | AC | 44 ms
49,564 KB |
testcase_04 | AC | 44 ms
49,444 KB |
testcase_05 | AC | 44 ms
49,476 KB |
testcase_06 | AC | 44 ms
49,568 KB |
testcase_07 | AC | 45 ms
49,440 KB |
testcase_08 | AC | 44 ms
47,352 KB |
testcase_09 | AC | 44 ms
49,552 KB |
testcase_10 | AC | 44 ms
49,540 KB |
testcase_11 | AC | 43 ms
49,432 KB |
testcase_12 | AC | 45 ms
49,720 KB |
testcase_13 | AC | 108 ms
52,864 KB |
testcase_14 | AC | 106 ms
52,736 KB |
testcase_15 | AC | 115 ms
53,016 KB |
testcase_16 | AC | 138 ms
55,348 KB |
testcase_17 | AC | 233 ms
59,256 KB |
testcase_18 | AC | 226 ms
58,840 KB |
testcase_19 | AC | 185 ms
58,136 KB |
testcase_20 | AC | 170 ms
57,668 KB |
testcase_21 | AC | 247 ms
59,464 KB |
testcase_22 | AC | 45 ms
49,712 KB |
testcase_23 | AC | 44 ms
49,448 KB |
testcase_24 | AC | 45 ms
49,484 KB |
testcase_25 | AC | 298 ms
59,832 KB |
testcase_26 | AC | 253 ms
59,340 KB |
testcase_27 | AC | 273 ms
59,628 KB |
testcase_28 | AC | 135 ms
54,892 KB |
ソースコード
package contest181019; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(), K = ni(); int[][] es = new int[m][]; for(int i = 0;i < m;i++) { es[i] = new int[] {ni()-1, ni()-1, ni()}; } long s = 0; for(int[] e : es)s += e[2]; long r = 0; int[] sel = na(K); int p = 0; DJSet ds = new DJSet(n); for(int i = 0;i < m;i++) { if(Arrays.binarySearch(sel, i+1) >= 0) { r += es[i][2]; ds.union(es[i][0], es[i][1]); }else { es[p++] = es[i]; } } es = Arrays.copyOf(es, p); Arrays.sort(es, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[2] - b[2]; } }); for(int[] e : es) { if(!ds.union(e[0], e[1])) { r += e[2]; } } out.println(s- r); } public static class DJSet { public int[] upper; public DJSet(int n) { upper = new int[n]; Arrays.fill(upper, -1); } 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; } 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; } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new E().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }