結果

問題 No.1639 最小通信路
ユーザー nishi5451nishi5451
提出日時 2021-08-07 12:09:31
言語 Java21
(openjdk 21)
結果
AC  
実行時間 181 ms / 2,000 ms
コード長 4,089 bytes
コンパイル時間 2,545 ms
コンパイル使用メモリ 78,976 KB
実行使用メモリ 55,764 KB
最終ジャッジ日時 2024-09-17 15:58:48
合計ジャッジ時間 8,146 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
50,480 KB
testcase_01 AC 53 ms
50,564 KB
testcase_02 AC 113 ms
52,340 KB
testcase_03 AC 179 ms
55,712 KB
testcase_04 AC 181 ms
55,764 KB
testcase_05 AC 88 ms
51,508 KB
testcase_06 AC 90 ms
52,072 KB
testcase_07 AC 52 ms
50,468 KB
testcase_08 AC 112 ms
52,016 KB
testcase_09 AC 55 ms
52,144 KB
testcase_10 AC 63 ms
50,740 KB
testcase_11 AC 109 ms
52,084 KB
testcase_12 AC 76 ms
51,756 KB
testcase_13 AC 112 ms
52,160 KB
testcase_14 AC 50 ms
50,596 KB
testcase_15 AC 80 ms
51,436 KB
testcase_16 AC 105 ms
51,972 KB
testcase_17 AC 110 ms
51,856 KB
testcase_18 AC 52 ms
50,344 KB
testcase_19 AC 89 ms
51,884 KB
testcase_20 AC 98 ms
52,100 KB
testcase_21 AC 49 ms
50,560 KB
testcase_22 AC 71 ms
51,620 KB
testcase_23 AC 93 ms
51,508 KB
testcase_24 AC 80 ms
51,100 KB
testcase_25 AC 104 ms
52,336 KB
testcase_26 AC 88 ms
52,108 KB
testcase_27 AC 56 ms
50,724 KB
testcase_28 AC 56 ms
50,564 KB
testcase_29 AC 130 ms
54,464 KB
testcase_30 AC 143 ms
54,628 KB
testcase_31 AC 102 ms
51,984 KB
testcase_32 AC 132 ms
54,728 KB
testcase_33 AC 93 ms
51,620 KB
testcase_34 AC 117 ms
54,516 KB
testcase_35 AC 158 ms
55,576 KB
testcase_36 AC 119 ms
54,668 KB
testcase_37 AC 136 ms
54,936 KB
testcase_38 AC 57 ms
50,448 KB
testcase_39 AC 107 ms
52,288 KB
testcase_40 AC 74 ms
51,168 KB
testcase_41 AC 99 ms
51,944 KB
testcase_42 AC 140 ms
54,788 KB
testcase_43 AC 93 ms
52,092 KB
testcase_44 AC 55 ms
50,592 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
	}
}
0