Submission #5358985
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.util.*; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); int n = sc.nextInt(); int q = sc.nextInt(); UnionFindTree uf = new UnionFindTree(n); for(int i=0;i<q;i++){ System.out.println("go"); int p = sc.nextInt(); int a = sc.nextInt(); int b = sc.nextInt(); System.out.println(p); if(p==0){ uf.unite(a, b); } else{ if(uf.isEquivalent(a, b)){ System.out.println("Yes"); } else{ System.out.println("No"); } } } } } class UnionFindTree { int[] par; int[] rank; int[] peers; //仲間の数 public UnionFindTree(int n){ par = new int[n]; rank = new int[n]; peers = new int[n]; for(int i=0;i<n;i++){ par[i] = i; peers[i] = 1; } } //木の根を求める int find(int x){ if(par[x] == x){ return x; } else{ return par[x] = find(par[x]); } } //xとyの属する集合を併合 void unite(int x, int y){ int px = find(x); int py = find(y); if(px == py){ return; } else if(rank[px] < rank[py]){ peers[py] += peers[px]; par[px] = py; } else{ peers[px] += peers[py]; par[py] = px; if(rank[px]==rank[py]){ rank[px]++; } } } //xとyが同じ集合に属するか boolean isEquivalent(int x, int y){ return find(x) == find(y); } //xの仲間の数を求める int peersnum(int x){ return peers[find(x)]; } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next());} }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | warachia |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 3873 Byte |
Status | WA |
Exec Time | 2600 ms |
Memory | 54576 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_01.txt |
All | 00_sample_01.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | WA | 70 ms | 21076 KB |
subtask_01_01.txt | WA | 1633 ms | 43644 KB |
subtask_01_02.txt | WA | 70 ms | 20948 KB |
subtask_01_03.txt | WA | 2549 ms | 42768 KB |
subtask_01_04.txt | WA | 2524 ms | 52368 KB |
subtask_01_05.txt | WA | 333 ms | 26940 KB |
subtask_01_06.txt | WA | 316 ms | 26556 KB |
subtask_01_07.txt | WA | 2543 ms | 44748 KB |
subtask_01_08.txt | WA | 2593 ms | 53404 KB |
subtask_01_09.txt | WA | 75 ms | 20308 KB |
subtask_01_10.txt | WA | 74 ms | 22356 KB |
subtask_01_11.txt | WA | 2512 ms | 42304 KB |
subtask_01_12.txt | WA | 2600 ms | 53688 KB |
subtask_01_13.txt | WA | 2058 ms | 45316 KB |
subtask_01_14.txt | WA | 103 ms | 20820 KB |
subtask_01_15.txt | WA | 2523 ms | 47780 KB |
subtask_01_16.txt | WA | 2572 ms | 53276 KB |
subtask_01_17.txt | WA | 2158 ms | 53364 KB |
subtask_01_18.txt | WA | 2197 ms | 54576 KB |