結果
問題 | No.1639 最小通信路 |
ユーザー | nishi5451 |
提出日時 | 2021-08-07 12:09:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 197 ms / 2,000 ms |
コード長 | 4,089 bytes |
コンパイル時間 | 4,128 ms |
コンパイル使用メモリ | 83,988 KB |
実行使用メモリ | 59,164 KB |
最終ジャッジ日時 | 2023-10-17 18:41:57 |
合計ジャッジ時間 | 11,168 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
53,772 KB |
testcase_01 | AC | 55 ms
53,776 KB |
testcase_02 | AC | 122 ms
55,884 KB |
testcase_03 | AC | 195 ms
59,164 KB |
testcase_04 | AC | 197 ms
58,900 KB |
testcase_05 | AC | 96 ms
54,648 KB |
testcase_06 | AC | 109 ms
55,520 KB |
testcase_07 | AC | 56 ms
52,724 KB |
testcase_08 | AC | 112 ms
56,116 KB |
testcase_09 | AC | 59 ms
53,744 KB |
testcase_10 | AC | 85 ms
54,392 KB |
testcase_11 | AC | 101 ms
55,180 KB |
testcase_12 | AC | 79 ms
54,924 KB |
testcase_13 | AC | 122 ms
55,732 KB |
testcase_14 | AC | 56 ms
53,776 KB |
testcase_15 | AC | 86 ms
54,460 KB |
testcase_16 | AC | 109 ms
55,600 KB |
testcase_17 | AC | 118 ms
55,472 KB |
testcase_18 | AC | 58 ms
51,752 KB |
testcase_19 | AC | 99 ms
55,176 KB |
testcase_20 | AC | 109 ms
55,568 KB |
testcase_21 | AC | 54 ms
53,780 KB |
testcase_22 | AC | 82 ms
54,720 KB |
testcase_23 | AC | 98 ms
55,200 KB |
testcase_24 | AC | 82 ms
52,892 KB |
testcase_25 | AC | 112 ms
55,700 KB |
testcase_26 | AC | 97 ms
54,648 KB |
testcase_27 | AC | 66 ms
54,364 KB |
testcase_28 | AC | 58 ms
53,804 KB |
testcase_29 | AC | 140 ms
57,780 KB |
testcase_30 | AC | 154 ms
58,268 KB |
testcase_31 | AC | 105 ms
55,680 KB |
testcase_32 | AC | 147 ms
57,984 KB |
testcase_33 | AC | 104 ms
55,144 KB |
testcase_34 | AC | 136 ms
57,788 KB |
testcase_35 | AC | 177 ms
58,868 KB |
testcase_36 | AC | 138 ms
58,000 KB |
testcase_37 | AC | 138 ms
58,152 KB |
testcase_38 | AC | 62 ms
53,808 KB |
testcase_39 | AC | 113 ms
55,596 KB |
testcase_40 | AC | 89 ms
54,452 KB |
testcase_41 | AC | 101 ms
54,716 KB |
testcase_42 | AC | 153 ms
58,200 KB |
testcase_43 | AC | 107 ms
55,624 KB |
testcase_44 | AC | 62 ms
53,808 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; class UFT { int[] par; int[] rank; int[] size; int n; int groups; public UFT(int n){ this.n = n; groups = n; par = new int[n]; rank = new int[n]; size = new int[n]; for(int i = 0; i < n; i++){ par[i] = i; rank[i] = 0; size[i] = 1; } } public int root(int x){ if(par[x] == x) return x; else return par[x] = root(par[x]); } public boolean merge(int x, int y){ x = root(x); y = root(y); if(x == y) return false; if(rank[x] < rank[y]){ par[x] = y; size[y] += size[x]; size[x] = 0; } else { par[y] = x; size[x] += size[y]; size[y] = 0; if(rank[x] == rank[y]) rank[x]++; } groups--; return true; } public boolean isSame(int x, int y){ return root(x) == root(y); } public boolean isConnected(){ int s = root(0); if(s == n) return true; else return false; } public int connectedComponents(){ return groups; } public int groupSize(int i){ return size[root(i)]; } } class Edge implements Comparable<Edge>{ int from, to; BigInteger cost; Edge(int from, int to, String s){ this.from = from; this.to = to; this.cost = new BigInteger(s); } @Override public int compareTo(Edge another){ return this.cost.compareTo(another.cost); } } public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); int n = fs.nextInt(); UFT uft = new UFT(n); Edge[] edges = new Edge[n*(n-1)/2]; for(int i = 0; i < n*(n-1)/2; i++){ int a = fs.nextInt() - 1; int b = fs.nextInt() - 1; String c = fs.next(); edges[i] = new Edge(a,b,c); } Arrays.sort(edges); BigInteger r = new BigInteger("0"); for(int i = 0; i < n*(n-1)/2; i++){ if(uft.merge(edges[i].from, edges[i].to)){ if(edges[i].cost.compareTo(r) == 1){ r = edges[i].cost; } } } pw.println(r); pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }