Submission #420795
Source Code Expand
n,q = gets.split.map(&:to_i) f = Hash[*([*0..n].map{|x| [x,x]}.flatten)] q.times do p,a,b = gets.split.map(&:to_i) a,b = [a,b].minmax case p when 0 f[b] = f[a] when 1 puts (f[b] == f[a]) ? 'Yes' : 'No' end end
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | cookies |
Language | Ruby (2.1.5p273) |
Score | 0 |
Code Size | 266 Byte |
Status | RE |
Exec Time | 1333 ms |
Memory | 13260 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 | 66 ms | 5112 KB |
subtask_01_01.txt | AC | 851 ms | 6632 KB |
subtask_01_02.txt | RE | 151 ms | 13160 KB |
subtask_01_03.txt | AC | 1308 ms | 5100 KB |
subtask_01_04.txt | RE | 149 ms | 13164 KB |
subtask_01_05.txt | AC | 143 ms | 5096 KB |
subtask_01_06.txt | RE | 152 ms | 13164 KB |
subtask_01_07.txt | AC | 1333 ms | 5096 KB |
subtask_01_08.txt | RE | 149 ms | 13164 KB |
subtask_01_09.txt | AC | 54 ms | 5072 KB |
subtask_01_10.txt | RE | 149 ms | 13140 KB |
subtask_01_11.txt | AC | 1287 ms | 5096 KB |
subtask_01_12.txt | RE | 150 ms | 13212 KB |
subtask_01_13.txt | AC | 1147 ms | 5480 KB |
subtask_01_14.txt | RE | 154 ms | 13160 KB |
subtask_01_15.txt | AC | 1331 ms | 5096 KB |
subtask_01_16.txt | RE | 150 ms | 13140 KB |
subtask_01_17.txt | RE | 149 ms | 13164 KB |
subtask_01_18.txt | RE | 150 ms | 13260 KB |