結果

問題 No.330 Eigenvalue Decomposition
ユーザー ぴろずぴろず
提出日時 2015-12-24 18:53:26
言語 Java21
(openjdk 21)
結果
AC  
実行時間 249 ms / 5,000 ms
コード長 5,172 bytes
コンパイル時間 5,153 ms
コンパイル使用メモリ 79,724 KB
実行使用メモリ 69,256 KB
最終ジャッジ日時 2024-09-18 22:58:56
合計ジャッジ時間 9,080 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 175 ms
55,600 KB
testcase_01 AC 56 ms
50,444 KB
testcase_02 AC 66 ms
50,468 KB
testcase_03 AC 177 ms
55,856 KB
testcase_04 AC 58 ms
50,412 KB
testcase_05 AC 65 ms
50,256 KB
testcase_06 AC 186 ms
55,788 KB
testcase_07 AC 56 ms
50,268 KB
testcase_08 AC 165 ms
54,928 KB
testcase_09 AC 174 ms
54,952 KB
testcase_10 AC 60 ms
49,972 KB
testcase_11 AC 127 ms
52,244 KB
testcase_12 AC 233 ms
58,076 KB
testcase_13 AC 55 ms
50,448 KB
testcase_14 AC 133 ms
52,588 KB
testcase_15 AC 215 ms
67,440 KB
testcase_16 AC 55 ms
50,168 KB
testcase_17 AC 85 ms
52,156 KB
testcase_18 AC 249 ms
65,524 KB
testcase_19 AC 54 ms
50,428 KB
testcase_20 AC 95 ms
52,228 KB
testcase_21 AC 233 ms
56,016 KB
testcase_22 AC 79 ms
50,700 KB
testcase_23 AC 102 ms
52,136 KB
testcase_24 AC 170 ms
55,060 KB
testcase_25 AC 54 ms
50,336 KB
testcase_26 AC 84 ms
51,364 KB
testcase_27 AC 187 ms
69,256 KB
testcase_28 AC 55 ms
50,128 KB
testcase_29 AC 119 ms
58,844 KB
testcase_30 AC 56 ms
50,264 KB
testcase_31 AC 55 ms
50,032 KB
testcase_32 AC 54 ms
49,848 KB
testcase_33 AC 56 ms
50,304 KB
testcase_34 AC 55 ms
50,380 KB
testcase_35 AC 56 ms
50,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no330;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int m = io.nextInt();
		int[] a = new int[m];
		int[] b = new int[m];
		int[] c = new int[m];
		io.nextIntArrays(a,b,c);
		UnionFind uf = new UnionFind(n);
		for(int i=0;i<m;i++) {
			uf.union(a[i]-1, b[i]-1);
		}
		System.out.println(uf.groups().size());
	}

}
class UnionFind {
	private int[] parent;
	public UnionFind(int size) {
		parent = new int[size];
		Arrays.fill(parent, -1);
	}
	public boolean union(int x,int y) {
		x = root(x);
		y = root(y);
		if (x!=y) {
			if (parent[y] < parent[x]) {
				int tmp = y;
				y = x;
				x = tmp;
			}
			parent[x] += parent[y];
			parent[y] = x;
			return true;
		}
		return false;
	}
	public boolean isConnected(int x,int y) {
		return root(x)==root(y);
	}
	private int root(int x) {
		return parent[x] < 0 ? x : (parent[x] = root(parent[x]));
	}
	public int size(int x) {
		return -parent[root(x)];
	}
	public ArrayList<ArrayList<Integer>> groups() {
		int n = parent.length;
		ArrayList<ArrayList<Integer>> g = new ArrayList<ArrayList<Integer>>();
		HashMap<Integer,Integer> hm = new HashMap<Integer, Integer>();
		for(int i=0;i<n;i++) {
			int r = root(i);
			if (!hm.containsKey(r)) {
				hm.put(r, g.size());
				g.add(new ArrayList<Integer>());
			}
			g.get(hm.get(r)).add(i);
		}
		return g;
	}
	public String toString() {
		return Arrays.toString(parent);
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0