結果
問題 | No.556 仁義なきサルたち |
ユーザー | tookunn_1213 |
提出日時 | 2017-08-12 08:44:28 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 158 ms / 2,000 ms |
コード長 | 2,435 bytes |
コンパイル時間 | 2,064 ms |
コンパイル使用メモリ | 77,828 KB |
実行使用メモリ | 41,968 KB |
最終ジャッジ日時 | 2024-04-21 05:52:17 |
合計ジャッジ時間 | 4,783 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,544 KB |
testcase_01 | AC | 54 ms
36,160 KB |
testcase_02 | AC | 54 ms
36,580 KB |
testcase_03 | AC | 53 ms
36,336 KB |
testcase_04 | AC | 54 ms
36,544 KB |
testcase_05 | AC | 54 ms
36,628 KB |
testcase_06 | AC | 54 ms
36,440 KB |
testcase_07 | AC | 57 ms
36,544 KB |
testcase_08 | AC | 54 ms
36,588 KB |
testcase_09 | AC | 57 ms
36,744 KB |
testcase_10 | AC | 63 ms
36,952 KB |
testcase_11 | AC | 72 ms
37,612 KB |
testcase_12 | AC | 69 ms
37,424 KB |
testcase_13 | AC | 100 ms
38,028 KB |
testcase_14 | AC | 132 ms
38,708 KB |
testcase_15 | AC | 120 ms
39,896 KB |
testcase_16 | AC | 132 ms
39,340 KB |
testcase_17 | AC | 145 ms
40,660 KB |
testcase_18 | AC | 158 ms
41,484 KB |
testcase_19 | AC | 139 ms
41,968 KB |
testcase_20 | AC | 136 ms
41,584 KB |
testcase_21 | AC | 138 ms
41,808 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { int N,M; int[] union,size; public void init(int n){ union = new int[n]; size = new int[n]; for(int i = 0;i < n;i++){ union[i] = i; } Arrays.fill(size,1); } public void unite(int x,int y){ x = root(x); y = root(y); if(x == y)return; if(size[x] < size[y]){ union[x] = y; size[y] += size[x]; size[x] = 0; }else if(size[x] > size[y]){ union[y] = x; size[x] += size[y]; size[y] = 0; }else{ if(x < y){ union[y] = x; size[x] += size[y]; size[y] = 0; }else{ union[x] = y; size[y] += size[x]; size[x] = 0; } } } public int root(int x){ if(union[x] == x)return x; return root(union[x]); } public boolean same(int x,int y){ return root(x) == root(y); } public void solve() { N = nextInt(); M = nextInt(); init(N); for(int i = 0;i < M;i++){ int a = nextInt()-1; int b = nextInt()-1; unite(a,b); } for(int i = 0;i < N;i++){ out.println(root(i) + 1); } } public static void main(String[] args) { out.flush(); new Main().solve(); out.close(); } /* Input */ private static final InputStream in = System.in; private static final PrintWriter out = new PrintWriter(System.out); private final byte[] buffer = new byte[2048]; private int p = 0; private int buflen = 0; private boolean hasNextByte() { if (p < buflen) return true; p = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) return false; return true; } public boolean hasNext() { while (hasNextByte() && !isPrint(buffer[p])) { p++; } return hasNextByte(); } private boolean isPrint(int ch) { if (ch >= '!' && ch <= '~') return true; return false; } private int nextByte() { if (!hasNextByte()) return -1; return buffer[p++]; } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = -1; while (isPrint((b = nextByte()))) { sb.appendCodePoint(b); } return sb.toString(); } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } }