結果
| 問題 | No.330 Eigenvalue Decomposition |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-12-24 18:53:26 |
| 言語 | Java (openjdk 23) |
| 結果 |
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 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 31 |
ソースコード
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) {}}}