Submission #421481
Source Code Expand
n,q = gets.split.map(&:to_i) f = [*0..n] q.times do p,a,b = gets.split.map(&:to_i) #a,b = [a,b].minmax case p when 0 f[a] = f[f[f[b]]] when 1 puts (f[f[a]] == f[f[b]]) ? 'Yes' : 'No' end end
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | cookies |
Language | Ruby (2.1.5p273) |
Score | 0 |
Code Size | 229 Byte |
Status | WA |
Exec Time | 1148 ms |
Memory | 6636 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 | 61 ms | 4964 KB |
subtask_01_01.txt | AC | 694 ms | 5228 KB |
subtask_01_02.txt | AC | 73 ms | 6632 KB |
subtask_01_03.txt | AC | 1076 ms | 5056 KB |
subtask_01_04.txt | AC | 1148 ms | 6620 KB |
subtask_01_05.txt | AC | 132 ms | 4972 KB |
subtask_01_06.txt | AC | 140 ms | 6636 KB |
subtask_01_07.txt | AC | 1060 ms | 4968 KB |
subtask_01_08.txt | AC | 1098 ms | 6636 KB |
subtask_01_09.txt | AC | 62 ms | 4972 KB |
subtask_01_10.txt | AC | 72 ms | 6632 KB |
subtask_01_11.txt | AC | 1055 ms | 4972 KB |
subtask_01_12.txt | AC | 1103 ms | 6636 KB |
subtask_01_13.txt | AC | 855 ms | 5100 KB |
subtask_01_14.txt | AC | 72 ms | 6636 KB |
subtask_01_15.txt | AC | 1078 ms | 4972 KB |
subtask_01_16.txt | AC | 1105 ms | 6636 KB |
subtask_01_17.txt | WA | 995 ms | 6636 KB |
subtask_01_18.txt | AC | 993 ms | 6636 KB |