Submission #422332
Source Code Expand
n,q = gets.split.map(&:to_i) $f = [*0..n] def root(x) x=$f[x] until $f[x] == x x end q.times do p,a,b = gets.split.map(&:to_i) b,a = [a,b].shuffle case p when 0 $f[root(a)] = $f[root(b)] when 1 puts (root(a) == root(b)) ? 'Yes' : 'No' end end
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | cookies |
Language | Ruby (2.1.5p273) |
Score | 0 |
Code Size | 296 Byte |
Status | TLE |
Exec Time | 5034 ms |
Memory | 6764 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 | AC | 60 ms | 4964 KB |
subtask_01_01.txt | AC | 788 ms | 5240 KB |
subtask_01_02.txt | AC | 75 ms | 6632 KB |
subtask_01_03.txt | AC | 1239 ms | 4988 KB |
subtask_01_04.txt | AC | 1278 ms | 6632 KB |
subtask_01_05.txt | AC | 140 ms | 4968 KB |
subtask_01_06.txt | AC | 149 ms | 6624 KB |
subtask_01_07.txt | AC | 1243 ms | 4968 KB |
subtask_01_08.txt | AC | 1260 ms | 6504 KB |
subtask_01_09.txt | AC | 58 ms | 4844 KB |
subtask_01_10.txt | AC | 69 ms | 6612 KB |
subtask_01_11.txt | AC | 1236 ms | 4968 KB |
subtask_01_12.txt | AC | 1260 ms | 6508 KB |
subtask_01_13.txt | AC | 993 ms | 4968 KB |
subtask_01_14.txt | AC | 69 ms | 6504 KB |
subtask_01_15.txt | AC | 1213 ms | 4972 KB |
subtask_01_16.txt | AC | 1273 ms | 6504 KB |
subtask_01_17.txt | TLE | 5034 ms | 6636 KB |
subtask_01_18.txt | TLE | 5034 ms | 6764 KB |